The following pages link to A survey of siphons in Petri nets (Q2279728):
Displaying 12 items.
- Robust deadlock control of automated manufacturing systems with multiple unreliable resources (Q2004755) (← links)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
- An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems (Q2127112) (← links)
- Deadlock analysis and control using Petri net decomposition techniques (Q2212081) (← links)
- A Petri net approach to consensus in networks with joint-agent interactions (Q2280958) (← links)
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition (Q2293269) (← links)
- One novel and optimal deadlock recovery policy for flexible manufacturing systems using iterative control transitions strategy (Q2298487) (← links)
- A multistep look-ahead deadlock avoidance policy for automated manufacturing systems (Q2314759) (← links)
- Symbolic and Structural Model-Checking (Q5025068) (← links)
- Deadlock and Collision Avoidance in Railway Networks with Dynamic Routing: A Petri Net Approach with Partial Controllability and Observability (Q5054378) (← links)
- Structural Reductions Revisited (Q5100759) (← links)
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)
