Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
From MaRDI portal
Publication:4368693
DOI10.1109/9.633824zbMath0892.90093OpenAlexW2150974097MaRDI QIDQ4368693
Mark A. Lawley, Placid M. Ferreira, Spiridon A. Reveliotis
Publication date: 4 December 1997
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.633824
sequential resource allocationdeadlock avoidance policieslarge-scale flexibly automated manufacturing systems
Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Related Items (13)
Coloured timed Petri net model for real-time control of automated guided vehicle systems ⋮ Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets ⋮ Robustness of deadlock avoidance algorithms for sequential processes. ⋮ Process completing sequences for resource allocation systems with synchronization ⋮ Deadlock-free scheduling of an automated manufacturing system using an enhanced colored time resource Petri-net model-based evolutionary endosymbiotic learning automata approach ⋮ Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming ⋮ Deadlock modeling and control of semiconductor track systems using resource-oriented Petri nets ⋮ Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets ⋮ Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems ⋮ Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model ⋮ Control of deadlock and blocking for production systems with unreliable workstations ⋮ Deadlock-free scheduling in flexible manufacturing systems using Petri nets ⋮ A multistep look-ahead deadlock avoidance policy for automated manufacturing systems
This page was built for publication: Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
