Reactive Systems over Directed Bigraphs

We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs. First we consider wide transition systems whose labels are all those generated by the IPO construction; the corresponding bisimulation is always a congruence. Then, we show that these LTSs can be simplified further by restricting to a subclass of labels, which can be characterized syntactically. We apply this theory to the Fusion calculus: we give an encoding of Fusion in directed bigraphs, and describe its simplified wide transition system and corresponding bisimulation.

• Type: Conference
• Year: 2007
• Where: CONCUR
• Authors: Davide Grohmann, Marino Miculan
• Keywords: CONCUR 2007, Corresponding Bisimulation, Labelled Transition Systems, Transition System