Optimising the ProB Model Checker for B Using Partial Order Reduction

Dobrikov, Ivaylo; Leuschel, Michaël

doi:10.1007/978-3-319-10431-7_16

Cited by 7 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such, they do not suffer from the problems discussed here, which applies only to state labels. Other recent work [DL16] relies on ample sets, and is thus not affected, or only considers safety properties [Laa18].…”

Section: Related Workmentioning

confidence: 99%

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

Neele¹,

Valmari²,

Willemse³

2021

Logical Methods in Computer Science

View full text Add to dashboard Cite

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

show abstract

Section: Related Workmentioning

confidence: 99%