Javascript must be enabled to continue!
Introduction to Bisimulation and Coinduction
View through CrossRef
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.
Title: Introduction to Bisimulation and Coinduction
Description:
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them.
Coinduction is the dual of induction and as such it brings in quite different tools.
Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics.
The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc.
This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction.
Each chapter contains exercises and selected solutions, enabling students to connect theory with practice.
A special emphasis is placed on bisimulation as a behavioural equivalence for processes.
Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.
Related Results
Bisimulation for quantum processes
Bisimulation for quantum processes
Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdrop...
The Glory of the Past and Geometrical Concurrency
The Glory of the Past and Geometrical Concurrency
This paper contributes to the general understanding of the "geometrical model of concurrency" that was named higher dimensional automata (HDAs) by Pratt and van Glabbeek. In partic...
An algebra of quantum processes
An algebra of quantum processes
We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but ...
Generic Trace Semantics via Coinduction
Generic Trace Semantics via Coinduction
Trace semantics has been defined for various kinds of state-based systems,
notably with different forms of branching such as non-determinism vs.
probability. In this paper we claim...
Coinductive characterizations of applicative structures
Coinductive characterizations of applicative structures
We discuss new ways of characterizing, as maximal fixed points of monotone
operators, observational congruences on λ-terms and, more generally, equivalences on
applicative struct...
Timed Bisimulation and Open Maps
Timed Bisimulation and Open Maps
Formal models for real-time systems have been studied intensively over the past decade. Much of the theory of untimed systems has been lifted to real-time settings. One example is ...
Representation Discovery for MDPs Using Bisimulation Metrics
Representation Discovery for MDPs Using Bisimulation Metrics
We provide a novel, flexible, iterative refinement algorithm to automatically construct an approximate statespace representation for Markov Decision Processes (MDPs). Our approach ...
Unique solution techniques for processes and functions
Unique solution techniques for processes and functions
Techniques d'unicité des solutions pour processus concurrents et fonctions
La méthode de preuve par bisimulation est un pilier de la théorie de la concurrence et de...

