Relaxed Visibility Enhances Partial Order Reduction

State-space explosion is a central problem in the automatic verification (model-checkling) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of executin of concurrent (independent) atiomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, in order to guarantee that the recduced state space preserves the correctness of the checked property, the partical order reductions put constratints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, and thus achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.