Matching of Bigraphs

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.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner
• Keywords: Complete Inductive Characterization, Correct Matching Algorithm, ENTCS 2007, Matching Problem