CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Selected papers of the Second Workshop on Concurrency and compositionality
On the greatest fixed point of a set functor
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Coalgebraic presentation of structured transition systems
Theoretical Computer Science
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures 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
A Coalgebraic Theory of Reactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Category of Explicit Fusions
Concurrency, Graphs and Models
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
A Net-based Approach to Web Services Publication and Replaceability
Fundamenta Informaticae - Petri Nets 2008
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
A Net-based Approach to Web Services Publication and Replaceability
Fundamenta Informaticae - Petri Nets 2008
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
| Hi-index | 0.00 |
Reactive Systems à la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This theory has been extended by the authors (together with Barbara König) in order to handle saturated bisimilarity, a coarser equivalence that is more adequate for some interesting formalisms, such as logic programming and open pi-calculus. In this paper we recast the theory of Reactive Systems inside Universal Coalgebra. This construction is particularly useful for saturated bisimilarity, which can be seen as final semantics of Normalized Coalgebras. These are structured coalgebras (not bialgebras) where the sets of transitions are minimized rather than maximized as in saturated LTS, still yielding the same semantics. We give evidence the effectiveness of our approach minimizing an Open Petri net in a category of Normalized Coalgebras.