Characterising behavioural equivalence: three sides of one coin

Authors:
Clemens Kupke;Raul Andres Leal
Affiliations:
Imperial College London, London, United Kingdom;Universiteit van Amsterdam, Amsterdam, The Netherlands
Venue:
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Year:
2009

Citing 11
Cited 0

Abstract and concrete categories

Abstract and concrete categories
A hidden agenda

Theoretical Computer Science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Modal logic

Modal logic
Modal and temporal properties of processes

Modal and temporal properties of processes
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Final Coalgebra Theorem

Category Theory and Computer Science
Coalgebraic modal logic: soundness, completeness and decidability of local consequence

Theoretical Computer Science
Coalgebraic modal logic of finite rank

Mathematical Structures in Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond

Theoretical Computer Science
A logic of coequations

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We relate three different, but equivalent, ways to characterise behavioural equivalence for set coalgebras. These are: using final coalgebras, using coalgebraic languages that have the Hennessy- Milner property and using coalgebraic languages that have "logical congruences". On the technical side the main result of our paper is a straight forward construction of the final T-coalgebra of a set functor using a given logical language that has the Hennessy-Milner property with respect to the class of T-coalgebras.