Advanced Topics in Bisimulation and Coinduction
$88.00 ( ) USD
- Davide Sangiorgi, University of Bologna, Italy
- Jan Rutten, Stichting Centrum voor Wiskunde en Informatica (CWI), Amsterdam
Adobe eBook Reader
Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- Provides a thorough treatment of the subject
- Surveys the state of the art in this burgeoning field
- Exercises help the reader to master new material as it is presented
- A perfect complement to the first editor's Introduction to Bisimulation and Coinduction (Cambridge University Press, 2011)
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: November 2011
- format: Adobe eBook Reader
- isbn: 9781139153799
- contains: 20 b/w illus. 110 exercises
- availability: This item is not supplied by Cambridge University Press in your region. Please contact eBooks.com for availability.
Table of Contents
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 Jiří 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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×