A polynomial algorithm to find a set of elementary siphons in a class of Petri Nets

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 5, Issue , 2004, Pages 4861-4866

  Li, ZhiWu ^a   Zhi, YunAn ^a   Zhou, MengChu ^b  

^a XIDIAN UNIVERSITY   (China)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Deadlock control; Elementary siphon; Petri net; Siphon

Indexed keywords

DEADLOCK CONTROL; ELEMENTARY SIPHON; POLYNOMIAL ALGORITHMS; SELF-CONTROLLING NETS;

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; GRAPH THEORY; POLYNOMIALS; RESOURCE ALLOCATION; SET THEORY; SIPHONS; THEOREM PROVING;

PETRI NETS;

EID: 15744385448     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2004.1401301     Document Type: Conference Paper

References (13)

1. T. Murata, "Petri nets: properties, analysis, and applications," Proc. IEEE, vol.77, pp.541-580, 1989.
2. S. A. Reveliotis, "On the siphon-based characterization of liveness in sequential resource allocation systems", in Proc. Int. Conf. Application and Theory of Petri Nets 2003, LNCS, vol.2679, pp.241-255, Berlin: Springer-Verlag, 2003.
3. K. Lautenbach, "Linear algebraic calculation of deadlocks and traps," in Concurrency and Nets, Voss, Genrich, and Rozenberg, Eds. Springer-Verlag, 1987, pp.315-336.
4. J. Esparza and M. Suva, "A polynomial-time algorithm to decide liveness of bounded free choice nets," Theoretical Computer Science, vol. 102, pp. 185-205, 1992.
5. K. Barkaoui and B. Lemairre, "An effective characterization of minimal deadlocks and traps in Petri nets based on graph theory," in Proc. 10th. Int. Conf. Application and Theory of Petri nets, Bonn, 1989, pp.1-22.
6. K. Barkaoui and M. Minoux, "A polynomial-time graph algorithm to decide liveness of some basic classed of bounded Petri nets," in Advances in Petri Nets 1992, Lecture Notes in Computer Science, K. Jensen, Ed. Berlin: Springer Verlag, 1992, vol. 616, pp.62-75.
7. M. Minoux and K. Barkaoui, "Deadlocks and traps in Petri nets as horn-satisfiability solutions and some related polynomially solvable problems," Discrete Mathematics, vol.29, pp. 195-210, 1990.
8. E. R. Boer and T. Murata, "Generating basis siphons and traps of Petri nets using the sign incidence matrix," IEEE Trans. Circuits and Systems, I-Fundamental Theory and Applications, vol.41, no.4, pp.266-271, 1994.
9. F. Tricas and J. Ezpeleta, "Some results on siphon computation for deadlock prevention in resource allocation systems modeled with Petri nets," Proc. IEEE Int. Conf. Emerging Technologies and Factory Automation, Sept. 16-19, 2003, pp.322-329.
10. F. Tricas, "Deadlock analysis, prevention and avoidance in sequential resource allocation systems," Ph.D. Thesis, University of Zaragoza, Spain, May 2003.
11. J. Ezpeleta, J. M. Colom, and J. Martinez, "A Petri net based deadlock prevention policy for flexible manufacturing systems," IEEE Trans. Robot. Automat., vol. 11, no.2, pp. l73-184, 1995.
12. K. Barkaoui and I. B. Abdallah. "A deadlock prevention method for a class of FMS," in Proc. IEEE Int. Conf. Syst., Man, Cybern, Vancouver, BC, Canada, 1995, pp.4119-4124.
13. Z. W. Li and M. C. Zhou, "Elementary siphons of Petri nets and their application for deadlock prevention in flexible manufacturing system," IEEE Trans. Syst. Man Cybern., vol.34, pp.38-51, Jan. 2004.