Deadlock and liveness characterization for a class of generalized Petri nets
From MaRDI portal
Publication:780961
DOI10.1016/j.ins.2017.08.014zbMath1436.90041OpenAlexW2749429672MaRDI QIDQ780961
Ting Qu, Ding Liu, ShouGuang Wang, Abdulrahman Al-Ahmari, NaiQi Wu, Miao Liu, Zhiwu Li, Meng Chu Zhou
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.08.014
Production models (90B30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
An improved approach for marking optimization of timed weighted marked graphs ⋮ Inference approach based on Petri nets
Cites Work
- Comments on ``Liveness of an extended \(\operatorname{S}^3 \operatorname{PR}\), [automatica 46 (2010) 1008-1018]
- Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
- Petri net-based approach to short-term scheduling of crude oil operations with less tank requirement
- Liveness of an extended S\(^{3}\)PR
- Analysis of deadlock and circular waits using a matrix model for flexible manufacturing systems
- A novel method for deadlock prevention of AMS by using resource-oriented Petri nets
- Deadlock recovery for flexible manufacturing systems modeled with Petri nets
- On the Equivalence of Observation Structures for Petri Net Generators
- Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints
- Integer Programming with a Fixed Number of Variables
- The Resource Allocation Problem in Flexible Manufacturing Systems
- On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- On liveness and controlled siphons in Petri nets
- Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
- Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations
- Verification of State-Based Opacity Using Petri Nets
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Deadlock and liveness characterization for a class of generalized Petri nets
