Efficient reachability analysis of bounded Petri nets using constraint programming

In this paper, we consider the Petri net (PNs) reachability problem, which consists of finding transition firing sequences leading to a given target marking. We focus on bounded Petri nets for which we develop a correct and complete algorithm using the logical abstraction technique proposed by Benasser and Yim. We define for that the PN sequential depth parameter, which corresponds to the maximal number of transitions to fire in order to reach any marking of the reachability graph.

[1]  Johan Gunnarsson.  Symbolic tools for verification of large scale DEDS , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[2]  Pascal Yim,et al.  Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming , 2004, CPAIOR.

[3]  Thierry Jéron,et al.  On-the-fly verification of finite transition systems , 1992, Formal Methods Syst. Des..

[4]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[5]  Markus Lindqvist,et al.  Parameterized reachability trees for predicate/transition nets , 1991 .

[6]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[7]  Gérard Berthelot.  Transformations and Decompositions of Nets , 1986 .

[8]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[9]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[10]  Kurt Lautenbach.  Linear Algebraic Techniques for Place/Transition Nets , 1986, Advances in Petri Nets.

[11]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[12]  Peter Huber,et al.  Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.