Skip to content
Research

Research

Last updated on2010-06-30Research > Technical Reports > 2006 > TR-2006-93

Save as PDFSend to friendShare on Facebook

BDNF-Based Matching of Bigraphs


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


October 2006



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.

Technical report TR-2006-93 in IT University Technical Report Series, October 2006.

Available as PostScript, and PDF.


 

Find this page Online

http://212.97.130.100/en/Forskning/Technical-Reports/2006/TR-2006-93