Dynamic Slicing Techniques for Petri Nets

Llorens, Marisa; Oliver, Javier; Silva, Josep; Tamarit, Salvador; Vidal, Germán

doi:10.1016/j.entcs.2008.12.037

Cited by 25 publications

(23 citation statements)

References 10 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In such situations by preserving the properties of the Petri Net model reductions to a simpler model is possible. One such scalable technique is Petri Nets slicing used for Reachability analysis [9]. Let us now redefine the equation (1) of section 4 as follows:…”

Section: Slicing-based Analysis For Vdwmentioning

confidence: 99%

Virtual Data Warehouse Modeling Using Petri Nets for Distributed Decision Making

Chaki¹,

Sarkar²

2010

JCIT

View full text Add to dashboard Cite

A decision maker wants the pool of data at the finger tip while making the decision. In state of the art applications, decision making is no more a centralized process. Distribution of resources is a challenge before the system designers. Besides, for timely analyzing the distributed data, a robust query processing system along with the physical storage with schema definitions are also necessary. In the present state of business process skills, technologies, processes, applications and practices all are falling under the categories of competitive intelligence. In short BI aims to support better business decision-making. In this paper we propose an analytical model using Petri Net for distributed data management in a data warehouse to ease the OLAP (Online Analytical Processing) operations. Some of the properties of the model like safeness, boundedness, liveness and conservativeness are also verified..

show abstract

Section: Slicing-based Analysis For Vdwmentioning

confidence: 99%

Virtual Data Warehouse Modeling Using Petri Nets for Distributed Decision Making

Chaki¹,

Sarkar²

2010

JCIT

View full text Add to dashboard Cite

show abstract

“…al. developed an algorithm to generate a reduced Petri net [7]. They showed how to use Petri net slicing for reachability analysis and debugging presenting a forward and backward algorithm for Petri nets with maximal arc weight 1, as shown in Fig.…”

Section: Petri Net Slicingmentioning

confidence: 99%

“…Llorens' forward and backward slice according to [7] Obviously the forward slice can also be used as a preprocessing step to model checking and removes dead transitions only. Their slice was considered correct iff for every firing sequence σ of the original net Σ it holds that the restriction σ ′ = proj T ′ (σ) can be performed on Σ ′ and for every place p ′ of the slice it holds that firing σ ′ generates at least as many tokens as σ.…”

Section: Petri Net Slicingmentioning

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

“…The reduced model contains only those parts that may affect the property the model is analyzed for. Slicing Petri nets is gaining much attention in the recent years [3,9,14,[16][17][18]. Mark Weiser introduced the slicing term in [20], and presented slicing as a formalization of an abstraction technique that experienced programmers (unconsciously) use during debugging to minimize the program.…”

Section: Petri Net Reductionsmentioning

confidence: 99%

Optimizing Verification of Structurally Evolving Algebraic Petri Nets

Khan

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. System models are subject to evolve during the development life cycle, along which an initial version goes through a series of evolutions, generally aimed at progressively reaching all the requested qualities (completeness, correctness etc.). Among the existing development methodologies the iterative and incremental one has been proved to be efficient for system development but lacks of support for an adequate verification process. When considering Algebraic Petri nets (APNs) for modeling and model checking for verification, all the proofs must be redone after each iteration which is impractical both in terms of time and space. In this work, we introduce an Algebraic Petri net slicing technique that optimizes the model checking of static or structurally evolving APN models. Furthermore, our approach is proposing a classification of evolutions dedicated to the improvement of model checking.

show abstract

Dynamic Slicing Techniques for Petri Nets

Cited by 25 publications

References 10 publications

Virtual Data Warehouse Modeling Using Petri Nets for Distributed Decision Making

Virtual Data Warehouse Modeling Using Petri Nets for Distributed Decision Making

Safety Slicing Petri Nets

Optimizing Verification of Structurally Evolving Algebraic Petri Nets

Contact Info

Product

Resources

About