Stubborn Transaction Reduction

Laarman, Alfons

doi:10.1007/978-3-319-77935-5_20

Cited by 8 publications

(9 citation statements)

References 64 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%

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

show abstract

“…Hence chaining reduction rules still produces a reduction. As we will discuss in section 3.1 structural reductions of a specification such as Lipton's transaction reduction [14,13] or Petri net agglomerations [1,22] induce a reduction at the language level.…”

Section: When Is Visiting Shorter Runs Enough ? Definition 7 [Reducti...mentioning

confidence: 99%

“…Note that r does contain all these longer runs so that in a stutter insensitive context, examining 𝑟 is enough to conclude for any of these runs. This is why usage of structural reductions is compatible with verification of a logic such as 𝐿𝑇 𝐿 \𝑋 and has been proposed for that express purpose in the literature [9,13].…”

Section: Agglomeration Of Events Produces Shorter Runsmentioning

confidence: 99%

“…Structural reductions take their roots in the work of Lipton [14] and Berthelot [1]. Nowadays, these reductions are still considered as an attractive way to alleviate the state explosion problem [13,2]. Structural reductions strive to fuse structurally "adjacent" events into a single atomic step, leading to less interleaving of independent events and less observable behaviors in the resulting system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

LTL under reductions with weaker conditions than stutter-invariance

Paviot-Adet¹,

Poitrenaud²,

Renault³

et al. 2021

Preprint

View full text Add to dashboard Cite

Verification of properties expressed as 𝜔-regular languages such as LTL can benefit hugely from stutter-insensitivity, using a diverse set of reduction strategies. However properties that are not stutter-insensitive, for instance due to the use of the neXt operator of LTL or to some form of counting in the logic, are not covered by these techniques in general. We propose in this paper to study a weaker property than stutter-insensitivity. In a stutter insensitive language both adding and removing stutter to a word does not change its acceptance, any stuttering can be abstracted away; by decomposing this equivalence relation into two implications we obtain weaker conditions. We define a shortening insensitive language where any word that stutters less than a word in the language must also belong to the language. A lengthening insensitive language has the dual property. A semi-decision procedure is then introduced to reliably prove shortening insensitive properties or deny lengthening insensitive properties while working with a reduction of a system. A reduction has the property that it can only shorten runs. Lipton's transaction reductions or Petri net agglomerations are examples of eligible structural reduction strategies. An implementation and experimental evidence is provided showing most nonrandom properties sensitive to stutter are actually shortening or lengthening insensitive. Performance of experiments on a large (random) benchmark from the model-checking competition indicate that despite being a semi-decision procedure, the approach can still improve state of the art verification tools.

show abstract

“…Such sequences are a concatenation not of single occurrences of actions, but rather of steps, i.e., sets of one or more actions that occur (or are observed as occurring) simultaneously. Some recent examples of the application of step traces can be found in computational biology [18], digital graphics [17], and model checking [10].…”

Section: R Janicki J Kleijn L Mikulskimentioning

confidence: 99%

A Precise Characterisation of Step Traces and Their Concurrent Histories

Janicki¹,

Kleijn²,

Mikulski³

2018

SACS

View full text Add to dashboard Cite

Step traces are an extension of Mazurkiewicz traces where each equivalence class (trace) consists of sequences of steps instead of sequences of atomic actions. Relations between the actions of the system are defined statically, as parameters of a concurrent step alphabet. By allowing only some of the possible relationships between actions, subclasses of step alphabets can be derived in a natural way. Properties of these classes can then be investigated in terms of invariant structures, i.e., the relational structures that represent the causal invariants that underlie the corresponding step traces. In this paper, we refine an earlier classification of subclasses of step alphabets and add eight new subclasses to this hierarchy. We divide these eight classes into three families on basis of the absence of a specific behavioural relation and then characterise the corresponding invariant structures.

show abstract

Stubborn Transaction Reduction

Cited by 8 publications

References 64 publications

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

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

LTL under reductions with weaker conditions than stutter-invariance

A Precise Characterisation of Step Traces and Their Concurrent Histories

Contact Info

Product

Resources

About