Equivalence Checking 40 Years After: A Review of Bisimulation Tools - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2022

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Abstract

Equivalence checking is a formal verification approach that consists in proving that two programs or models are related modulo some equivalence relation, or that one is included in the other modulo some preorder relation. In the case of concurrent systems, which are often represented using labelled transition systems, the relations used for equivalence checking are bisimulations and their simulation preorders. In the case of probabilistic or stochastic systems, which are usually represented using Markov chains, the relations used for equivalence checking are lumpability, probabilistic and stochastic equivalences, and their associated preorders. The present article provides a synthetic overview of 40 years of research in the design of algorithms and software tools for equivalence checking.
Fichier principal
Vignette du fichier
Garavel-Lang-22.pdf (480.6 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03920338 , version 1 (03-01-2023)

Identifiers

Cite

Hubert Garavel, Frédéric Lang. Equivalence Checking 40 Years After: A Review of Bisimulation Tools. A Journey from Process Algebra via Timed Automata to Model Learning, 13560, Springer Nature Switzerland; Springer Nature Switzerland, pp.213-265, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-15629-8_13⟩. ⟨hal-03920338⟩
71 View
296 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More