Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. Most approaches in literature focus on Kripke structures or labelled transition systems and preserve a form of stutter/weak trace equivalence or weak bisimulation. Therefore, they are at best applicable when checking weak modal mucalculus. We propose to apply POR on parity games, which can encode the combination of a transition system and a temporal property. Our technique allows one to apply POR in the setting of mu-calculus model checking. We show with an example that the reduction achieved on parity games can be significantly larger. Furthermore, we identify and repair an issue where stubborn sets do not preserve stutter equivalence.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||28|
|Publication status||Published - 1 Sep 2019|
|Name||Computer science reports|
Neele, T., Willemse, T., & Wesselink, W. (2019). Partial-order reduction for parity games with an application on parameterised Boolean Equation Systems (Technical Report). (Computer science reports; Vol. 19/02). Eindhoven: Technische Universiteit Eindhoven.