BDNF-Based Matching of Bigraphs

Arne John Glenstrup; Troels Christoffer Damgaard; Lars Birkedal; Martin Elsman

BDNF-Based Matching of Bigraphs

Arne John Glenstrup, Troels Christoffer Damgaard, Lars Birkedal, Martin Elsman

Abstract

We analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.

Translated title of the contribution	BDNF-Based Matching of Bigraphs
Original language	English

Publication status	Published - 1 Oct 2006
Externally published	Yes

Cite this

@book{9a1e6506336243fba5d8c2a29eba3026,

title = "BDNF-Based Matching of Bigraphs",

abstract = "We analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.",

author = "Glenstrup, {Arne John} and Damgaard, {Troels Christoffer} and Lars Birkedal and Martin Elsman",

year = "2006",

month = oct,

day = "1",

language = "English",

}

TY - RPRT

T1 - BDNF-Based Matching of Bigraphs

AU - Glenstrup, Arne John

AU - Damgaard, Troels Christoffer

AU - Birkedal, Lars

AU - Elsman, Martin

PY - 2006/10/1

Y1 - 2006/10/1

N2 - We analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.

AB - We analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.

M3 - Report

BT - BDNF-Based Matching of Bigraphs

ER -