Minoura, Toshimi Deadlock avoidance revisited. (English) Zbl 0489.68039 J. Assoc. Comput. Mach. 29, 1023-1048 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68W99 Algorithms in computer science 68M20 Performance evaluation, queueing, and scheduling in the context of computer systems 68N25 Theory of operating systems Keywords:wait-for relations; deadlock avoidance in operating systems; deadlock- prediction problem for a set of processes using locks; NP-complete problem; deadlock-avoidance problem for processes with branches; PSPACE- complete PDF BibTeX XML Cite \textit{T. Minoura}, J. Assoc. Comput. Mach. 29, 1023--1048 (1982; Zbl 0489.68039) Full Text: DOI OpenURL