Property-Dependent Reductions Adequate with Divergence-Sensitive Branching Bisimilarity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2014

Property-Dependent Reductions Adequate with Divergence-Sensitive Branching Bisimilarity

Abstract

When analyzing the behavior of finite-state concurrent systems by model checking, one way of fighting state space explosion is to reduce the model as much as possible whilst preserving the properties under verification. We consider the framework of action-based systems, whose behaviors can be represented by labeled transition systems (LTSs), and whose temporal properties of interest can be formulated in modal mu-calculus (Lmu). First, we determine, for any Lmu formula, the maximal set of actions that can be hidden in the LTS without changing the interpretation of the formula. Then, we define dsbrLmu, a fragment of Lmu which is adequate w.r.t. divergence-sensitive branching bisimilarity. This enables us to apply the maximal hiding and to reduce the LTS on-the-fly using divergence-sensitive tau-confluence during the verification of any dsbrLmu formula. The experiments that we performed on various examples of communication protocols and distributed systems show that this reduction approach can significantly improve the performance of on-the-fly verification.
Fichier principal
Vignette du fichier
Mateescu-Wijs-14.pdf (398.06 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01016922 , version 1 (01-07-2014)

Identifiers

Cite

Radu Mateescu, Anton Wijs. Property-Dependent Reductions Adequate with Divergence-Sensitive Branching Bisimilarity. Science of Computer Programming, 2014, ⟨10.1016/j.scico.2014.04.004⟩. ⟨hal-01016922⟩
311 View
221 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More