Selected papers of the Second Workshop on Concurrency and compositionality
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
| Hi-index | 0.00 |
The semantics of process calculi has traditionally been specified by labelled transition systems (LTSs), but with the development of name calculi it turned out that definitions employing reduction semantics are sometimes more natural. Reactive Systems a la Leifer and Milner allow to derive from a reduction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This theory has been extended to G-Reactive Systems by Sassone and Sobocinki in order to properly handle structural equivalence. Universal Coalgebra provides a categorical framework where bisimilarity can be characterized as final semantics, i.e., each LTS can be mapped to a minimal realization identifying bisimilar states. Moreover, it is often possible to lift coalgebras to an algebraic setting (yielding bialgebras by Turi and Plotkin or, slightly more generally, structured coalgebras by Corradini, Heckel and Montanari) with the property that bisimilarity is compositional with respect to the lifted structure. The existence of minimal realizations is of theoretical interest, but it is even more of practical interest whenever LTSs are employed for finite state verification. In this paper we show that for every G-Reactive System we can build a coalgebra. Furthermore, if bisimilarity is compositional in the Reactive System, then we can lift this coalgebra to a structured coalgebra.