• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Advanced Topics in Bisimulation and Coinduction

Advanced Topics in Bisimulation and Coinduction

Hardcover

Series: Cambridge Tracts in Theoretical Computer Science, Book 52

General ComputersNetworking

ISBN10: 1107004977
ISBN13: 9781107004979
Publisher: Cambridge University Press
Published: Oct 13 2011
Pages: 340
Weight: 1.32
Height: 0.90 Width: 6.00 Depth: 9.10
Language: English
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.

Also in

Networking