Exploiting Local Persistency for Reduced State Space Generation
This paper deals with the partial order techniques of Petri nets, based on persistent sets and step graphs. To take advantage of the strengths of each method, it proposes the persistent step sets as a parametric combination of the both methods. The persistent step sets method allows to fix, for each marking, the set of transitions to be covered by the selected steps and then to control their maximal length and number. Moreover, this persistent step selective search preserves, at least, deadlocks of Petri nets.
KeywordsPetri nets Reachability analysis State explosion problem Persistent sets Partial order techniques Step graphs
- 6.Junttila, T.: On the symmetry reduction method for Petri nets and similar formalisms. Ph.D. dissertation, Helsinki University of Technology, Espoo, Finland (2005)Google Scholar