# On the origins of bisimulation and coinduction

@inproceedings{Sangiorgi2009OnTO,
title={On the origins of bisimulation and coinduction},
author={Davide Sangiorgi},
booktitle={TOPL},
year={2009}
}
The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory. Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some…
194 Citations

## Figures from this paper

Bisimulation and Coinduction Enhancements: A Historical Perspective
• Computer Science
Formal Aspects of Computing
• 2019
The origins and the developments of the topic are reviewed and techniques to make proofs shorter and simpler have become a research topic on its own.
Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story
• Computer Science
PROLE
• 2015
It was the intention to prove continuity with respect to projections, but unfortunately the issue remains open and only several partial results are presented in this paper.
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs
• Computer Science
LICS
• 2022
Bouncing-validity is defined: a new, generalized, validity criterion for fixed-point logics, which takes axioms and cuts into account, and it is proved that it is undecidable in general but identifies a hierarchy of decidable sub-criteria in the circular case.
Logic Programming and Bisimulation
The logic programming encoding of the set-theoretic graph property known as bisimulation, of central importance in non-well-founded set theory, semantics of concurrency, model checking, and coinductive reasoning, is analyzed.
Labelled Execution Systems ∗ Eleftherios Matsikoudis
• Computer Science
• 2012
A new type of system is introduced, in which, instead of labelled transitions, the authors have, essentially, sequences of labelled Transition systems, and this work uses a coalgebraic representation to obtain a suitable concept of bisimilarity among systems.
Logical Characterisation of Parameterised Bisimulations
• Computer Science
ICTAC
• 2017
A generalised framework of parameterised bisimulation is used to develop a parameterised logical characterisation, thereby, unifying the existing logical characterisations as well as paving the way for characterisation of novel bisimulations.
Coinduction Plain and Simple
Extensions of functional and logic programming with limited and decidable forms of the generalized coinduction proof principle are suggested, which makes the coinductions proof principle more intuitive and stresses its closeness with structural induction.
Bisimulation Techniques and Algorithms for Concurrent Constraint Programming
An algorithm is provided that allows us to verify strong bisimilarity for ccp, modifying the algorithm by using a pre-refinement and a partition function based on the irredundant bisimilarities.
A short introduction to the coinduction paradigm in terms of coinductions data, coinductive functions, and coinductive proofs is presented.
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
Higher-order languages have been widely studied in functional programming, following the $$\lambda$$-calculus, where variables may be instantiated with terms of the language.

## References

SHOWING 1-10 OF 262 REFERENCES
Deciding bisimilarity isP-complete
• Computer Science
Formal Aspects of Computing
• 2010
In finite labelled transition systems the problems of deciding strong bisimilarity, observation equivalence and observation congruence areP-complete under many—oneNC-reducibility, so the design of anNC algorithm to solve any of these problems will require an algorithmic breakthrough, which is exceedingly hard to achieve.
Environmental Bisimulations for Higher-Order Languages
• Computer Science
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
• 2007
Environmental bisimulations is presented, a form of bisimulation for higher-order languages, and its basic theory, which scales from the pure lambda-calculi to the richer calculi with simple congruence proofs, and does not require induction/indices on evaluation derivation/steps.
On the bisimulation proof method
• D. Sangiorgi
• Mathematics, Computer Science
Mathematical Structures in Computer Science
• 1998
It is shown that the class of sound functions contains non-trivial functions and the closure properties of the class with respect to various important function constructors allow to construct sophisticated sound functions – and hence sophisticated proof techniques for bisimilarity – from simpler ones.
Parallel Complexity in the Design and Analysis on Conurrent Systems
• Computer Science
PARLE
• 1991
It is shown that the first two problems can be efficiently parallelized, allowing logarithmic time Parallel RAM algorithms and even constant time unbounded fan-in circuits with threshold gates, however, lower bounds imply that they cannot be solved in constant time by a PRAM algorithm.
On Reduction of Asynchronous Systems
• Y. Kwong
• Computer Science
Theor. Comput. Sci.
• 1977
Coinductive Axiomatization of Recursive Type Equality and Subtyping
• Economics
Fundam. Informaticae
• 1997
It is shown how adding the fixpoint rule makes it possible to characterize inductively a set that is coinductively defined as the kernel (greatest fixed point) of an inference system.
Fixed Point Theorems and Semantics: A Folk Tale
• Mathematics
Inf. Process. Lett.
• 1982
The Linear Time - Branching Time Spectrum II
This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time
Algebraic laws for nondeterminism and concurrency
• Computer Science
JACM
• 1985
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.