English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

One of the most popular state-space reduction techniques for model checkingis partial-order reduction (POR). Of the many different POR implementations,stubborn sets are a very versatile variant and have thus seen many differentapplications over the past 32 years. One of the early stubborn sets works showshow the basic conditions for reduction can be augmented to preservestutter-trace equivalence, making stubborn sets suitable for model checking oflinear-time properties. In this paper, we identify a flaw in the reasoning andshow with a counter-example that stutter-trace equivalence is not necessarilypreserved. We propose a stronger reduction condition and provide extensive newcorrectness proofs to ensure the issue is resolved. Furthermore, we analyse inwhich formalisms the problem may occur. The impact on practical implementationsis limited, since they all compute a correct approximation of the theory.

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