 |
 |
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)2011Relating coalgebraic notions of bisimulationArticle
Authors: Sam Staton NULLSam 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.
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
Funding:
- Source : OpenAIRE Graph
- Mathematical Operational Semantics for Data-Passing Processes; Funder: UK Research and Innovation; Code: EP/E042414/1
Bibliographic References
36 Documents citing this article
- Ruben Turkenburg
;Clemens Kupke;Jurriaan Rot;Ezra Schoen, Lecture notes in computer science, Preservation and Reflection of Bisimilarity via Invertible Steps, pp. 328-348, 2023, 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.
- Alexandre Goy;Daniela Petrişan;Marc Aiguier, Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces, 2022, 10.4230/lipics.icalp.2021.132.
- 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.
- Yuichi Komorida;Shin-ya Katsumata;Nick Hu;Bartek Klin;Samuel Humeau;et al., 2022, Codensity Games for Bisimilarity, arXiv (Cornell University), 40, 2, pp. 403-465, 10.1007/s00354-022-00186-y, https://arxiv.org/abs/1907.09634.
- Jim de Groot;Dirk Pattinson, ANU Open Research (Australian National University), Modal Intuitionistic Logics as Dialgebraic Logics, 2020, Saarbrücken Germany, 10.1145/3373718.3394807, https://openresearch-repository.anu.edu.au/bitstream/1885/311703/3/Modal%20Intuitionistic%20Logics%20as%20Dialgebraic%20Logics.pdf.jpg.
- 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, The Theory of Traces for Systems with Nondeterminism and Probability, 2019, Vancouver, BC, Canada, 10.1109/lics.2019.8785673, https://hal.archives-ouvertes.fr/hal-02187093.
- 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.
- Ana Sokolova;Harald Woracek, Lecture notes in computer science, Proper Semirings and Proper Convex Functors, pp. 331-347, 2018, 10.1007/978-3-319-89366-2_18, https://doi.org/10.1007/978-3-319-89366-2_18.
- Sebastian Enqvist;Sumit Sourabh, 2018, Bisimulations for coalgebras on Stone spaces, arXiv (Cornell University), 28, 6, pp. 991-1010, 10.1093/logcom/exy001, https://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, Data Archiving and Networked Services (DANS), 29, 4, pp. 419-468, 10.1093/logcom/exv091, http://resolver.tudelft.nl/uuid:d03656f1-6eb9-4d33-b91a-67187f3559c1.
- MAKOTO HAMANA;KAZUTAKA MATSUDA;KAZUYUKI ASADA, 2016, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, arXiv (Cornell University), 28, 2, pp. 287-337, 10.1017/s096012951600027x, https://arxiv.org/abs/1511.08851.
- 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, https://doi.org/10.1016/j.tcs.2016.01.012.
- Mehdi Zarrad;H. Peter Gumm, Lecture notes in computer science, Transitivity and Difunctionality of Bisimulations, pp. 33-52, 2016, 10.1007/978-3-319-40370-0_4, https://doi.org/10.1007/978-3-319-40370-0_4.
- Alexander Kurz;Jiří Velebil, 2015, Relation lifting, a survey, Journal of Logical and Algebraic Methods in Programming, 85, 4, pp. 475-499, 10.1016/j.jlamp.2015.08.002, https://doi.org/10.1016/j.jlamp.2015.08.002.
- 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.
- 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, Journal of Logical and Algebraic Methods in Programming, 84, 6, pp. 853-883, 10.1016/j.jlamp.2015.07.003, https://doi.org/10.1016/j.jlamp.2015.07.003.
- 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, https://arxiv.org/abs/1411.0090.
- Filippo Bonchi;Daniela Petrişan;Damien Pous;Jurriaan Rot, Coinduction up-to in a fibrational setting, 24, pp. 1-9, 2014, Vienna Austria, 10.1145/2603088.2603149, https://hal.archives-ouvertes.fr/hal-00936488.
- 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, https://doi.org/10.1016/j.jcss.2014.12.003.
- H. Peter Gumm;Mehdi Zarrad, Lecture notes in computer science, Coalgebraic Simulations and Congruences, pp. 118-134, 2014, 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, arXiv (Cornell University), Coalgebraic Weak Bisimulation from Recursive Equations over Monads, pp. 196-207, 2014, 10.1007/978-3-662-43951-7_17, http://arxiv.org/abs/1404.1215.
- Tomasz Brengos, Lecture notes in computer science, On Coalgebras with Internal Moves, pp. 75-97, 2014, 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, Theoretical Computer Science, 546, pp. 188-224, 10.1016/j.tcs.2014.03.009, https://doi.org/10.1016/j.tcs.2014.03.009.
- Shin-ya Katsumata;Tetsuya Sato, Lecture notes in computer science, Preorders on Monads and Coalgebraic Simulations, pp. 145-160, 2013, 10.1007/978-3-642-37075-5_10, https://doi.org/10.1007/978-3-642-37075-5_10.
- Vincenzo Ciancia, arXiv (Cornell University), Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras, pp. 110-125, 2013, 10.1007/978-3-642-40206-7_10, http://arxiv.org/abs/1209.5903.
- Giorgio Bacci;Marino Miculan, Lecture notes in computer science, Structural Operational Semantics for Continuous State Probabilistic Processes, pp. 71-89, 2012, 10.1007/978-3-642-32784-1_5, https://doi.org/10.1007/978-3-642-32784-1_5.
- Jiří Adámek;Filippo Bonchi;Mathias Hülsbusch;Barbara König;Stefan Milius;et al., Lecture notes in computer science, A Coalgebraic Perspective on Minimization and Determinization, pp. 58-73, 2012, 10.1007/978-3-642-28729-9_4, https://doi.org/10.1007/978-3-642-28729-9_4.
- Paweł Sobociński, Lecture notes in computer science, Relational Presheaves as Labelled Transition Systems, pp. 40-50, 2012, 10.1007/978-3-642-32784-1_3, https://doi.org/10.1007/978-3-642-32784-1_3.
- Tadeusz Litak;Dirk Pattinson;Katsuhiko Sano;Lutz Schröder, Lecture notes in computer science, Coalgebraic Predicate Logic, pp. 299-311, 2012, 10.1007/978-3-642-31585-5_29.
Share and export
Consultation statistics
This page has been seen 20148 times.
This article's PDF has been downloaded 571 times.