Relating coalgebraic notions of bisimulation
Author:
Open Access
- 30 March 2011
- journal article
- research article
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 7, Iss (1)
Abstract
The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the four different generalizations coincide. We study transfinite sequences whose limits are the greatest bisimulations.Keywords
All Related Versions
This publication has 47 references indexed in Scilit:
- A unified approach to algebraic set theory2009
- Vietoris BisimulationsJournal of Logic and Computation, 2008
- Concurrency and automata on infinite sequences2005
- A final coalgebra theorem2005
- On topological set theoryMathematical Logic Quarterly, 2005
- A hierarchy of probabilistic system typesTheoretical Computer Science, 2004
- Bialgebraic Semantics and Recursion: (Extended Abstract)Electronic Notes in Theoretical Computer Science, 2001
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- Coalgebraic logicAnnals of Pure and Applied Logic, 1999
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983