Deadlock Prediction: Easy and Difficult Cases
From MaRDI portal
Publication:4158478
DOI10.1137/0207027zbMath0379.68034OpenAlexW2041329792MaRDI QIDQ4158478
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207027
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
The parallel complexity of deadlock detection, Polynomial-time optimal liveness enforcement for guidepath-based transport systems, Analysis of multi-stage open shop processing systems, A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems, Resource Allocation Systems: Some Complexity Results on the S4PR Class, Control of deadlock and blocking for production systems with unreliable workstations