Pages that link to "Item:Q2279727"
From MaRDI portal
The following pages link to Complexity of the deadlock problem for Petri nets modeling resource allocation systems (Q2279727):
Displaying 6 items.
- Process completing sequences for resource allocation systems with synchronization (Q446469) (← links)
- High-level Petri-net model for a resource-sharing problem (Q918729) (← links)
- Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions (Q2224835) (← links)
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition (Q2293269) (← links)
- Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems (Q4368693) (← links)
- Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs (Q4575107) (← links)