Thomas Neele ; Antti Valmari ; Tim A. C. Willemse - A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

lmcs:7038 - Logical Methods in Computer Science, July 21, 2021, Volume 17, Issue 3 - https://doi.org/10.46298/lmcs-17(3:8)2021
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

Authors: Thomas Neele ; Antti Valmari ; Tim A. C. Willemse

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.


Volume: Volume 17, Issue 3
Published on: July 21, 2021
Submitted on: January 4, 2021
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 42 times.
This article's PDF has been downloaded 14 times.