Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
From MaRDI portal
Publication:4368693
DOI10.1109/9.633824zbMath0892.90093MaRDI 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 allocation; deadlock avoidance policies; large-scale flexibly automated manufacturing systems
90C90: Applications of mathematical programming
90C60: Abstract computational complexity for mathematical programming problems
90B30: Production models
Related Items
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, Deadlock modeling and control of semiconductor track systems using resource-oriented Petri nets, 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, Robustness of deadlock avoidance algorithms for sequential processes., A multistep look-ahead deadlock avoidance policy for automated manufacturing systems, Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets, Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems, Coloured timed Petri net model for real-time control of automated guided vehicle systems
