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.
No takes yet. Share an insight, caveat, or question.
Birkedal et al. (2007) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: