A Survey of Petri Nets Slicing.

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Petri nets slicing was first developed to facilitate debugging, but then was used for the alleviation of the state space explosion problem for the model checking of Petri nets. In this article, different slicing techniques are studied along with their algorithms introducing: (i) a classification of Petri nets slicing algorithms based on their construction methodology and objective (such as improving state space analysis or testing); (ii) a qualitative and quantitative discussion and comparison of major differences such as accuracy and efficiency: (iii) a syntactic unification of slicing algorithms that improve state space analysis for easy and clear understanding; and (iv) applications of slicing for multiple perspectives. Furthermore, some recent improvements to slicing algorithms are presented, which can certainly reduce the slice size even for strongly connected nets. A noteworthy use of this survey is for the selection and improvement of slicing techniques for optimizing the verification of state event models.