Characterising behavioural equivalence: Three sides of one coin

Journal article

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 straightforward 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. © 2009 Springer Berlin Heidelberg.

Authors: Kupke, C; Leal, R

• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Volume: 5728 LNCS
• Pages: 97-112
• Publication date: 2009-01-01
• DOI: 10.1007/978-3-642-03741-2_8
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English