Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net

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

Volumn 691 LNCS, Issue , 1993, Pages 319-338

  Kemper, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; PETRI NETS;

COMPLEXITY OF ALGORITHM; LINEAR-TIME ALGORITHMS; LOWER LIMITS; MATRIX RANK; RANK THEOREM; STRONGLY CONNECTED; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

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

References (10)

1. K. Barkaoui and M. Minoux. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded petri nets. In K. Jensen, editor, Application and Theory of Petri Nets 1992, LNCS 616, pages 62–75, Berlin Heidelberg, 1992. Springer.
2. F. Bause and P. Kemper. QPN-Tool Version 1.0 User's Guide. Universität Dortmund, LS Informatik 4, 1991.
3. E. Best and M.W. Shields. Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets. In CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, LNCS 159, pages 141–154, Berlin Heidelberg, 1983. Springer.
4. J. Esparza. Minimal deadlocks in free choice nets. Hildesheimer Informatikberichte 1/89, Universität Hildesheim, Institut für Informatik, 1989.
5. J. Esparza. Synthesis rules for petri nets, and how they lead to new results. In J.C.M. Baeten and J.W. Klop, editors, Concur '90, LNCS 458, pages 182–198, Berlin Heidelberg, 1990. Springer.
6. M.H.T. Hack. Analysis of production schemata by petri nets. Technical Report TR-94, MIT, Boston, 1972 corrected 1974.
7. P. Kemper and F. Bause. An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets. In K. Jensen, editor, Application and Theory of Petri Nets 1992, LNCS 616, pages 263–278, Berlin Heidelberg, 1992. Springer.
8. K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer, Berlin Heidelberg, 1984.
9. M. Minoux and K. Barkaoui. Polynomial algorithm for finding deadlocks, traps and other substructures relevant to petri net analysis. Technical Report 212, Laboratoire MASI, Université P. et M. Curie, Paris, 1988.
10. R. Tarjan. Depth-first search and linear graph algorithms. In SIAM. Jour. Comput, volume 1, pages 146–160. 1972.