POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Security, Cryptography and Directed Bigraphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
DBtk: a toolkit for directed bigraphs
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Deriving bisimulation congruences for conditional reactive systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
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.