Sam Staton - Relating coalgebraic notions of bisimulation

lmcs:670 - Logical Methods in Computer Science, March 30, 2011, Volume 7, Issue 1 -
Relating coalgebraic notions of bisimulation

Authors: Sam Staton

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.

Volume: Volume 7, Issue 1
Published on: March 30, 2011
Submitted on: February 9, 2010
Keywords: Computer Science - Logic in Computer Science,F.3.2, G.2.m


Consultation statistics

This page has been seen 18752 times.
This article's PDF has been downloaded 204 times.