Sam Staton - Relating coalgebraic notions of bisimulation

lmcs:670 - Logical Methods in Computer Science, March 30, 2011, Volume 7, Issue 1 - https://doi.org/10.2168/LMCS-7(1:13)2011
Relating coalgebraic notions of bisimulationArticle

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
    Imported on: February 9, 2010
    Keywords: Computer Science - Logic in Computer Science,F.3.2, G.2.m
    Funding:
      Source : OpenAIRE Graph
    • Mathematical Operational Semantics for Data-Passing Processes; Funder: UK Research and Innovation; Code: EP/E042414/1

    37 Documents citing this article

    Consultation statistics

    This page has been seen 19662 times.
    This article's PDF has been downloaded 449 times.