An algorithm to compute the minimal siphons in S 4 PR nets
Minimal siphons in the class of S 4 PR nets have become a conceptual and practical central tool for the study of the resource allocation related aspects in discrete event dynamic systems as, for example, the existence of deadlocks. Therefore the availability of efficient algorithms to compute the minimal siphons is essential. In this paper we try to take advantage of the particular properties of the siphons in S 4 PR to obtain an efficient algorithm. These properties allow us to express minimal siphons as the union of pruned minimal siphons containing only one resource. The pruning operation is built from the binary pruning relation defined on the set of minimal siphons containing only one resource. This pruning relation is represented by means of a directed graph. The computation of the minimal siphons is based on the maximal strongly connected components of this graph. The algorithm is highly economic in memory in all intermediate steps when compared to the classical algorithms.
KeywordsPetri-nets Structural analysis Siphons Graph theory Strongly connected component
This work has been partially supported by Technological University of Panama and Secretaría Nacional de Ciencia, Tecnología e Innovación, SENACYT, Panama. Also, this work has been partially supported by the European Community’s Seventh Framework Programme under project DISC (Grant Agreement n. INFSO-ICT-224498) and the project CICYT-FEDER DPI2006-15390. The authors are indebted to three anonymous referees, whose comments helped to improve previous versions of this paper. Also, the authors extend gratitude to Marcela Paredes de Vásquez, Myriam Gonzalez, Luis Barahona, Martin Candanedo, Raúl Barahona, Clifton Clunie, Lydia Toppin and Delva Batista for valuable support during the research process of this work.
- Barkaoui K, Lemaire B (1989) 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 application of Petri nets, Bonn, pp 1–22Google Scholar
- Colom JM (2003) The resource allocation problem in flexible manufacturing systems. In: van der Aalst W, Best E (eds) Proceedings of the 24th international conference on applications and theory of Petri nets. Lecture notes in computer science, vol 2679. Springer, Eindhoven, pp 23–35Google Scholar
- Colom JM, Silva M (1991) Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows. In: Rozenberg G (ed) Advances in Petri nets 1990. Lecture notes in computer science, vol 483. Springer, Berlin, pp 79–112Google Scholar
- Ezpeleta J, Couvreur JM, Silva M (1993) A new technique for finding a generating family of siphons, traps and ST-components. Application to colored Petri nets. In: Advances in Petri nets. Lecture notes in computer science, vol 674. Springer, New York, pp 126–147Google Scholar
- Li Z, Zhou MC (2009) Deadlock resolution in automated manufacturing systems: a novel Petri net approach. In: Advances in industrial control. Springer, New YorkGoogle Scholar
- Lopez-Grao JP, Colom JM (2010) The resource allocation problem in software applications: a Petri net perspective. In: Proceedings of the international workshop on Petri nets and software engineering PNSE’10, Braga, Portugal, pp 7–21Google Scholar
- Rovetto CA, Cano EE, Colom JM (2010) Deadlock analysis in minimal adaptive routing algorithms using petri nets. In: IEEE international conference on systems man and cybernetics (SMC), 2010, Istanbul, Turkey, pp 2619–2626Google Scholar
- Tricas F (2003) Analysis, prevention and avoidance of deadlocks in sequential resource allocation systems. PhD thesis, Zaragoza. España, Departamento de Ingeniería Eléctrica e Informática, Universidad de ZaragozaGoogle Scholar
- Tricas F, García-Vallés F, Colom JM, Ezpeleta J (2005) A Petri net structure-based deadlock prevention solution for sequential resource allocation systems. In: Proceedings of the 2005 IEEE international conference on robotics and automation, Barcelona, Spain, pp 272–278Google Scholar
- Wang Y, Liao H, Reveliotis S, Kelly T, Mahlke S, Lafortune S (2009b) Gadara nets: modeling and analyzing lock allocation for deadlock avoidance in multithreaded software. In: Proceedings of the 48th IEEE conference on decision and control, 2009 held jointly with the 2009 28th Chinese control conference. CDC/CCC 2009, pp 497–4976Google Scholar