Advanced Topics in Bisimulation and Coinduction
1st Edition
Published on 23. November 2011
978-1-139-15379-9 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 20 Line drawings, unspecified
File size
1,97 MB
ISBN-13
978-1-139-15379-9 (9781139153799)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Davide Sangiorgi | Jan Rutten
Advanced Topics in Bisimulation and Coinduction
Book
10/2011
Cambridge University Press
€150.60
Shipment within 15-20 days
Persons
Davide Sangiorgi is Full Professor in Computer Science at the University of Bologna, Italy. Jan Rutten is a senior researcher at Centrum Wiskunde and Informatica (CWI) in Amsterdam and Professor of Theoretical Computer Science at Radboud University, Nijmegen.
Content
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.
