The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms

[1]  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.

[2]  Toshimasa Watanabe,et al.  An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[3]  S. Kumagai,et al.  Submarking reachability of marked graphs , 1984 .

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

[5]  Toshimasa Watanabe,et al.  An approximation algorithm for the legal firing sequence problem of Petri nets , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[6]  Toshimasa Watanabe,et al.  Heuristic algorithms for the marking construction problem of Petri nets , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[7]  Toshimasa Watanabe,et al.  A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets , 2003, ICATPN.

[8]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[9]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..