An inductive characterization of matching in binding bigraphs
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.
matching bigraphs complete inductive characterization bigraphical reactive systems