An Integrated Environment for Petri Net Slicing
Petri net slicing is a technique to automatically isolate the part of a marked Petri net that influences or is influenced by a given set of places. There exist different algorithms for Petri net slicing with different objectives. Nevertheless, they have never been evaluated or compared from a practical point of view. In fact, because there does not exist a public implementation of some of them, their performance and scalability have remained unknown. In this paper we present three tools for the analysis and transformation of Petri nets. The three tools are complementary, and they allow us to extract from a Petri net a set of slices that preserve a given set of properties (e.g., boundedness, reversibility, etc.). For this, they include the first public, free, and open-source implementation of the most important algorithms for Petri net slicing, including a new algorithm that reduces the size of the slices. Our implementation of the algorithms allowed us to compare all of them and to measure and report for the first time about their individual performance.
- 1.Chang, C., Wang, H.: A slicing algorithm of concurrency modeling based on petri nets. In: Proceedings of the International Conference on Parallel Processing, ICPP 1986, pp. 789–792. IEEE Computer Society Press (1986)Google Scholar
- 2.Khan, Y., Guelfi, N.: Survey of Petri Nets Slicing. Technical report, University of Luxembourg, Faculty of Science, Technology and Communication (FSTC), Computer Science and Communications Research Unit (CSC), Luxembourg (2013). http://hdl.handle.net/10993/13606
- 3.Khan, Y., Risoldi, M.: Optimizing algebraic petri net model checking by slicing. In: International Workshop on Modeling and Business Environments, ModBE 2013, pp. 275–294 (2013). (associated with Petri Nets 2013)Google Scholar
- 4.Lee, W., Cha, S., Kwon, Y., Kim, H.: A slicing-based approach to enhance petri net reachability analysis. J. Res. Pract. Inform. Technol. 32(2), 131–143 (2000)Google Scholar