An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets
Barkaoui, Kamel; Dutheillet, Claude; Haddad, Serge (1993), An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets, in Ajmone Marsan, Marco, Application and Theory of Petri Nets 1993 14th International Conference, Chicago, Illinois, USA, June 21-25, 1993. Proceedings, Springer : Berlin, p. 69-88. http://dx.doi.org/10.1007/3-540-56863-8_41
TypeCommunication / Conférence
Conference title14th International Conference on application and theory of Petri nets (ICATPN 1993)
Book titleApplication and Theory of Petri Nets 1993 14th International Conference, Chicago, Illinois, USA, June 21-25, 1993. Proceedings
Book authorAjmone Marsan, Marco
Series titleLecture Notes in Computer Science
Number of pages591
MetadataShow full item record
Abstract (EN)In this paper, we present an algorithm to compute structural deadlocks in colored nets under specified conditions. Instead of applying the ordinary algorithm on the unfolded Petri net, our algorithm takes advantage of the structure of the color functions. It is obtained by iterative optimizations of the ordinary algorithm. Each optimization is specified by a meta-rule, whose application is detected during the computation of the algorithm. The application of such meta-rules speeds up a step of the algorithm with a factor proportional to the size of a color domain. We illustrate the efficiency of this algorithm compared to the classical approach on a colored net modelling the dining philosophers problem.
Subjects / KeywordsPetri nets; Colored Petri Nets
Showing items related by title and author.
Chiola, Giovanni; Dutheillet, Claude; Franceschinis, Giuliana; Haddad, Serge (1993) Article accepté pour publication ou publié