Abstract
State-space explosion is a central problem in the automatic verification (model-checking) 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 execution of concurrent (independent) atomic 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 reduced state space preserves the correctness of the checked property, the partial order reductions put constraints 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.
Original language | English |
---|---|
Pages (from-to) | 275-289 |
Number of pages | 15 |
Journal | Formal Methods in System Design |
Volume | 19 |
Issue number | 3 |
DOIs | |
State | Published - Nov 2001 |
Externally published | Yes |
Bibliographical note
Funding Information:The authors would like to thank an insightful discussion of this subject with Amir Pnueli and Pierre Wolper. The work of the third author was partially funded by the Academy of Finland.
Funding
The authors would like to thank an insightful discussion of this subject with Amir Pnueli and Pierre Wolper. The work of the third author was partially funded by the Academy of Finland.
Funders | Funder number |
---|---|
Academy of Finland |
Keywords
- Automatic verification
- Model checking
- Partial order reduction
- State space explosion