Relating coalgebraic notions of bisimulation

@article{Staton2011RelatingCN,
  title={Relating coalgebraic notions of bisimulation},
  author={S. Staton},
  journal={Logical Methods in Computer Science},
  year={2011},
  volume={7}
}
  • S. Staton
  • Published 2011
  • Computer Science, Mathematics
  • 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. 

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 69 REFERENCES
    Relating Coalgebraic Notions of Bisimulation
    69
    Relators and Metric Bisimulations
    63
    Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
    166
    A Final Coalgebra Theorem
    303
    Comparing Operational Models of Name-Passing Process Calculi
    47
    On the final sequence of a finitary set functor
    97
    Similarity Quotients as Final Coalgebras
    • P. Levy
    • Computer Science, Mathematics
    • 2011
    34
    Vietoris Bisimulations
    15