Enhancements of the bisimulation proof method

Damien Pous 1, 2 Davide Sangiorgi 3, 4
1 SARDES - System architecture for reflective distributed computing environments
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
3 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Type de document :
Chapitre d'ouvrage
Davide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012
Liste complète des métadonnées

https://hal.inria.fr/hal-00909391
Contributeur : Davide Sangiogi <>
Soumis le : mardi 26 novembre 2013 - 11:08:39
Dernière modification le : vendredi 20 avril 2018 - 15:44:27

Identifiants

  • HAL Id : hal-00909391, version 1

Collections

Citation

Damien Pous, Davide Sangiorgi. Enhancements of the bisimulation proof method. Davide Sangiorgi and Jan Rutten. Advanced Topics in Bisimulation and Coinduction, Cambridge University Press, 2012. 〈hal-00909391〉

Partager

Métriques

Consultations de la notice

501