Time complexity analysis of the minimal siphon extraction problem of petri nets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 11, 1999, Pages 2558-2565

  Yamauchi, Masahiro ^a   Watanabe, Toshimasa ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Minimal siphons; Np completencss; Petri nets; Polynomial time solvability; Strongly connectedness

Indexed keywords

EID: 0344359093     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. K. Barkaoui G. Dutheillet and S. Haddad An efficient algorithm for finding structural deadlocks in colored pétri nets in Application and Theory of Pétri Nets 1993 (Ed. by M.A. Marsan) No.691 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.69-88 1993.
2. E. Best Structure theory of petri nets: The free choice hiatus Advances in Petri Nets 1986 (Eds. by W.R.W. Brauer and G. Rozenberg) No.254 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.168206 1987.
3. E.R. Boer and T. Murata Generating basis siphons and traps of Petri nets using the sign incidence matrix IEEE Trans. Circuits & Syst.-I vol.41 no.4 pp.266-271 1994.
4. J. Esparza Minimal deadlocks in free choice nets Hildesheimer Informatikberichte 1/89 Institut fur Informatik Universität Hildesheim 1989.
5. S. Even Graph Algorithms Pitman London U.K. 1978.
6. [G] S. Fortune J.E. Hopcroft and J. Wyllie The directed subgraph homeomorphism problem Theoretical Computer Science vol.10 pp.111-121 1980.
7. M.R. Garey and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness Freeman San Francisco CA 1978.
8. P. Kemper Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net in Application and Theory of Petri Nets 1993 (Ed. by M.A. Marsan) No.691 in Lecture Notes in Computer Science SpringerVerlag Berlin Germany pp.319-338 1993.
9. P. Kemper and F. Bause An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets in Application and Theory of Petri Nets 1992 (Ed. by K. Jensen) No.616 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.263-278 1992.
10. J. Martinez and M. Suva A simple and fast algorithm to obtain all invariants of a generalized Petri net in Fachberichte Informatik (Eds. by C. Girault and W. Reisig) vol.52 in Lecture Notes in Computer Science SpringerVerlag Berlin Germany pp.301-310 1982.
11. T. Murata Pétri nets: Properties analysis and applications Proc. IEEE vol.77 pp.541-580 1989.
12. J.L. Petcrson Pétri Net Theory and the Modeling of Systems Prentice-Hall Englewood Cliffs N.J. 1981.
13. W. Reisig Petri Nets / An introduction Springer-Verlag Berlin Germany 1982.
14. 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 199G.
15. 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 1989.
16. T. Watanabe and M. Yamauchi New priority-lists for scheduling in timed Petri nets in Application and Theory of Petri Nets 1993 (Ed. by M. A. Marsan) no.G91 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.493-512 1993.
17. M. Yamauchi S. Tanimoto and T. Watanabe Finding a minimal siphon containing specified places in a general Petri net IEICE Trans. Fundamentals vol.E79-A no.ll pp.1825-1828 1996.
18. M. Yamauchi S. Tanimoto and T. Watanabe Extracting siphons containing a specified set of places in a Petri net Proc. 1998 IEEE International Conference on Systems Man and Cybernetics pp.142-147 1998.
19. M. Yamauchi and T. Watanabe A heuristic algorithm FSD for the legal firing sequence problem of Petri nets Proc. 1998 IEEE International Conference on Systems Man and Cybernetics pp.78-83 1998.
20. M. Yamauchi and T. Watanabe Algorithms for extracting minimal siphons containing specified places in a general Petri net IEICE Trans. Fundamentals vol.82-A no.ll pp.2566-2575 1999.