Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"

DOI10.1109/9.917717MaRDI QIDQ4540370zbMATH OpenOpenAlexFDO

Authors Jong Hun Park, Mark A. Lawley, P. M. Ferreira, Spyros Reveliotis

Publication date 21 July 2002

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.917717

Mathematics Subject Classification ID

Production models (90B30) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)

Recommendations

• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation
• Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
• On the optimality of randomized deadlock avoidance policies
• Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case
• Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks

Cited in

(3)

• A multistep look-ahead deadlock avoidance policy for automated manufacturing systems
• On the ``counter-example in the article ``Max-controlled siphons for liveness of \(S^3PGR^2\) regarding the results in ``Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems

This page was built for publication: Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"

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