Research Catalog

Advanced topics in bisimulation and coinduction /

Title
Advanced topics in bisimulation and coinduction / edited by Davide Sangiorgi, Jan Rutten.
Publication
Cambridge ; New York : Cambridge University Press, 2012.
Supplementary Content
  • Cover image
  • Contributor biographical information
  • Publisher description

Items in the Library & Off-site

Filter by

2 Items

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
Not available - Please for assistance.
TextUse in library QA76.9.A96 S365 2012Off-site
Not available - Please for assistance.
TextUse in library Off-site

Details

Additional Authors
  • Rutten, J. J. M. M.
  • Sangiorgi, Davide.
Description
xiii, 326 p. : ill.; 24 cm.
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"--
Series Statement
Cambridge tracts in theoretical computer science ; 52
Uniform Title
Cambridge tracts in theoretical computer science ; 52.
Subjects
Bibliography (note)
  • Includes bibliographical references and index.
Contents
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.
ISBN
  • 9781107004979
  • 1107004977
LCCN
2011027493
Owning Institutions
Princeton University Library