Local State Space Analysis to Assist Partial Order Reduction
This work addresses the challenge of state space explosion for researchers and practitioners in formal verification, though it appears incremental as it builds on existing partial order reduction techniques.
The paper tackles the problem of inefficient partial order reduction for model checking concurrent systems by using compositional reachability analysis to generate over-approximate local state transition models, resulting in significantly higher state space reduction compared to SPIN in several cases.
This paper presents an approach to more efficient partial order reduction for model checking concurrent systems. This approach utilizes a compositional reachability analysis to generate over-approximate local state transition models for all processes in a concurrent system where an independence relation and other useful information can be extracted. The extracted independence relation, compared to what can be obtained by statically analyzing the system descriptions, is more precise and refined, therefore leads to more efficient partial order reduction. This approach is demonstrated on a set of concurrent system examples. Significantly higher reduction in state space has been observed in several cases compared to what can be obtained using SPIN.