Open AccessMatching of Bigraphs
Author(s) -
Lars Birkedal,
Troels C. Damgaard,
Arne John Glenstrup,
Robin Milner
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2007.04.013
Subject(s) - matching (statistics) , computer science , characterization (materials science) , theoretical computer science , 3 dimensional matching , algorithm , blossom algorithm , mathematics , statistics , materials science , nanotechnology
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom