| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423616 | Electronic Notes in Theoretical Computer Science | 2007 | 17 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
