Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle

Your Cart


You have 0 items in your cart.

Register Sign in Wishlist
Advanced Topics in Bisimulation and Coinduction

Advanced Topics in Bisimulation and Coinduction

$109.99 (C)

Part of Cambridge Tracts in Theoretical Computer Science

Davide Sangiorgi, Bart Jacobs, Jan Rutten, Luca Aceto, Anna Ingolfsdottir, Jiří Srba, Colin Stirling, Andrew Pitts, Damien Pous, Prakash Panangaden
View all contributors
  • Date Published: November 2011
  • availability: In stock
  • format: Hardback
  • isbn: 9781107004979

$109.99 (C)

Add to cart Add to wishlist

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 providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • 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)
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: November 2011
    • format: Hardback
    • isbn: 9781107004979
    • length: 340 pages
    • dimensions: 235 x 155 x 22 mm
    • weight: 0.61kg
    • contains: 20 b/w illus. 110 exercises
    • availability: In stock
  • 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.

  • Editors

    Davide Sangiorgi, University of Bologna, Italy
    Davide Sangiorgi is Full Professor in Computer Science at the University of Bologna, Italy.

    Jan Rutten, Stichting Centrum voor Wiskunde en Informatica (CWI), Amsterdam
    Jan Rutten is a senior researcher at Centrum Wiskunde and Informatica (CWI) in Amsterdam and Professor of Theoretical Computer Science at Radboud University, Nijmegen.


    Davide Sangiorgi, Bart Jacobs, Jan Rutten, Luca Aceto, Anna Ingolfsdottir, Jiří Srba, Colin Stirling, Andrew Pitts, Damien Pous, Prakash Panangaden

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.