Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

DOI10.1109/TAC.2007.910701MaRDI QIDQ5282318zbMATH OpenOpenAlexFDO

Authors Elzbieta Roszkowska, Jin Young Choi, Spyros Reveliotis

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
• Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation
• 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 Linear Case
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case
• Algorithms for deadlock avoidance and reversibility enforcement in discrete event systems
• On the optimality of randomized deadlock avoidance policies
• Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
• Deadlock control for a class of generalized Petri nets based on proper resource allocation

Cited in

(8)

• Robustness of deadlock avoidance algorithms for sequential processes.
• Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
• Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs
• Performance optimization for a class of generalized stochastic Petri nets
• Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets
• On structural minimality of optimal supervisors for flexible manufacturing systems
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"

This page was built for publication: Generalized Algebraic 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 Q5282318)