Advanced topics in bisimulation and coinduction /
Advanced Topics in Bisimulation & Coinduction
edited by Davide Sangiorgi, Jan Rutten.
- 1 online resource (xiii, 326 pages) : digital, PDF file(s).
- Cambridge tracts in theoretical computer science ; 52 .
- Cambridge tracts in theoretical computer science ; 52. .
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Origins of bisimulation and coinduction / An introduction to (co)algebra and (co)induction / The algorithmics of bisimilarity / Bisimulation and logic / Howe's method for higher-order languages / Enhancements of the bisimulation proof method / Davide Sangiorgi -- Bart Jacobs and Jan Rutten -- Luca Aceto, Anna Ingolfsdottir and Jiři; Srba -- Colin Stirling -- Andrew Pitts -- Damien Pous and Davide Sangiorgi -- Prakash Panangaden. 1. 2. 3. 4. 5. 6. 7. Probabilistic bisimulation /
Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.