Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation

DOI10.1109/TAC.2020.3024480zbMATH Open1471.93175OpenAlexW3197552274MaRDI QIDQ4957686FDOQ4957686

Authors: Michael Nawar Ibrahim, Ahmed Nazeem, Spyros Reveliotis 

Publication date: 9 September 2021

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

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

zbMATH Keywords

sequential resource allocation systemsalgebraic deadlock avoidance policiesliveness-enforcing supervision

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Computational methods for problems pertaining to systems and control theory (93-08)

Cited In (4)

• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
• Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"
• Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

This page was built for publication: Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation

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