Property-dependent reductions for the modal mu-calculus

R. Mateescu, A.J. Wijs

Research output: Book/ReportReportAcademic

7 Citations (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.
Original languageEnglish
Place of PublicationGrenoble
Number of pages33
Publication statusPublished - 2011

Publication series

NameRapport de Recherche


Dive into the research topics of 'Property-dependent reductions for the modal mu-calculus'. Together they form a unique fingerprint.

Cite this