Skip to main content
Conference Proceedings

Deadlock prediction in linear systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 208 LNCS 350-363
DOI: 10.1007/3-540-16066-3_29
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Suraj, Z. (1985). Deadlock prediction in linear systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 208 LNCS, pp. 350–363). Springer Verlag. https://doi.org/10.1007/3-540-16066-3_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free