Advanced topics in bisimulation and coinduction / Jan Rutten.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
![](/opac-tmpl/bootstrap/itemtypeimg/npl/Rare-Book.gif)
Current library | Home library | Call number | Materials specified | Status | Date due | Barcode |
---|---|---|---|---|---|---|
IMSc Library | IMSc Library | 510.6 SAN (Browse shelf (Opens below)) | Available | 75277 |
Browsing IMSc Library shelves Close shelf browser (Hides shelf browser)
No cover image available |
![]() |
![]() |
![]() |
No cover image available | No cover image available | No cover image available | ||
510.6 SAC Higher recursion theory | 510.6 SAC Mathematical logic in the 20th century | 510.6 SAC Saturated model theory | 510.6 SAN Advanced topics in bisimulation and coinduction / | 510.6 SCH Beweistheorie | 510.6 SCH Mathematische gesetze de logic | 510.6 SCH Vorlesungen uber die algebrae der logik |
Includes bibliographical references and index.
Machine generated contents note: 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 Jiři; 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.
"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"--
There are no comments on this title.