Advanced topics in bisimulation and coinduction
- edited by Davide Sangiorgi, Jan Rutten.
- Cambridge, UK ; New York : Cambridge University Press, 2012.
- Physical description
- xiii, 326 p. : ill. ; 24 cm.
- Cambridge tracts in theoretical computer science ; 52.
Math & Statistics Library
|QA76.9 .A96 S365 2012||Unknown|
- Includes bibliographical references.
- Preface-- List of contributors-- 1. Origins of bisimulation and coinduction Davide Sangiorgi-- 2. An introduction to (co)algebra and (co)induction Bart Jacobs and Jan Rutten-- 3. The algorithmics of bisimilarity Luca Aceto, Anna Ingolfsdottir and Jiri Srba-- 4. Bisimulation and logic Colin Stirling-- 5. Howe's method for higher-order languages Andrew Pitts-- 6. Enhancements of the bisimulation proof method Damien Pous and Davide Sangiorgi-- 7. Probabilistic bisimulation Prakash Panangaden.
- (source: Nielsen Book Data)
- Publisher's Summary
- 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.
(source: Nielsen Book Data)
- Supplemental links
Contributor biographical information
Table of contents only
- Publication date
- Cambridge tracts in theoretical computer science ; 52
Browse related items
Start at call number: