Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
From MaRDI portal
Publication:2293269
DOI10.1016/j.ins.2017.05.011zbMath1429.68150OpenAlexW2613548800MaRDI QIDQ2293269
Dan You, ShouGuang Wang, Meng Chu Zhou
Publication date: 7 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.05.011
Petri netspolynomial complexityproblem decompositiondeadlockdiscrete event systems (DES)siphon computation
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm to compute the minimal siphons in \(S^4 PR\) nets
- Robust deadlock control for automated manufacturing systems with an unreliable resource
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- A survey of siphons in Petri nets
- Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs
- Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm
- Deadlock recovery for flexible manufacturing systems modeled with Petri nets
- A suboptimal deadlock control policy for designing non-blocking supervisors in flexible manufacturing systems
- Deadlock prevention policy based on Petri nets and siphons
- New Algorithms for Deciding the Siphon-Trap Property
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- On liveness and controlled siphons in Petri nets
- An Improved Algorithm for Siphons and Minimal Siphons in Petri Nets Based on Semi-tensor Product of Matrices
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
