Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W.Reisig: Place-Transition Systems. In Petri Nets: Central models and their properties, W.Brauer, W.Reisig and G.Rozenberg eds., LNCS nℴ 254, Springer-Verlag, 1987, pp 117–141.
E.W. Mayr: An Algorithm for the General Petri Net Reachability Problem. In SIAM. Journal of Computing nℴ 13, 1984.
E. Best: Structure Theory of Petri Nets: the Free Choice Hiatus. In Petri Nets: Central models and their properties, W.Brauer, W.Reisig and G.Rozenberg eds., LNCS nℴ 254, Springer-Verlag, 1986, pp 168–205.
J. Martinez, M. Silva: A Simple and Fast Algorithm to Obtain all Invariants of a Generalized Petri Net. In Informatik Fachberichte nℴ 52, C.Girault and W.Reisig eds., Springer-Verlag, 1982, pp 301–310.
K.Lautenbach: Linear Algebraic Techniques for Place / Transition Nets. In Petri Nets: Central models and their properties, W.Brauer, W.Reisig and G.Rozenberg eds., LNCS nℴ 254, Springer-Verlag, 1986, pp 142–167.
F.Commoner: Deadlocks in Petri nets. In Applied Data Res. Inc., Wakefield, MA, 1972.
J. Esparza, M. Silva: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free-Choice Nets. Hildesheimer Informatikberichte 12/90, Institut für Informatik, Univ. Hildesheim.
K.Lautenbach: Linear Algebraic Calculation of Deadlocks and Traps. In Concurrency and Nets, K.Voss, H.Genrich and G.Rozenberg eds., Springer Verlag, 1987, pp 315–336.
K.Barkaoui, M.Minoux: A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. In Application and Theory of Petri Nets 92, Proc. of the 13th Conference, K. Jensen ed., LNCS nℴ 616, Springer-Verlag, Sheffield, UK, 1992, pp 62–74.
H.J. Genrich: Predicate/Transition Nets. In High-level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg eds., Springer-Verlag, 1991, pp 3–43.
K. Jensen: Coloured Petri Nets: A High Level Language for System Design and Analysis. In High-level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg eds., Springer-Verlag, 1991, pp 44–119.
J. Ezpeleta, J.M. Couvreur: A New Technique for Finding a Generating Family of Siphons, Traps and ST-Components. Application to Colored Petri Nets. In proc. of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, June 1991, pp 145–164.
J.M. Couvreur, S. Haddad, J.F. Peyre: Computation of Generative Families of Positive Flows in Coloured Nets. In proc. of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, June 1991.
J.F. Peyre: Résolution Paramétrée de Systèmes Linéaires. Application au Calcul d'Invariants et à la Génération de Code Parallèle. Thèse de l'Université Paris 6, March 1993 (in French).
M. Minoux, K. Barkaoui: Deadlocks and Traps in Petri Nets as Horn-Satisfiability Solutions and some Related Polynomially Solvable Problems. Discrete Applied Mathematics nℴ 29, 1990.
J. Vautherin: Parallel Systems Specifications with Coloured Petri Nets and Algebraic Specifications. In Advances in Petri Nets 1987, Springer-Verlag, 1987, pp 293–308.
G. Findlow: Obtaining Deadlock-Preserving Skeletons for Coloured Nets, in Application and Theory of Petri Nets 92, Proc. of the 13th Conference, K. Jensen ed., LNCS nℴ 616, Springer-Verlag, Sheffield, UK, 1992, pp 173–192.
D.B. Johnson: Finding all Elementary Circuits of a Directed Graph, SIAM J.Computer, vol.4, nℴ 1, 1975.
S. Haddad: A Reduction Theory for Coloured Nets. In High-level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg eds., Springer-Verlag, 1991, pp 399–425.
G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: Stochastic Well-Formed Nets and Symmetric Modeling Applications, to appear in IEEE Transactions on Computers.
J.M. Bernard, J.L. Mounier, N. Beldiceanu, S. Haddad: AMI an Extensible Petri Net Interactive Workshop, Proc. of the 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy, June 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barkaoui, K., Dutheillet, C., Haddad, S. (1993). An efficient algorithm for finding structural deadlocks in colored Petri nets. In: Ajmone Marsan, M. (eds) Application and Theory of Petri Nets 1993. ICATPN 1993. Lecture Notes in Computer Science, vol 691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56863-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-56863-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56863-6
Online ISBN: 978-3-540-47759-4
eBook Packages: Springer Book Archive