Some results on siphon computation for deadlock prevention in resource allocation systems modeled with Petri nets

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn 1, Issue January, 2003, Pages 322-329

  Tricas, Fernando ^a   Ezpeleta, Joaquin ^a  

^a UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORY AUTOMATION; PETRI NETS; RESOURCE ALLOCATION;

DEADLOCK PREVENTION; EXPONENTIAL NUMBERS; LIVENESS PROPERTIES; MINIMAL SIPHONS; PETRI NET MODELS; RESOURCE ALLOCATION SYSTEMS; STRUCTURAL COMPONENT;

SIPHONS;

EID: 15744381411     PISSN: 19460740     EISSN: 19460759     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2003.1247724     Document Type: Conference Paper

References (33)

1. T. Murata, "Petri nets: Properties, analysis and applications" Proceedings of the IEEE, vol. 77, pp. 541-580. Apr. 1989.
2. F. Commoner, "Deadlocks in Petri nets" Applied Data Research, 1972.
3. G. W. Brams, Reseaux de Petri. Theorie et Pratique (2 tomes), Paris. Masson, 1983.
4. J. Esparza and M. Silva, "A polynomial-time algorithm to decide liveness of bounded free choice nets'' Theoretical Computer Sciences, vol. 102. pp. 185-205, 1992.
5. K, Barkaoui and M. Minoux, "A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets." in Advances in Petri Nets 1992 (K. Jensen, ed.), vol. 616 of Lecture Notes in Computer Science, pp. 62-75. Berlin: Springer Verlag, 1992.
6. K. Barkaoui and J. Pradat-Peyre, "On liveness and controlled siphons in Petri nets," in Proc. of the 1996 Int. Conf. on Aplications and Theory of Petri Nets, Springer Verlag, June 1996.
7. M. Jeng, X. Xie, and Y. Huang, "Manufacturing modeling using process nets with resources," in Proc. of the 2000 IEEE International Conference on Robotics and Automation, (San Francisco. USA), pp. 2185-2190, Apr. 2000.
8. J. Park and S, Reveliotis, "Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings," IEEE Transactions on Automatic Control, vol, 46, pp. 1572-1583. Oct. 2001.
9. F. Tricas, J. Colom, and J. Ezpeleta, "A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming." in Proc. of the 11th European Simulation Symposium (G. Morton, D. Moller, and U. Rude, eds.), (Erlangen, Germany). pp. 542-546, The society for Computer Simulation Int., Oct. 1999.
10. J. Ezpeleta, J. Colom, and J. Martinez, "A Petri net based deadlock prevention policy for flexible manufacturing systems," IEEE Trans, on Robotics and Automation, vol. 11, pp. 173-184, April 1995.
11. F. Tricas, F. Garcia-Valles, J. Colom, and J. Ezpeleta, "Art iterative method for deadlock prevention in FMS," in Disscrete Event Systems: Analysis and Control. Proc. of the Workshop On Discrete Event Systems 2000 (R. Boel and G. Stremersch, eds.), (Ghent, Belgium), pp. 139-148, Kluwer Academic Publishers, Aug. 2000.
12. M. V. lordache, J. O. Moody, and P. Antsaklis, "Synthesis of deadlock prevention supervisors using Petri nets," IEEE Transactions on Robotics and Automation, vol. 18, pp. 59-68, Feb. 2002.
13. E. R. Boer and T. Murata, "Generating basis siphons and traps of Petri nets using the sign incidence matrix.," IEEE Trans, on Circuits and Systems, I - Fundamental Theory and Applications, vol. 41, no. 4 pp. 266-271, 1994
14. J, Toudic, Algorithmes d'analyse structurelle de reseaux de Petri. PhD thesis, Universte Pierre el Marie Curie (Paris VI), 1981.
15. H. Alaiwan and J. Toudic, "Recherche des semi-flots, des verroux et des trappes dans les rseaux de Petri," Technique et Science Informaliques, pp. 103-112. 1985. In French.
16. K. Lautenbach. "Linear algebraic calculation of deadlocks and traps." in Concurrency and Nets (Voss, Genrich, and Rozemberg, eds.), pp. 315-336, Springer Verlag, 1987.
17. J. Ezpeleta and J. Couvreur, "A new technique for finding a generating family of siphons, traps and sl-components. Application to colored Petri nets." in Proceedings of the 12th. International Conference on Application and Theory of Petri Nets. (Aarhus (Denmark)), pp. 145-164. June 1991.
18. J. Ezpeleta, J. Couvreur, and M. Silva.'A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri nets," in Advances in Petri Nets 1993 (G. Rozenberg, ed.), vol. 674 of Lecture Notes on Computer Science, pp. 126-147, Aarhus (Denmark): Springer-Verlag, 1993.
19. M. Yamauchi and T. Watanabe, "Algorithms for extracting minimal siphons containing specified places in a general Petri net," IE1CE Trans. Fundamentals, vol. E82-A, pp. 2566-2575, Nov. 1999.
20. K. Barkaouri and B. Lemaire, "An effective characterization of minimal deadlocks and traps in Petri nets based on graph theory," in Proceedings of the 10th. International Conference on Theory and Applications of Petri nets, (Bonn), pp. 1-22, 1989.
21. T. Watanabe. M. Yamauchi, and S. Tanimoio, "Extracting siphons containing specified set of places in petri net," in Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'98), 1114 October 1998, San Diego, USA, pp. 142-147, Oct. 1998.
22. M. Jeng, M. Peng, and Y Huang, "An algorithm for calculating minimal siphons and traps of petri nets," Int. Journal of Intelligent Control and Systems, vol. 3, no. 3, pp. 263-275, 1999.
23. M. Silva, Las Redes de Petri en la Automduica y la Informdtica. Madrid: Editorial AC, 1985.
24. 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. Newslet-terlnfo: 39.
25. F. G. Valles, Contributions to the Structural and Symbolic Analysis of Place/Transition Nets with Applications to Flexible Manufacturing Systems and Asynchronous Circuits. PhD thesis, Zaragoza. España, Departamento de Ingenieria Electrica e Informatica, Universidad de Zaragoza, 1999.
26. F. Tricas, Deadlock Analysis, Prevention and Avoidance in Sequential Resource Allocation Systems. Ph.D. Thesis, May 2003.
27. S. AkI, Parallel Computation: Models and Methods. Prentice-Hall, 1997.
28. B. L. Massingill, T. G. Mattson, and B. A. Sanders, "More patterns for parallel application programs, in Proceedings of the Eighth Pattern Languages of Programs Workshop, 2001.
29. R. Bryant, "Symbolic boolean manipulation with ordered binary-decision diagrams," ACM Computing Surveys, vol. 24, pp. 293-318, September 1992.
30. M. Yamauchi and T. Watanabe, 'Time complexity analysis of the minimal siphon extraction problem of Petri nets," 1E1CE Trans. Fundamentals, vol. E82-A. pp. 2558-2565, Nov. 1999.
31. W. D. Gropp and E. Lusk, User's Guide for mpich, a Portable Implementation of MPl. Mathematics and Computer Science Division, Argonne National Laboratory, 1996. ANL-96/6.
32. M. P. I. Forum, "MPL A message-passing interface standard," International journal of Supercomputer Applications, vol, 8, no. 3/4, 1994.
33. D. J. Kuck, The structure of computers and computations, vol. 1. John Wiley and Sons, 1978.