Matching of Bigraphs
Lars Birkedal, Troels Christoffer Damgaard, Arne John Glenstrup, Robin Milner · Electronic Notes in Theoretical Computer Science · 2007
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.