Reachability analysis in T-invariant-less Petri nets

An algorithm for reachability analysis in place/transition Petri nets having no transition invariants (T-invariants) is proposed. Given a Petri net with initial and target markings, a so-called complemented Petri net is created first that consists of the given Petri net and an additional complementary transition. Thereby, the reachability task is reduced to computation and investigation of those minimal-support and linearly combined T-invariants of the complemented Petri net, in which the complementary transition fires only once. Then, for each T-invariant with a single firing of the complementary transition, the algorithm will try to create a reachability path from the given initial marking to the target marking.

[1]  Karsten Schmidt.  Stubborn sets for model checking the EF/AG fragment of CTL , 2000 .

[2]  Karsten Schmidt,et al.  Stubborn Sets for Standard Properties , 1999 .

[3]  René Boel,et al.  On forbidden state problems for a class of controlled Petri nets , 1995, IEEE Trans. Autom. Control..

[4]  MengChu Zhou,et al.  Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.

[5]  Toshimasa Watanabe,et al.  Legal firing sequence and related problems of Petri nets , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[6]  Giovanni Chiola,et al.  GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets , 1995, Perform. Evaluation.

[7]  Günter Hommel,et al.  TimeNET: A Toolkit for Evaluating Non-Markovian Stochastic Petri Nets , 1995, Perform. Evaluation.

[8]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

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

[10]  Alessandro Giua,et al.  A Survey of Petri Net Methods for Controlled Discrete Event Systems , 1997, Discret. Event Dyn. Syst..

[11]  Manuel Silva Suárez,et al.  Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows , 1991, Applications and Theory of Petri Nets.

[12]  Toshimasa Watanabe,et al.  A heuristic algorithm FSD for the legal firing sequence problem of Petri nets , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).