Performance of Static Slicing Algorithms for Petri Nets

Davidrajuh, Reggie; Roci, Albana

doi:10.5013/ijssst.a.20.s1.15

Cited by 5 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, two slicing algorithms were used to reduce a Petri net model that maintained the safety property in [26] and the CTL * −x property in [27]. Moreover, a place-invariant-based (PI-based) algorithm to slice Petri nets and preserve the placeinvariant property was proposed in [28]. Furthermore, [29] proposed dynamic slicing algorithms for Petri nets by computing the backward and forward slices while considering an initial marking, and these algorithms were further improved using a structural dependency graph (SDG) in [30].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Slicing of Time Petri Net Based on MTL Property

Chariyathitipong

Vatanawood

2022

IEEE Access

View full text Add to dashboard Cite

The time Petri net (TPN) is a powerful tool for modeling, simulating, and verifying real-time systems. Unfortunately, the state spaces of the time Petri net grow exponentially due to the complexity of real-time systems. The enormous size of the state spaces could also cause state explosion problems in model checking. This paper proposes an alternative dynamic slicing algorithm written as a metric temporal logic (MTL) formula to reduce the size of the time Petri net model by considering specific criteria. Our algorithm proposes an alternative dependency graph representing the global firing time interval of the transition to remove the transitions that are never fired and do not affect the state space. The dynamic slicing algorithm involves the initial marking and the properties of the target metric temporal logic formula. Unlike the unsliced time Petri net, the result preserves all necessary execution paths for the model checking of a particular metric temporal logic formula. Therefore, model checking can generate sufficient state space to conduct verification equivalent to the unsliced time Petri net but may take less time, including if the unsliced time Petri net causes state space explosion.

show abstract

Section: Introductionmentioning

confidence: 99%

Dynamic Slicing of Time Petri Net Based on MTL Property

Chariyathitipong

Vatanawood

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Another approach closely related is activity-oriented Petri Nets, a methodology to minimize the size of a Petri net. It has been used to reduce the size of Petri net models involving many resources [13,14,15] and tested for its applicability for model checking in [10] together with other slicing algorithms ( [16,8,17]).…”

Section: Introductionmentioning

confidence: 99%

Maximal and minimal dynamic Petri net slicing

Llorens¹,

Oliver²,

Silva³

et al. 2021

Preprint

View full text Add to dashboard Cite

Context: Petri net slicing is a technique to reduce the size of a Petri net so that it can ease the analysis or understanding of the original Petri net.Objective: Presenting two new Petri net slicing algorithms to isolate those places and transitions of a Petri net (the slice) that may contribute tokens to one or more places given (the slicing criterion). Method:The two algorithms proposed are formalized. The completeness of the first algorithm and the minimality of the second algorithm are formally proven. Both algorithms together with other three state-of-the-art algorithms have been implemented and integrated into a single tool so that we have been able to carry out a fair empirical evaluation.Results: Besides the two new Petri net slicing algorithms, a public, free, and open-source implementation of five algorithms is reported. The results of an empirical evaluation of the new algorithms and the slices that they produce are also presented. Conclusions:The first algorithm collects all places and transitions that may influence (in any computation) the slicing criterion, while the second algorithm collects a minimum set of places and transitions that may influence (in some computation) the slicing criterion. Therefore, the net computed by the first algorithm can reproduce any computation that contributes tokens to any place of interest. In contrast, the second algorithm loses this possibility but it often produces a much more reduced subnet (which still can reproduce some computations that contribute tokens to some places of interest). The first algorithm is proven complete, and the second one is proven minimal.

show abstract

“…Sometimes, slicing of a Petri Net is performed so that the size of the Petri Net is reduced so that the state space (aka reachability graph) generated from it is smaller as well. However, the existing slicing algorithms are ineffective for real-world discrete event systems [1]; Also, slicing is not applicable to performance evaluation [2]. Thus, there is a need for alternative methodologies for slicing that are effective for Petri net models of real-life large discrete event systems.…”

Section: Introductionmentioning

confidence: 99%

Extracting Petri Modules From Large and Legacy Petri Net Models

Davidrajuh

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Petri nets, even though very useful for modeling of discrete event systems, suffer from some weaknesses such as huge size, huge state space, and slow in simulation. Due to the huge state space, model checking a Petri net is difficult. Also, due to the slowness in simulation, discrete-timed Petri nets cannot be used for real-time applications. Thus, modular Petri nets are suggested as a way of overcoming these difficulties. In modular Petri nets, modules are designed, developed, and run independently, and the modules communicate with each other via inter-modular connectors. This approach is suggested for developing newer Petri net models. However, there exists a large number of Petri net models of real-life systems, and these legacy models are enormous and non-modular. And, these models cannot be discarded as large amounts of time and money were spent to develop these models. This paper presents a unique algorithm for extracting modules from large and legacy Petri net models. The algorithm extracts modules (known as "Petri modules") that are well-defined for inter-modular collaboration. Also, the extraction method preserves the structural properties. The goal of the paper is to introduce a methodology by which Petri nets can be moved to a new level in which a modular Petri net model can be made of Petri modules. The Petri modules are independent and can be hosted on different computers. These modules communicate via inter-modular components such as TCP/IP sockets. Since Petri modules are compact, also run faster, thus become suitable for supervisory control of real-time systems.

show abstract

Performance of Static Slicing Algorithms for Petri Nets

Cited by 5 publications

References 0 publications

Dynamic Slicing of Time Petri Net Based on MTL Property

Dynamic Slicing of Time Petri Net Based on MTL Property

Maximal and minimal dynamic Petri net slicing

Extracting Petri Modules From Large and Legacy Petri Net Models

Contact Info

Product

Resources

About