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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Grohmann, D., & Miculan, M. (2007). Reactive systems over directed bigraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4703 LNCS, pp. 380–394). Springer Verlag. https://doi.org/10.1007/978-3-540-74407-8_26
Mendeley helps you to discover research relevant for your work.