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
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
In this paper we investigate the connection between two well known models for interactive systems. Reactive Systems a la Leifer and Milner allow to derive an interactive semantics from a reduction semantics guaranteeing, under rather restrictive conditions, the compositionality of the abstract semantics (bisimilarity). Universal Coalgebra provides a categorical framework where bisimilarity can be characterized as final semantics, i.e., as the unique morphism to the final coalgebra. Moreover, if lifting a coalgebra to a structured setting is possible, then bisimilarity is compositional with respect to the lifted structure. Here we show that for every 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.