BDNF-Based Matching of Bigraphs

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

BDNF-Based Matching of Bigraphs

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

Publikation: Bog / Antologi / Rapport / Ph.D.-afhandling › Rapport › Forskning

Abstract

AbstractWe 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.

Originalsprog	Engelsk

Udgivelsessted	Copenhagen
Udgave	TR-2006-93
Antal sider	48
ISBN (Elektronisk)	87-7949-137-5
Status	Udgivet - okt. 2006

Navn	IT University Technical Report Series
Nummer	TR-2006-93
ISSN	1600-6100

Adgang til dokumentet

ITU-TR-2006-93 pdfForlagets udgivne version, 455 KB

Citationsformater

@book{8994e43ecaad471cb59754dcffa953c3,

title = "BDNF-Based Matching of Bigraphs",

abstract = "AbstractWe 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 = "Damgaard, {Troels Christoffer} and Martin Elsman and Lars Birkedal and Glenstrup, {Arne John}",

year = "2006",

month = oct,

language = "English",

series = "IT University Technical Report Series",

number = "TR-2006-93",

edition = "TR-2006-93",

}

TY - RPRT

T1 - BDNF-Based Matching of Bigraphs

AU - Damgaard, Troels Christoffer

AU - Elsman, Martin

AU - Birkedal, Lars

AU - Glenstrup, Arne John

PY - 2006/10

Y1 - 2006/10

N2 - AbstractWe 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 - AbstractWe 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.

BDNF-Based Matching of Bigraphs

Abstract

Adgang til dokumentet

Fingeraftryk

Citationsformater