Axiomatizing binding bigraphs

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Troels C. Damgaard, IT University of Copenhagen, Denmark
  • Lars Birkedal
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner's axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner's for pure bigraphs.
Original languageEnglish
JournalNordic Journal of Computing
Volume33
Issue1
Pages (from-to)58 - 77
Number of pages20
ISSN1236-6064
Publication statusPublished - 2006
Externally publishedYes
EventNordic Workshop on Programming Theory - , Finland
Duration: 19 Oct 200521 Oct 2005
Conference number: 17

Workshop

WorkshopNordic Workshop on Programming Theory
Number17
CountryFinland
Period19/10/200521/10/2005

See relations at Aarhus University Citationformats

ID: 81354852