A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Relating coalgebraic notions of bisimulation
2011
Logical Methods in Computer Science
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.
doi:10.2168/lmcs-7(1:13)2011
fatcat:khbpalgotbb6jatpya6dgsle3a