Skip to main content
SpringerLink
Log in

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

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1993 (ICATPN 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 691))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. F. Bause and P. Kemper. QPN-Tool Version 1.0 User's Guide. Universität Dortmund, LS Informatik 4, 1991.

    Google Scholar 

  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. J. Esparza. Minimal deadlocks in free choice nets. Hildesheimer Informatikberichte 1/89, Universität Hildesheim, Institut für Informatik, 1989.

    Google Scholar 

  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. M.H.T. Hack. Analysis of production schemata by petri nets. Technical Report TR-94, MIT, Boston, 1972 corrected 1974.

    Google Scholar 

  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. 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. 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. R. Tarjan. Depth-first search and linear graph algorithms. In SIAM. Jour. Comput, volume 1, pages 146–160. 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik IV, Universität Dortmund, Postfach 50 05 00, 4600, Dortmund 50, Germany

    Peter Kemper

Authors
  1. Peter Kemper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marco Ajmone Marsan

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kemper, P. (1993). Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net. 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_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-56863-8_54

  • 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

Publish with us

Policies and ethics

Search

Navigation