An efficient algorithm for finding structural deadlocks in colored petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 691 LNCS, Issue , 1993, Pages 69-88

  Barkaoui, K ^a   Dutheillet, C ^b   Haddad, S ^b  

^a Bioinformatique et Chimie Moléculaire   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PETRI NETS; PHILOSOPHICAL ASPECTS;

CLASSICAL APPROACH; COLOR DOMAINS; COLORED NETS; COLORED PETRI NETS; DINING PHILOSOPHERS PROBLEM; ITERATIVE OPTIMIZATION; META RULES;

ITERATIVE METHODS;

EID: 84983230300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56863-8_41     Document Type: Conference Paper

References (21)

1. W. Reisig: Place-Transition Systems. In Petri Nets: Central models and their properties, W. Brauer, W. Reisig and G. Rozenberg eds., LNCS no 254, Springer-Verlag, 1987, pp 117–141.
2. E. W. Mayr: An Algorithm for the General Petri Net Reachability Problem. In SIAM. Journal of Computing no 13, 1984.
3. 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 no 254, Springer-Verlag, 1986, pp 168–205.
4. J. Martinez, M. Silva: A Simple and Fast Algorithm to Obtain all Invariants of a Generalized Petri Net. In Informatik Fachberichte no 52, C. Girault and W. Reisig eds., Springer-Verlag, 1982, pp 301–310.
5. 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 no 254, Springer-Verlag, 1986, pp 142–167.
6. F. Commoner: Deadlocks in Petri nets. In Applied Data Res. Inc., Wakefield, MA, 1972.
7. 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.
8. 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.
9. 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 no 616, Springer-Verlag, Sheffield, UK, 1992, pp 62–74.
10. 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.
11. 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.
12. 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.
13. 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.
14. 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).
15. M. Minoux, K. Barkaoui: Deadlocks and Traps in Petri Nets as Horn-Satisfiability Solutions and some Related Polynomially Solvable Problems. Discrete Applied Mathematics no 29, 1990.
16. J. Vautherin: Parallel Systems Specifications with Coloured Petri Nets and Algebraic Specifications. In Advances in Petri Nets 1987, Springer-Verlag, 1987, pp 293–308.
17. 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 no 616, Springer-Verlag, Sheffield, UK, 1992, pp 173–192.
18. D. B. Johnson: Finding all Elementary Circuits of a Directed Graph, SIAM J. Computer, vol. 4, no 1, 1975.
19. 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.
20. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: Stochastic Well-Formed Nets and Symmetric Modeling Applications, to appear in IEEE Transactions on Computers.
21. 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.