Terminal coalgebras in well-founded set theory
Theoretical Computer Science
A co-induction principle for recursively defined domains
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Initial Algebra and Final Coalgebra Semantics for Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Category Theory and Computer Science
Categorical Modelling of Structural Operational Rules: Case Studies
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
A coalgebraic approach to the semantics of the ambient calculus
Theoretical Computer Science - Algebra and coalgebra in computer science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Towards a coalgebraic semantics of the ambient calculus
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.00 |
An abstract coalgebraic approach to well-structured relations on processes is presented, based on notions of tests and test suites. Preorders and equivalences on processes are modelled as coalgebras for behaviour endofunctors lifted to a category of test suites. The general framework is specialized to the case of finitely branching labelled transition systems. It turns out that most equivalences from the so-called van Glabbeek spectrum can be described by well-structured test suites. As an immediate application, coinductive proof principles are described for these equivalences, in particular for trace equivalence.