Pre- and Post-agglomerations for LTL Model Checking

Poitrenaud, Denis; Pradat-Peyre, Jean-François

doi:10.1007/3-540-44988-4_22

Cited by 12 publications

(11 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pre-and postagglomeration [2] are two very powerful structural reduction rules and probably also the most established. In [9] it was shown that they preserve LTL -X properties.…”

Section: Petri Net Reductionsmentioning

confidence: 99%

Safety Slicing Petri Nets

Rakow

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We define a safety slice as a subnet of a marked Petri net Σ that approximates Σ's temporal behavior with respect to a set of interesting places Crit. This safety slice can be used to verify and falsify stutter-invariant linear-time safety properties when Crit is the set of places referred to by the safety property. By construction it is guaranteed that the safety slice's state space is at most as big as that of the original net. Results on a benchmark set demonstrate effective reductions on several net instances. Therefore safety slicing as a net preprocessing step may achieve an acceleration for model checking stutter-invariant linear-time safety properties.Slicing is a technique to syntactically reduce a model in such a way that at best the reduced model contains only those parts that may influence the property the model is analyzed for. It originated as a method for program debugging [16] but has found applications in many other domains. We here introduce a slicing approach tailored to Petri nets as a means to alleviate the state space explosion problem for model checking Petri nets. We present a safety slicing algorithm that determines what parts of a marked Petri net Σ can be sliced away (i.e. discarded) so that the remaining net is equivalent to the original w.r.t. a stutter-invariant linear-time safety property ψ. The remaining net is called safety slice Σ ′ and is built for a so called slicing criterion Crit.We will formally show that safety slices allow for verification and falsification of stutter-invariant linear-time safety properties. Hence when one wants to examine whether a marked Petri net Σ satisfies a stutter-invariant linear-time safety property ψ, the safety slice may be examined instead. The safety slice may have a substantially smaller state space, yielding an acceleration in model checking. As the safety slicing algorithm is linear in the size of the net Σ (not its state space!), even when slicing does not accelerate model checking, the overhead will usually be insignificant.In [11] we presented a more conservative slicing algorithm. There we introduced CTL * -X slices, which preserve CTL * -X properties assuming a weak fairness assumption on the original net Σ. By definition a safety slice for Crit is a subnet of the CTL * -X slice for Crit, so that safety slicing offers the potential to generate smaller slices than the CTL * -X preserving algorithm but sacrifices the preservation of liveness properties.

show abstract

“…Pre-and postagglomeration [2] are two very powerful structural reduction rules and probably also the most established. In [9] it was shown that they preserve LTL -X properties.…”

Section: Petri Net Reductionsmentioning

confidence: 99%

Safety Slicing Petri Nets

Rakow

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The link between transition agglomerations (the most effective structural reductions proposed by Berthelot) and general properties, expressed in LTL formalism, is done in [20].…”

Section: Related Work On Syntactical Model Reductionsmentioning

confidence: 99%

Adapting Petri Nets Reductions to Promela Specifications

Pajault

Pradat-Peyre

Rousseau

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

View full text Add to dashboard Cite

Abstract. The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified transitions. Furthermore, they can be combined with other kinds of reductions such as partial-order techniques to improve the efficiency of state space reduction. We present in this paper an adaptation of these reductions for Promela specifications and propose simple rules to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical examples the efficiency of this approach and propose some perspectives of this work in the scope of software model checking.

show abstract

“…The gains of the symbolic approach are tremendous, as it reduces the variable domain size to the lesser token cardinality problem. Furthermore it leaves room to apply structural reductions to fight the interleaving problem [11,4].…”

Section: Introductionmentioning

confidence: 99%

Automatic Symmetry Detection in Well-Formed Nets

Thierry-Mieg

Dutheillet

Mounier

2003

Applications and Theory of Petri Nets 2003

View full text Add to dashboard Cite

Abstract. Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Formed Nets (WN) are a class of high-level Petri nets, developed specifically to allow automatic construction of a symbolic reachability graph (SRG), that represents equivalence classes of states. This relies on the definition by the modeler of the symmetries of the model, through the definition of "static sub-classes". Since a model is self-contained, these (a)symmetries are actually defined by the model itself. This paper presents an algorithm capable of automatically extracting the symmetries inherent to a model, thus allowing its symbolic study by translating it to WN. The computation starts from the assumption that the model is entirely symmetric, then examines each component of a net to deduce the symmetry break it induces. This translation is transparent to the end-user, and is implemented as a service for the AMI-Net package. It is particularly adapted to models containing large value domains, yielding combinatorial gain in the size of the reachability graph.

show abstract

Pre- and Post-agglomerations for LTL Model Checking

Cited by 12 publications

References 4 publications

Safety Slicing Petri Nets

Safety Slicing Petri Nets

Adapting Petri Nets Reductions to Promela Specifications

Automatic Symmetry Detection in Well-Formed Nets

Contact Info

Product

Resources

About