Matching of Bigraphs

Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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.
Original languageEnglish
Pages (from-to)3-19
Number of pages17
JournalElectronic Notes in Theoretical Computer Science
Issue number4
Publication statusPublished - Jul 2007

Keywords / Materials (for Non-textual outputs)

  • Bigraphs
  • bigraphical reactive systems
  • matching
  • complete inductive characterization


Dive into the research topics of 'Matching of Bigraphs'. Together they form a unique fingerprint.

Cite this