Skip to Main content Skip to Navigation
Journal articles

Property-Dependent Reductions Adequate with Divergence-Sensitive Branching Bisimilarity

Radu Mateescu 1, * Anton Wijs 2 
* Corresponding author
1 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download
Contributor : Radu Mateescu Connect in order to contact the contributor
Submitted on : Tuesday, July 1, 2014 - 2:32:49 PM
Last modification on : Wednesday, February 2, 2022 - 3:56:29 PM
Long-term archiving on: : Wednesday, October 1, 2014 - 12:25:09 PM


Files produced by the author(s)



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



Record views


Files downloads