Deadlock Prediction: Easy and Difficult Cases

DOI10.1137/0207027MaRDI QIDQ4158478zbMATH OpenOpenAlexFDO

Authors E. Mark Gold

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(6)

• The parallel complexity of deadlock detection
• Analysis of multi-stage open shop processing systems
• Polynomial-time optimal liveness enforcement for guidepath-based transport systems
• Resource Allocation Systems: Some Complexity Results on the S4PR Class
• A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
• Control of deadlock and blocking for production systems with unreliable workstations

This page was built for publication: Deadlock Prediction: Easy and Difficult Cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158478)