A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Model checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
Relaxed Visibility Enhances Partial Order Reduction
Formal Methods in System Design
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Formal Methods in System Design
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Efficient verification of halting properties for MPI programs with wildcard receives
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the "ample set" POR framework for the verification of an LTL驴X formula 驴, one associates to each state s a subset T s of the set of all transitions enabled at s. The approach requires that whenever T s is a proper subset, the transitions in T s must be invisible, i.e., their execution can never change the truth values of the atomic propositions occurring in 驴. In this paper, we show that the invisibility restriction can be relaxed: for propositions that only occur negatively in 驴, it suffices that the transitions in T s merely never change the truth value from true to false, and for those that occur only positively, from false to true. This opens up opportunities for reduction, in many commonly occurring scenarios, that would not be allowed by the stricter invisibility criterion.