Algorithms for extracting minimal siphons containing specified places in a general petri net

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 11, 1999, Pages 2566-2573

  Yamauchi, Masahiro ^a   Watanabe, Toshimasa ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Branch and bound algorithms; Minimal siphons; Petri nets; Siphon extraction

Indexed keywords

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

References (21)

1. K. Barkaoui C. Dutheillet and S. Haddad An efficient algorithm for finding structural deadlocks in colored petri nets in Application and Theory of Petri Nets 1993 M.A. Marsan ed. no.G91 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.69-88 1993.
2. 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.2G6-271 1994.
3. J. Esparza Minimal deadlocks in free choice nets Hildesheimer Informatikberichte 1/89 Institut fur Informatik Universität Hildeshcim 1989.
4. S. Even Graph Algorithms Pitman London U.K. 1978.
5. M.R. Garey and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness Freeman San Francisco CA 1978.
6. 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 M.A. Marsan ed. no.691 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.319-338 1993.
7. 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 K. Jensen ed. no.616 in Lecture Notes in Computer Science Springer-Verlag Berlin Germany pp.263-278 1992.
8. J. Martinez and M. Silva A simple and fast algorithm to obtain all invariants of a generalized Petri net in Fachberichte Informatik C. Girault and W. Reisig cds. vol.52 in Lecture Notes in Computer Science pp.301-310 SpringerVerlag Berlin Germany 1982.
9. T. Matsumoto S. Yamasaki and Y. Tsuruta The necessary and sufficient condition for structural liveness of general Petri nets containing structural-live minimal deadlocks Proc. 7th Karuizawa Workshop on CASIEICE of Japan pp.85-90 1994.
10. T. Murata Petri nets: Properties analysis and applications Proc. IEEE vol.77 pp.541-580 1989.
11. J.L. Peterson Petri Net Theory and the Modeling of Systems Prentice-Hall Englewood Cliffs N.J. 1981.
12. W. Reisig Petri Nets / An introduction Springer-Verlag Berlin Germany 1982.
13. 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 1996.
14. M. Wakuda M. Yamauchi S. Taoka and T. Watanabe A fast and space-saving algorihtm FAISN for computing petri net invariants with supports containing all specified nodes IEICE Technical Report CST99-1G pp.37-44 1999.
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 Application and Theory of Petri Nets 1993 M.A. Marsan ed. 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 Pétri 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 Pétri net Proc. 1998 IEEE Internatinal Conférence on Systems Man and Cybernetics pp.142-147 1998.
19. M. Yamauchi M. Wakuda S. Taoka and T. Watanabe A fast and space-saving algorithm for computing invariants of Petri nets Proc. 1999 IEEE International Conference on Systems Man and Cybernetics pp.I-866-I-871 1999.
20. 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.
21. M. Yamauchi and T. Watanabe Time complexity analysis of minimal siphon extraction problem of Petri nets IEICE Trans. Fundamentals vol.E82-A no.ll pp.25582565 1999.