Property-dependent reductions adequate with divergence-sensitive branching bisimilarity

• We propose a method for reducing an Lts model w.r.t. a μ-calculus formula.
• The maximal set of actions is hidden without changing the formula meaning.
• We define a new μ-calculus fragment adequate with ds-branching bisimilarity.
• We apply maximal hiding and ds-bb reduction before checking formulas of this fragment.
• This yields important performance gains (speed and memory) for model checking.

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 μ  -calculus (LμLμ). First, we determine, for any LμLμ formula, the maximal set of actions that can be hidden in the Lts without changing the interpretation of the formula. Then, we define Lμdsbr, a fragment of LμLμ 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 τ  -confluence during the verification of any Lμdsbr 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.