Book contents
- Frontmatter
- Contents
- List of contributors
- Preface
- 1 Origins of bisimulation and coinduction
- 2 An introduction to (co)algebra and (co)induction
- 3 The algorithmics of bisimilarity
- 4 Bisimulation and logic
- 5 Howe's method for higher-order languages
- 6 Enhancements of the bisimulation proof method
- 7 Probabilistic bisimulation
- References
4 - Bisimulation and logic
Published online by Cambridge University Press: 05 November 2011
Book contents
- Frontmatter
- Contents
- List of contributors
- Preface
- 1 Origins of bisimulation and coinduction
- 2 An introduction to (co)algebra and (co)induction
- 3 The algorithmics of bisimilarity
- 4 Bisimulation and logic
- 5 Howe's method for higher-order languages
- 6 Enhancements of the bisimulation proof method
- 7 Probabilistic bisimulation
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Advanced Topics in Bisimulation and Coinduction , pp. 173 - 196Publisher: Cambridge University PressPrint publication year: 2011
References
[vB84] . Correspondence theory. In Handbook of Philosophical Logic, Vol. II, and , editors, pages 167–248, Reidel, 1984.
[vB96] . Exploring Logical Dynamics. CSLI Publications, 1996.
[vB98] . Program constructions that are safe for bisimulation, Studia Logica, 60:311–330, 1998.Google Scholar
[BRV01] , and . Modal Logic, Cambridge University Press, 2001.
[BS07] and , Modal mu-calculi. In Handbook of Modal Logic, , and , editior pages 721–756, Elsevier, 2007.
[Ch80] , Modal Logic: An Introduction. Cambridge University Press, 1980.
[GTW02] , and (editors), Automata, Logics, and Infinite Games, Lecture Notes in Computer Science, 2500, 2002.
[HM80] and , On observing nondeterminism and concurrency, Lecture Notes in Computer Science, 85:295–309, 1980.Google Scholar
[HM85] and . Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32:137–162, 1985.Google Scholar
[JW96] and , On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. Lecture Notes in Computer Science, 1119:263–277, 1996.Google Scholar
[Ko83] , Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983.Google Scholar
[KJ06] and , Equivalence-checking on infinite-state systems: techniques and results. Theory and Practice of Logic Programming, 6(3):227–264, 2006.Google Scholar
[KVW00] , and , An automata-theoretic approach to branching-time model checking. Journal of Association of Computer Machinery, 42(2):312–360, 2000.Google Scholar
[Pa81] . Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 154:561–572 1981.Google Scholar
[San12] . An Introduction to Bisimulation and Coinduction. Cambridge University Press, 2012.
- 2
- Cited by