Bisimulation and Coinduction Enhancements: A Historical Perspective
Open Access
- 8 November 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 31 (6) , 733-749
Abstract
Bisimulation is an instance of coinduction. Both bisimulation and coinduction are today widely used, in many areas of Computer Science, as well as outside Computer Science. Over, roughly, the last 25 years, enhancements of the principles and methods related to bisimulation and coinduction (i.e., techniques to make proofs shorter and simpler) have become a research topic on its own. In the paper the origins and the developments of the topic are reviewed.Keywords
This publication has 67 references indexed in Scilit:
- Relating coalgebraic notions of bisimulationLogical Methods in Computer Science, 2011
- On the origins of bisimulation and coinductionACM Transactions on Programming Languages and Systems, 2009
- New up-to techniques for weak bisimulationTheoretical Computer Science, 2007
- Small bisimulations for reasoning about higher-order imperative programsACM SIGPLAN Notices, 2006
- Behavioral theory for mobile ambientsJournal of the ACM, 2005
- A bisimulation for type abstraction and recursionACM SIGPLAN Notices, 2005
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- A polynomial algorithm for deciding bisimilarity of normed context-free processesTheoretical Computer Science, 1996
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955