Finding minimal siphons in general Petri nets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 11, 1996, Pages 1817-1823

  Tanimoto, Shinji ^a   Yamauchi, Masahiro ^a   Watanabe, Toshimasa ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

General Petri nets; Minimal siphons; NP completeness; Polynomial time algorithms; Strongly connectedness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY;

POLYNOMIAL TIME ALGORITHMS; SIPHONS;

PETRI NETS;

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

References (14)

1. K. Barkaoui, C. Dutheillet, and S. Haddad, "An efficient algorithm for finding structural deadlocks in colored Petri nets," Lecture Notes in Computer Science #691, ed. Marsan, A., pp.69-88, Springer-Verlag, Berlin, 1993.
2. E.R. Boer and T. Murata, "Generating basis siphons and traps of Petri nets using the sign incidence matrix," IEEE Trans. Circuit & Syst. 1, vol.41, no.4, pp.266-271, April 1994.
3. J. Esparza, "Minimal deadlocks in free choice nets," Hildesheimer Informatikberichte 1/89, Universität Hildesheim, Institut für Informatik, 1989.
4. S. Even, "Graph Algorithms," Pitman, London, UK, 1978.
5. M.R. Garey and D.S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-completeness," W.H. Freeman and Company, New York, 1979.
6. P. Kemper, "Linear time algorithm to find a minimal dead-lock in a strongly connected free-choice net," Lecture Notes in Computer Science #691, ed. Marsan, A., pp.319-338, Springer-Verlag, Berlin, 1993.
7. P. Kemper and F. Bause, "An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets," Lecture Notes in Computer Science #616, ed. Jensen, K., pp.263-278, Springer-Verlag, Berlin, 1992.
8. T. Matsumoto, S. Yamasaki, and Y. Tsuruta, "The necessary and sufficient condition for structural liveness of general Petri nets containing structural-live minimal dead-locks," Proc. of the 7th Karuizawa Workshop on CAS, IEICE, pp.85-90, April 1994.
9. T. Murata, "Petri nets: Properties, analysis and applications," Proc. of the IEEE, vol.77, no.4, pp.541-580, April 1989.
10. J.L. Peterson, "Petri Net Theory and the Modeling of Systems," Prentice-Hall, Englewood Cliffs, N.J., 1981.
11. W. Reisig, "Petri Nets/An introduction," Sprineer-Verlag, Berlin, 1982.
12. S. Tanimoto, M. Yamauchi, and T. Watanabe, "Finding minimal deadlocks in general Petri nets," IEICE Technical Report, COMP95-3, April 1995.
13. S. Tanimoto, M. Yamauchi, and T. Watanabe, "Finding a minimal siphon containing a specified place in general Petri nets," IEICE Technical Report, CST95-13, Nov. 1995.
14. M. Yamauchi, S. Tanimoto, and T. Watanabe, "Finding a minimal siphon containing specified places in a general Petri net," IEICE Trans., vol.E79-A, no.11, pp.1825-1828, April 1996.