Model-checking process equivalences

Abstract : Process equivalences are formal methods that relate programs and systems which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal process equivalences, ranging from bisimulation to trace equivalence, categorised in the linear-time branching-time spectrum. We present a logical framework based on an expressive modal fixpoint logic which is capable of defining many process equivalence relations: for each such equivalence there is a fixed formula which is satisfied by a pair of processes if and only if they are equivalent with respect to this relation. We explain how to do model checking for this logic in EXPTIME. This allows model checking technology to be used for process equivalence checking. We introduce two fragments of the logic for which it is possible to do model-checking in PTIME and PSPACE respectively, and show that the formulas that define the process equivalences we consider are in one of these fragments. This yields a generic proof technique for establishing the complexities of these process equivalences. Finally, we show how partial evaluation can be used to obtain decision procedures for process equivalences from the generic model checking scheme.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2014, 560, pp.326 - 347. 〈10.1016/j.tcs.2014.08.020〉
Liste complète des métadonnées
Contributeur : Etienne Lozes <>
Soumis le : mardi 13 novembre 2018 - 12:34:12
Dernière modification le : mercredi 21 novembre 2018 - 01:17:16
Document(s) archivé(s) le : jeudi 14 février 2019 - 12:16:54

Fichiers produits par l'(les) auteur(s)




Martin Lange, Etienne Lozes, Manuel Vargas Guzmán. Model-checking process equivalences. Theoretical Computer Science, Elsevier, 2014, 560, pp.326 - 347. 〈10.1016/j.tcs.2014.08.020〉. 〈hal-01905142〉



Consultations de la notice


Téléchargements de fichiers