Abstract
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.
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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Formal Aspects of Computing |
Antal sider | 32 |
ISSN | 0934-5043 |
Status | Udgivet - 2010 |