Property-dependent reductions for the modal mu-calculus

R. Mateescu, A.J. Wijs

Onderzoeksoutput: Boek/rapportRapportAcademic

7 Citaten (Scopus)


When analyzing the behavior of finite-state concurrent systems by model checking, one way of fighting state 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 compatible with divergence-sensitive branching bisimulation. 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.
Originele taal-2Engels
Plaats van productieGrenoble
Aantal pagina's33
StatusGepubliceerd - 2011

Publicatie series

NaamRapport de Recherche

Vingerafdruk Duik in de onderzoeksthema's van 'Property-dependent reductions for the modal mu-calculus'. Samen vormen ze een unieke vingerafdruk.

Citeer dit