Avoiding deadlocks via weak deadlock sets

DOI10.1002/NET.22275MaRDI QIDQ6971577zbMATH OpenFDO

Authors Gianpaolo Oriolo, Anna Russo Russo

Publication date 13 June 2025

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22275

zbMATH Keywords

bound to deadlock statecomplexity analysisdeadlockdeadlock-avoidance algorithmtrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Cites work

• DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
• Easy cases of deadlock detection in train scheduling
• scientific article; zbMATH DE number 1760003 (Why is no real title available?)
• scientific article; zbMATH DE number 3359777 (Why is no real title available?)
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Predicting deadlock in store‐and‐forward networks
• Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks

This page was built for publication: Avoiding deadlocks via weak deadlock sets

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