scholarly journals A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2021 ◽  
Vol Volume 17, Issue 3 ◽  
Author(s):  
Thomas Neele ◽  
Antti Valmari ◽  
Tim A. C. Willemse
Keyword(s):  
Model Checking ◽  
Partial Order ◽  
Linear Time ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Space Reduction ◽  
Reduction Techniques ◽  
Counter Example ◽  
The Impact ◽  
Trace Equivalence

One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the past 32 years. One of the early stubborn sets works shows how the basic conditions for reduction can be augmented to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a stronger reduction condition and provide extensive new correctness proofs to ensure the issue is resolved. Furthermore, we analyse in which formalisms the problem may occur. The impact on practical implementations is limited, since they all compute a correct approximation of the theory. Comment: arXiv admin note: substantial text overlap with arXiv:1910.09829

scholarly journals The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2020 ◽  
pp. 482-501 ◽  
Author(s):  
Thomas Neele ◽  
Antti Valmari ◽  
Tim A. C. Willemse
Keyword(s):  
Model Checking ◽  
State Space ◽  
Partial Order ◽  
Linear Time ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Correctness Proof ◽  
Counter Example ◽  
The Impact ◽  
Trace Equivalence

AbstractIn model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in which formalisms this problem may occur. The impact on practical implementations is limited, since they all compute a correct approximation of the theory.

scholarly journals Symmetry and partial order reduction techniques in model checking Rebeca

2009 ◽  
Vol 47 (1) ◽  
pp. 33-66 ◽  
Author(s):  
Mohammad Mahdi Jaghoori ◽  
Marjan Sirjani ◽  
Mohammad Reza Mousavi ◽  
Ehsan Khamespanah ◽  
Ali Movaghar
Keyword(s):  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Reduction Techniques

Partial-order Reduction Techniques for Real-time Model Checking

1998 ◽  
Vol 10 (5-6) ◽  
pp. 469-482 ◽  
Author(s):  
Dennis Dams ◽  
Rob Gerth ◽  
Bart Knaack ◽  
Ruurd Kuiper
Keyword(s):  
Model Checking ◽  
Partial Order ◽  
Real Time ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Time Model ◽  
Reduction Techniques

scholarly journals Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems

2020 ◽  
pp. 307-324 ◽  
Author(s):  
Thomas Neele ◽  
Tim A. C. Willemse ◽  
Wieger Wesselink
Keyword(s):  
Fixed Point ◽  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
State Space Explosion ◽  
Boolean Equation ◽  
Parity Games ◽  
High Level ◽  
Established Technique

Abstract Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. We propose POR techniques that are sound for parity games, a well-established formalism for solving a variety of decision problems. As a consequence, we obtain the first POR method that is sound for model checking for the full modal $$\mu $$-calculus. Our technique is applied to, and implemented for the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments indicate that substantial reductions can be achieved.

Sign in / Sign up

Export Citation Format

Share Document