Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
From MaRDI portal
Publication:4368693
Recommendations
- Generalized Algebraic 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
- 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
- On the optimality of randomized deadlock avoidance policies
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
Cited in
(23)- Optimal linear separation of the safe and unsafe subspaces of sequential resource allocation systems as a set-covering problem: algorithmic procedures and geometric insights
- Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets
- Deadlock-free scheduling of an automated manufacturing system using an enhanced colored time resource Petri-net model-based evolutionary endosymbiotic learning automata approach
- A multistep look-ahead deadlock avoidance policy for automated manufacturing systems
- Control of deadlock and blocking for production systems with unreliable workstations
- Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
- Real-time management of resource allocation systems. A discrete event systems approach.
- Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model
- On deadlocks of exclusive AND-requests for resources
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- Deadlock modeling and control of semiconductor track systems using resource-oriented Petri nets
- 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
- Deadlock-free scheduling in flexible manufacturing systems using Petri nets
- Process completing sequences for resource allocation systems with synchronization
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
- Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
- Design of a maximally permissive liveness-enforcing supervisor with reduced complexity for automated manufacturing systems
- On the optimality of randomized deadlock avoidance policies
- Coloured timed Petri net model for real-time control of automated guided vehicle 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: 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 Q4368693)
