An Inductive Characterization of Matching in Binding Bigraphs

Troels Christoffer Damgaard; Arne John Glenstrup; Lars Birkedal; Robin Milner

An Inductive Characterization of Matching in Binding Bigraphs

Troels Christoffer Damgaard, Arne John Glenstrup, Lars Birkedal, Robin Milner

Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

Abstract

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.

Original language	English
Journal	Formal Aspects of Computing
Number of pages	32
ISSN	0934-5043
Publication status	Published - 2010

Keywords

Software
Theoretical Computer Science
Inductive Characterization
Matching
Binding Biographs

Cite this

@article{ba9d0475e6a443e18d9837d59e681664,

title = "An Inductive Characterization of Matching in Binding Bigraphs",

abstract = "We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems. ",

keywords = "Software, Theoretical Computer Science, Inductive Characterization, Matching, Binding Biographs, Software, Theoretical Computer Science, Inductive Characterization, Matching, Binding Biographs",

author = "Damgaard, {Troels Christoffer} and Glenstrup, {Arne John} and Lars Birkedal and Robin Milner",

year = "2010",

language = "English",

journal = "Formal Aspects of Computing",

issn = "0934-5043",

publisher = "Springer U K",

}

TY - JOUR

T1 - An Inductive Characterization of Matching in Binding Bigraphs

AU - Damgaard, Troels Christoffer

AU - Glenstrup, Arne John

AU - Birkedal, Lars

AU - Milner, Robin

PY - 2010

Y1 - 2010

N2 - We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.

AB - We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.

KW - Software

KW - Theoretical Computer Science

KW - Inductive Characterization

KW - Matching

KW - Binding Biographs

KW - Software

KW - Theoretical Computer Science

KW - Inductive Characterization

KW - Matching

KW - Binding Biographs

M3 - Journal article

SN - 0934-5043

JO - Formal Aspects of Computing

JF - Formal Aspects of Computing

ER -

An Inductive Characterization of Matching in Binding Bigraphs

Abstract

Keywords

Fingerprint

Cite this