Matching of Bigraphs

Lars Birkedal; Troels Christoffer Damgaard; Arne J. Glenstrup; Robin Milner

doi:10.1016/j.entcs.2007.04.013

Matching of Bigraphs

Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner

Research output: Contribution to journal › Article › peer-review

Abstract

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.

Original language	English
Pages (from-to)	3-19
Number of pages	17
Journal	Electronic Notes in Theoretical Computer Science
Volume	175
Issue number	4
DOIs	https://doi.org/10.1016/j.entcs.2007.04.013
Publication status	Published - Jul 2007

Keywords / Materials (for Non-textual outputs)

Bigraphs
bigraphical reactive systems
matching
complete inductive characterization

Access to Document

10.1016/j.entcs.2007.04.013

Matching of BigraphsFinal published version, 416 KB

http://www.sciencedirect.com/science/article/pii/S1571066107004100#

Cite this

@article{8bcd3c6beb58420c93ce802cf9bc06b8,

title = "Matching of Bigraphs",

abstract = "We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.",

keywords = "Bigraphs, bigraphical reactive systems, matching, complete inductive characterization",

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

year = "2007",

month = jul,

doi = "10.1016/j.entcs.2007.04.013",

language = "English",

volume = "175",

pages = "3--19",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Matching of Bigraphs

AU - Birkedal, Lars

AU - Damgaard, Troels Christoffer

AU - Glenstrup, Arne J.

AU - Milner, Robin

PY - 2007/7

Y1 - 2007/7

N2 - We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.

AB - We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.

KW - Bigraphs

KW - bigraphical reactive systems

KW - matching

KW - complete inductive characterization

U2 - 10.1016/j.entcs.2007.04.013

DO - 10.1016/j.entcs.2007.04.013

M3 - Article

SN - 1571-0661

VL - 175

SP - 3

EP - 19

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 4

ER -

Matching of Bigraphs

Abstract

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this