@book{8994e43ecaad471cb59754dcffa953c3,
title = "BDNF-Based Matching of Bigraphs",
abstract = "AbstractWe analyze the matching problem for bigraphs. In particular, we present an axiomatization of the static theory of binding bigraphs, a non-trivial extension of the axiomatization of pure bigraphs developed by Milner. Based directly on the term language resulting from the axiomatization we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for an actual matching algorithm, as needed for an implementation of bigraphical reactive systems.",
keywords = "bigraphs, binding, matching, axiomatization, inductive characterization",
author = "Damgaard, \{Troels Christoffer\} and Martin Elsman and Lars Birkedal and Glenstrup, \{Arne John\}",
year = "2006",
month = oct,
language = "English",
series = "IT University Technical Report Series",
number = "TR-2006-93",
edition = "TR-2006-93",
}