All listings for this product
About this product
- DescriptionCoinduction 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.
- Author BiographyDavide 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.
- PublisherCambridge University Press
- Date of Publication13/10/2011
- SubjectComputing: General
- Series TitleCambridge Tracts in Theoretical Computer Science
- Series Part/Volume Number52
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note20 b/w illus. 110 exercises
- Weight610 g
- Width152 mm
- Height228 mm
- Spine22 mm
- Edited byDavide Sangiorgi,Jan Rutten
Best-selling in Textbooks
Save on Textbooks
- AU $72.90Trending at AU $74.51
- AU $35.82Trending at AU $40.79
- AU $19.57Trending at AU $23.98
- AU $17.16Trending at AU $18.34
- AU $57.88Trending at AU $63.53
- AU $19.95Trending at AU $20.35
- AU $16.96Trending at AU $23.43
This item doesn't belong on this page.
Thanks, we'll look into this.