Relating coalgebraic notions of bisimulationArticle
Authors: Sam Staton
NULL
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.
Alex C. Keizer;Henning Basold;Jorge A. Pérez, 2022, Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types, ACM Transactions on Programming Languages and Systems, 44, 3, pp. 1-45, 10.1145/3527633, https://doi.org/10.1145/3527633.
Valentin Cassano;Raul Fervari;Carlos Areces;Pablo F Castro, 2022, Algebraic tools for default modal systems, Journal of Logic and Computation, 33, 6, pp. 1301-1325, 10.1093/logcom/exac051.
Jim de Groot;Dirk Pattinson, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Modal Intuitionistic Logics as Dialgebraic Logics, 2020, Saarbrücken Germany, 10.1145/3373718.3394807.
Lutz Schröder;Dirk Pattinson;Tadeusz Litak, 2015, A Van Benthem/Rosen theorem for coalgebraic predicate logic, Journal of Logic and Computation, pp. exv043, 10.1093/logcom/exv043.
Diego Latella;Mieke Massink;Erik de Vink, 2015, A Definition Scheme for Quantitative Bisimulation, arXiv (Cornell University), 194, pp. 63-78, 10.4204/eptcs.194.5.
Paweł Sobociński, 2015, Relational presheaves, change of base and weak simulation, Journal of Computer and System Sciences, 81, 5, pp. 901-910, 10.1016/j.jcss.2014.12.007.