Deadlock prediction in linear systems

  • Zbigniew Suraj
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


The computational complexity of the deadlock prediction problem in linear systems is investigated. An algorithm which solves this problem for linear systems is given. Its complexity is polynomial. The paper contains also an algorithm which solves the deadlock avoidance problem in the systems defined here. The computational complexity of that algorithm is also polynomial.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho A.V., Hopcroft J.E. and Ullman J.: The design and analysis of computer algorithms, Addison-Weseley, Reading, MA, chap. 10.Google Scholar
  2. [2]
    Gold M.: Deadlock prediction: easy and difficult cases, SIAM J. COMPUT., Vol.7, No.3, August 1978, pp.320–336.Google Scholar
  3. [3]
    Habermann A.N.: Prevention of system deadlocks, Comm. of the ACM, Vol.12, No.7, July 1969, pp.373–385.Google Scholar
  4. [4]
    Hansen P.B.: Operating system principles, Prentice-Hall, Englewood Cliffs, NJ, pp.42–49, 124–125.Google Scholar
  5. [5]
    Suraj Z.: Analysis of the deadlock prediction problem using Petri nets (manuscript).Google Scholar
  6. [6]
    Suraj Z.: On certain problem of resource allocation in systems of concurrent programs, ICS PAS Reports 549 (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Zbigniew Suraj
    • 1
  1. 1.Institute of MathematicsPedagogical CollegeRzeszówPoland

Personalised recommendations