Advertisement

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

  • Peter Kemper
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 691)

Abstract

This paper presents an improved algorithm compared to the one given in [7], which finds a minimal deadlock containing a given place p in a strongly connected Free-Choice net (FC-net). Its worst case time complexity is linear in the size of the net. The interest in finding such deadlocks arises from recognising structurally live and bounded FC-nets (LBFC-nets), where finding structural deadlocks efficiently is crucial for the algorithm's time complexity. Employing this new algorithm within

Keywords

Time Complexity Input Transition Recursive Call Input Place Strong Connectedness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 2.
    F. Bause and P. Kemper. QPN-Tool Version 1.0 User's Guide. Universität Dortmund, LS Informatik 4, 1991.Google Scholar
  3. 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.Google Scholar
  4. 4.
    J. Esparza. Minimal deadlocks in free choice nets. Hildesheimer Informatikberichte 1/89, Universität Hildesheim, Institut für Informatik, 1989.Google Scholar
  5. 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.Google Scholar
  6. 6.
    M.H.T. Hack. Analysis of production schemata by petri nets. Technical Report TR-94, MIT, Boston, 1972 corrected 1974.Google Scholar
  7. 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.Google Scholar
  8. 8.
    K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer, Berlin Heidelberg, 1984.Google Scholar
  9. 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.Google Scholar
  10. 10.
    R. Tarjan. Depth-first search and linear graph algorithms. In SIAM. Jour. Comput, volume 1, pages 146–160. 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Peter Kemper
    • 1
  1. 1.Informatik IVUniversität DortmundDortmund 50Germany

Personalised recommendations