Relating coalgebraic notions of bisimulation
Author:
- Sam StatonSSSam Staton
Preprint
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 22 references indexed in Scilit:
- Bisimulation and cocongruence for probabilistic systemsInformation and Computation, 2006
- Comparing operational models of name-passing process calculiInformation and Computation, 2006
- On topological set theoryMathematical Logic Quarterly, 2005
- Structural Induction and Coinduction in a Fibrational SettingInformation and Computation, 1998
- A theory of bisimulation for the π-calculusActa Informatica, 1996
- A completeness theorem for open mapsAnnals of Pure and Applied Logic, 1994
- Introduction to extensive and distributive categoriesJournal of Pure and Applied Algebra, 1993
- Some remarks on Maltsev and Goursat categoriesApplied Categorical Structures, 1993
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983