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

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

37 Documents citing this article

Litan Kumar Das;Kumar Sankar Ray;Prakash Chandra Mali, 2024, Coalgebraic fuzzy geometric logic, International Journal of Information Technology, 16, 6, pp. 3825-3836, 10.1007/s41870-024-01905-y.

Ruben Turkenburg;Harsh Beohar;Clemens Kupke;Jurriaan Rot, 2024, Proving Behavioural Apartness, Lecture notes in computer science, pp. 156-173, 10.1007/978-3-031-66438-0_8.

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.

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.

Alexandre Goy;Daniela Petrişan;Marc Aiguier, 2021, Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), 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.

Stelios Tsampas;Christian Williams;Dominique Devriese;Frank Piessens, 2020, Abstract Congruence Criteria for Weak Bisimilarity, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), 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, 31, 6, pp. 733-749, 10.1007/s00165-019-00497-w, https://hal.science/hal-02393949.

Filippo Bonchi;Ana Sokolova;Valeria Vignudelli;Filippo Bonchi;Ana Sokolova;et al., 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.

Jean-Paul Mavoungou, 2019, Isomorphism Theorems for Coalgebras, Annales Mathematicae Silesianae, 33, 1, pp. 210-220, 10.2478/amsil-2018-0014, https://doi.org/10.2478/amsil-2018-0014.

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.

Marino Miculan;Marco Peressotti, 2016, Structural operational semantics for non-deterministic processes with quantitative aspects, Theoretical Computer Science, 655, pp. 135-154, 10.1016/j.tcs.2016.01.012.

Mehdi Zarrad;H. Peter Gumm, 2016, Transitivity and Difunctionality of Bisimulations, pp. 33-52, 10.1007/978-3-319-40370-0_4, https://inria.hal.science/hal-01446032.

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.

Diego Latella;Mieke Massink;Erik de Vink, 2015, A Definition Scheme for Quantitative Bisimulation, Electronic Proceedings in Theoretical Computer Science, 194, pp. 63-78, 10.4204/eptcs.194.5, https://doi.org/10.4204/eptcs.194.5.

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.

Roberto Bruni;Ugo Montanari;Matteo Sammartino, 2015, A coalgebraic semantics for causality in Petri nets, arXiv (Cornell University), 84, 6, pp. 853-883, 10.1016/j.jlamp.2015.07.003, http://arxiv.org/abs/1507.06462.

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.

Filippo Bonchi;Daniela Petrişan;Damien Pous;Jurriaan Rot, 2014, Coinduction up-to in a fibrational setting, arXiv (Cornell University), pp. 1-9, 10.1145/2603088.2603149, http://arxiv.org/abs/1401.6675.

Giorgio Bacci;Marino Miculan, 2014, Structural operational semantics for continuous state stochastic transition systems, Journal of Computer and System Sciences, 81, 5, pp. 834-858, 10.1016/j.jcss.2014.12.003.

H. Peter Gumm;Mehdi Zarrad, 2014, Coalgebraic Simulations and Congruences, Lecture notes in computer science, pp. 118-134, 10.1007/978-3-662-44124-4_7, https://doi.org/10.1007/978-3-662-44124-4_7.

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.

Tomasz Brengos, 2014, On Coalgebras with Internal Moves, Lecture notes in computer science, pp. 75-97, 10.1007/978-3-662-44124-4_5, https://doi.org/10.1007/978-3-662-44124-4_5.

Ugo Montanari;Matteo Sammartino, 2014, A network-conscious π-calculus and its coalgebraic semantics, Zenodo (CERN European Organization for Nuclear Research), 546, pp. 188-224, 10.1016/j.tcs.2014.03.009, https://www.openaccessrepository.it/record/88569.

Shin-ya Katsumata;Tetsuya Sato, 2013, Preorders on Monads and Coalgebraic Simulations, Lecture notes in computer science, pp. 145-160, 10.1007/978-3-642-37075-5_10, https://doi.org/10.1007/978-3-642-37075-5_10.

Vincenzo Ciancia, 2013, Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras, arXiv (Cornell University), pp. 110-125, 10.1007/978-3-642-40206-7_10, http://arxiv.org/abs/1209.5903.

Giorgio Bacci;Marino Miculan, 2012, Structural Operational Semantics for Continuous State Probabilistic Processes, pp. 71-89, 10.1007/978-3-642-32784-1_5, https://hal.inria.fr/hal-01539880.

Jiří Adámek;Filippo Bonchi;Mathias Hülsbusch;Barbara König;Stefan Milius;et al., 2012, A Coalgebraic Perspective on Minimization and Determinization, Lecture notes in computer science, pp. 58-73, 10.1007/978-3-642-28729-9_4, https://doi.org/10.1007/978-3-642-28729-9_4.

Paweł Sobociński, 2012, Relational Presheaves as Labelled Transition Systems, pp. 40-50, 10.1007/978-3-642-32784-1_3, https://hal.inria.fr/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 21633 times.

This article's PDF has been downloaded 755 times.