Relating coalgebraic notions of bisimulation
Sam Staton (Laboratoire PPS, Universit\'e Paris 7)
TL;DR
This paper explores various generalizations of bisimulation within coalgebraic theory, establishing conditions for their equivalence and analyzing transfinite sequences leading to the greatest bisimulations.
Contribution
It introduces a unified framework relating four different coalgebraic bisimulation notions and identifies conditions for their equivalence.
Findings
Four bisimulation generalizations are related and conditions for their equivalence are provided.
Transfinite sequences are studied to characterize the greatest bisimulations.
The paper advances the theoretical understanding of coalgebraic transition systems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.