The Legal Firing Sequence Problem of Petri Nets

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 3, 2000, Pages 397-406

  Watanabe, Toshimasa ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Legal firing sequence problems; Np hardness; Petri nets; Pseudo polynomial time algorithms; Time complexity analysis

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS; RESOURCE ALLOCATION; SCHEDULING; THEOREM PROVING;

HEURISTIC ALGORITHMS; LEGAL FIRING SEQUENCE PROBLEMS; MARKING REACHABILITY PROBLEM; NP-HARDNESS; PETRI NET THEORY; PSEUDOPOLYNOMIAL TIME ALGORITHMS; TIME COMPLEXITY ANALYSIS;

PETRI NETS;

EID: 0034156622     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. S. Even . Graph Algorithms Pitman London U.K. 1978.
2. T. Fujito S. Taoka and T. Watanabc On the legal firing sequence problem of Petri nets with cactus structure Proc. 12th Karuizawa Workshop on Circuits and Systems pp.213-218 IEICE of Japan April 1999 (in Japanese). To appear in IEICE Trans. Fundamentals.
3. M. R. Garey and D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness Freeman San Francisco CA 1978.
4. R. L. Graham E. L. Lawler J. K. Lcnstra and A. H. G. R. Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics vol.5 pp.287-326 1979.
5. M. Iwamoto T. Fujito S. Taoka and T. Watanabe Solving the legal firing sequence problem for edge-weighted cactuses IEICE Technical Report CST98-32 Jan. 1999 (in Japanese).
6. M. Iwamoto S. Taoka and T. Watanabe The legal firing sequence problem for cyclic cactuses IEICE Technical Report CST98-25 Oct. 1998 (in Japanese).
7. R. M. Keller A fundamental theorem of asynchronous parallel computation Proc. Sagamore Comput. Conf. Lecture Notes in Computer Science Parallel Processing ed. T-Y. Feng pp.102-112 Springer-Verlag Berlin Germany 1975.
8. R. Kosaraju Decidability of reachability in vector addition systems Proc. 14th Annual ACM Symposium on Theory of Computing pp.207-280 1982.
9. L. H. Landweber and E. L. Robertson Properties of conflict-free and persistent Petri nets J. Assoc. Comput. Mach. vol.25 no.3 pp.352-364 1978.
10. E. W. Mayr An algorithm for the general Petri net reachability problem Proc. 13th Annual ACM Symposium on Theory of Computing pp.238-246 1981.
11. See also SIAM J. Comput. vol.13 pp.441-460 1984 (with the same title by the author).
12. K. Morita and T. Watanabe The legal firing sequence problem of Petri nets with state machine structure Proc. 1996 IEEE International Symposium on Circuits and Systems pp.64-67 May 1996.
13. T. Murata Petri nets: Properties analysis and applications Proc. IEEE vol.77 pp.541-580 April 1989.
14. I. Nabeshima Sukejuringu-Riron (Theory of Scheduling) Morikita Shuppan Pub. Co. Ltd. 1974 (in Japanese).
15. J. L. Peterson Petri Net Theory and the Modeling of Systems. Prcntice-Hall Englewood Cliffs N.J. 1981.
16. W. Reisig Petri Nets / An Introduction Springer-Verlag Berlin Germany 1982.
17. S. Tanimoto M. Yamauchi and T. Watanabe Finding minimal siphons in general Petri nets IEICE Trans. Fundamentals vol.E79-A no.ll pp.1817-1824 Nov. 1996.
18. T. Watanabe Y. Mizobata and K. Onaga Minimum initial marking problems of Petri nets IEICE Trans. vol.E72 no.12 pp. 139.0-1399 Dec. 1989.
19. T. Watanabe Y. Mizobata and K. Onaga Time complexity of legal firing sequence and related problems of Petri nets IEICE Trans. vol.E72 no.12 pp.1400-1409 Dec. 1989.
20. T. Watanabc and M. Yamauchi New priority-lists for scheduling in timed Petri nets Application and Theory of Petri Nets 1993 no.G91 in Lecture Notes in Computer Science ed. M.AMarsan pp.493-512. Springer-Verlag Berlin Germany June 1993.
21. M. Yamauchi S. Tanimoto and T. Watanabe Extracting siphons containing a specified set of places in a Petri net 1998 IEEE International Conference on Systems Man and Cybernetics pp.142-147 Oct. 1998.
22. M. Yamauchi and T. Watanabe An approximation algorithm for the legal firing sequence problem of Petri nets Proc. 1991 IEEE International Symposium on Circuits and Systems pp.181-18-1 May 1994.
23. M. Yamauchi and T. Watanabe A heuristic algorithm for the minimum initial marking problem of Petri net 1997 IEEE International Conference on Systems Man and Cybernetics pp.245-250 Oct. 1997.
24. M. Yamauchi and T. Watanabe A new heuristic algorithm for the legal firing sequence problem of Petri nets IEICE Technical Report CST97-32 Nov. 1997.
25. M. Yamauchi and T. Watanabe A heuristic algorithm FSD for the legal firing sequence problem of Petri nets 1998 IEEE International Conference on Systems Man and Cybernetics pp.78-83 Oct. 1998.
26. M. Yamauchi and T. Watanabe Algorithms for extracting minimal siphons containing specified places in a general Petri net IEICE Trans. Fundamentals vol.E82-A no.ll pp.2500-2575 Nov. 1999.