Relating coalgebraic notions of bisimulation

Sam Staton

doi:10.2168/LMCS-7(1:13)2011

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.

https://doi.org/10.2168/LMCS-7(1:13)2011

Source: arXiv.org:1101.4223

Volume: Volume 7, Issue 1

Secondary volumes: Selected Papers of the 3rd Conference on Algebra and Coalgebra in Computer Science (CALCO 2009)

Published on: March 30, 2011

Imported on: February 9, 2010

Keywords: Computer Science - Logic in Computer Science, F.3.2, G.2.m

Licence: arXiv.org - Non-exclusive license to distribute

Funding:

Source : OpenAIRE Graph

Mathematical Operational Semantics for Data-Passing Processes; Funder: UK Research and Innovation; Code: EP/E042414/1

Classifications

Mathematics Subject Classification 2020¹

Sources:

[1] zbMATH Open.

Bibliographic References

23 Documents citing this article

Ruben Turkenburg;Harsh Beohar;Clemens Kupke;Jurriaan Rot, 2024, Proving Behavioural Apartness, Radboud Repository (Radboud University), pp. 156-173, 10.1007/978-3-031-66438-0_8, https://hdl.handle.net/2066/311047.

Ruben Turkenburg;Clemens Kupke;Jurriaan Rot;Ezra Schoen, 2023, Preservation and Reflection of Bisimilarity via Invertible Steps, Lecture notes in computer science, pp. 328-348, 10.1007/978-3-031-30829-1_16, https://doi.org/10.1007/978-3-031-30829-1_16.

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.

Goy, Alexandre;Petrişan, Daniela;Aiguier, Marc, 2021, Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces, DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 10.4230/lipics.icalp.2021.132, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.132.

Jim de Groot;Dirk Pattinson, 2020, Modal Intuitionistic Logics as Dialgebraic Logics, ANU Open Research (Australian National University), pp. 355-369, 10.1145/3373718.3394807, http://hdl.handle.net/1885/311703.

Tsampas, Stelios;Williams, Christian;Nuyts, Andreas;Devriese, Dominique;Piessens, Frank, 2020, Abstract Congruence Criteria for Weak Bisimilarity, DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 10.4230/lipics.mfcs.2021.88, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.88.

Damien Pous;Davide Sangiorgi, 2019, Bisimulation and Coinduction Enhancements: A Historical Perspective, SPIRE - Sciences Po Institutional REpository, 31, 6, pp. 733-749, 10.1007/s00165-019-00497-w, https://hal.science/hal-02393949.

Filippo Bonchi;Ana Sokolova;Valeria Vignudelli, 2019, The Theory of Traces for Systems with Nondeterminism and Probability, CINECA IRIS Institutial research information system (University of Pisa), pp. 1-14, 10.1109/lics.2019.8785673.

Yuichi Komorida;Shin-ya Katsumata;Nick Hu;Bartek Klin;Ichiro Hasuo, 2019, Codensity Games for Bisimilarity, arXiv (Cornell University), 40, 2, pp. 403-465, 10.1007/s00354-022-00186-y, http://arxiv.org/abs/1907.09634.

Sebastian Enqvist;Sumit Sourabh, 2018, Bisimulations for coalgebras on Stone spaces, arXiv (Cornell University), 28, 6, pp. 991-1010, 10.1093/logcom/exy001, http://arxiv.org/abs/1412.4586.

ICHIRO HASUO;TOSHIKI KATAOKA;KENTA CHO, 2017, Coinductive predicates and final sequences in a fibration, Mathematical Structures in Computer Science, 28, 4, pp. 562-611, 10.1017/s0960129517000056, https://doi.org/10.1017/s0960129517000056.

Jean-Paul Mavoungou, 2017, Extensional quotient coalgebras, Acta Universitatis Sapientiae Mathematica, 9, 2, pp. 303-323, 10.1515/ausm-2017-0023, https://doi.org/10.1515/ausm-2017-0023.

Filippo Bonchi;Daniela Petrişan;Damien Pous;Jurriaan Rot, 2016, A general account of coinduction up-to, Acta Informatica, 54, 2, pp. 127-190, 10.1007/s00236-016-0271-4, https://doi.org/10.1007/s00236-016-0271-4.

Henning Basold;Helle Hvid Hansen, 2016, Well-definedness and observational equivalence for inductive–coinductive programs, Journal of Logic and Computation, 29, 4, pp. 419-468, 10.1093/logcom/exv091.

MAKOTO HAMANA;KAZUTAKA MATSUDA;KAZUYUKI ASADA, 2016, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, Mathematical Structures in Computer Science, 28, 2, pp. 287-337, 10.1017/s096012951600027x.

Alexander Kurz;Jiří Velebil, 2015, Relation lifting, a survey, Leicester Research Archive (University of Leicester), 85, 4, pp. 475-499, 10.1016/j.jlamp.2015.08.002, http://www.sciencedirect.com/science/article/pii/S2352220815000802.

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.

Tomasz Brengos;Marino Miculan;Marco Peressotti, 2015, Behavioural equivalences for coalgebras with unobservable moves, arXiv (Cornell University), 84, 6, pp. 826-852, 10.1016/j.jlamp.2015.09.002, http://arxiv.org/abs/1411.0090.

Paweł Sobociński, 2014, 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.

Sergey Goncharov;Dirk Pattinson, 2014, Coalgebraic Weak Bisimulation from Recursive Equations over Monads, Lecture notes in computer science, pp. 196-207, 10.1007/978-3-662-43951-7_17.

Ugo Montanari;Matteo Sammartino, 2014, A network-conscious π-calculus and its coalgebraic semantics, INFM-OAR (INFN Catania), 546, pp. 188-224, 10.1016/j.tcs.2014.03.009, https://www.openaccessrepository.it/record/88569.

Paweł Sobociński, 2012, Relational Presheaves as Labelled Transition Systems, pp. 40-50, 10.1007/978-3-642-32784-1_3, https://inria.hal.science/hal-01539889.

Tadeusz Litak;Dirk Pattinson;Katsuhiko Sano;Lutz Schröder, 2012, Coalgebraic Predicate Logic, Lecture notes in computer science, pp. 299-311, 10.1007/978-3-642-31585-5_29.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 21958 times.

This article's PDF has been downloaded 855 times.