Relating coalgebraic notions of bisimulation

61Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

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. ©S. Staton.

Cite

CITATION STYLE

APA

Staton, S. (2011). Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science, 7(1). https://doi.org/10.2168/LMCS-7(1:13)2011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free