Damgaard, Troels Christoffer1; Glenstrup, Arne John1; Birkedal, Lars1; Milner, Robin2
1 Programming, Logic and Semantics, Software & Systems, The Department2 University of Cambridge
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.