Pages that link to "Item:Q4368693"
From MaRDI portal
The following pages link to Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems (Q4368693):
Displayed 13 items.
- Process completing sequences for resource allocation systems with synchronization (Q446469) (← links)
- Deadlock-free scheduling of an automated manufacturing system using an enhanced colored time resource Petri-net model-based evolutionary endosymbiotic learning automata approach (Q955699) (← links)
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
- Robustness of deadlock avoidance algorithms for sequential processes. (Q1413928) (← links)
- Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets (Q2023184) (← links)
- A multistep look-ahead deadlock avoidance policy for automated manufacturing systems (Q2314759) (← links)
- Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets (Q2642306) (← links)
- Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems (Q2789909) (← links)
- Coloured timed Petri net model for real-time control of automated guided vehicle systems (Q3159662) (← links)
- Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model (Q4443374) (← links)
- Control of deadlock and blocking for production systems with unreliable workstations (Q4706350) (← links)
- Deadlock-free scheduling in flexible manufacturing systems using Petri nets (Q4710088) (← links)
- Deadlock modeling and control of semiconductor track systems using resource-oriented Petri nets (Q5438675) (← links)