Slicing Petri nets
Petri net (PN) slicing is a syntactic technique used to reduce a PN model based on a given criterion.[1][2][3] Informally, a slicing criterion could be a property for which a PN model is analyzed or is a set of places, transitions, or both. A sliced part constitutes only that part of a PN model that may affect the criteria.
Background
[edit]The term slicing was coined by M. Weiser in the context of program debugging.[4] According to Wieser, a program slice is a reduced, executable program that can be obtained from a program P based on the variables of interest and line number by removing statements such that program slicing replicates part of the behavior of the program. The term was later adapted to the context of Petri nets and for other classes of Petri nets such as Algebraic Petri nets.[1][2][3][5]
References
[edit]- ^ a b Yasir Imtiaz Khan and Matteo Risoldi. Optimizing algebraic petri net model checking by slicing. International Workshop on Modeling and Business Environments (ModBE’13, associated with Petri Nets’13), 2013
- ^ a b Yasir. Imtiaz. Khan and Nicolas. Guelfi. Slicing high-level petri nets. International Workshop on Petri Nets and Software Engineering (PNSE’14) associated with Petri Nets’14), 2(3):201–220, 2014.
- ^ a b Astrid Rakow. Safety slicing petri nets. In Serge Haddad and Lucia Pomello, editors, Application and Theory of Petri Nets, volume 7347 of Lecture Notes in Computer Science, pages 268–287. Springer Berlin Heidelberg, 2012
- ^ Mark Weiser. Program slicing. In Proceedings of the 5th international conference on Software engineering, ICSE ’81, pages 439–449, Piscat- away, NJ, USA, 1981. IEEE Press.
- ^ Yasir. Imtiaz. Khan and Nicolas. Guelfi. Slapn: A tool for slicing algebraic petri nets. International Workshop on Petri Nets and Software Engineering (PNSE’14) associated with Petri Nets’14), 2(3):343–345, 2014.
 | This computer-programming-related article is a stub. You can help Wikipedia by expanding it. |