Advanced Topics in Bisimulation and Coinduction

Inbunden, Engelska, 2011

Del 52 i serien Cambridge Tracts in Theoretical Computer Science

1 682 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2011-10-13
Mått:155 x 235 x 22 mm
Vikt:610 g
Format:Inbunden
Språk:Engelska
Serie:Cambridge Tracts in Theoretical Computer Science
Antal sidor:340
Förlag:Cambridge University Press
ISBN:9781107004979

Utforska kategorier

Informationsteknik: allmänt inom Data och IT
Programspråk inom Data och IT
Systemvetenskap och AI inom Data och IT

Mer om författaren

Davide 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.

Innehållsförteckning

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ří 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.