Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait
From MaRDI portal
Publication:2798480
DOI10.1080/00207721.2014.938788zbMath1333.93168OpenAlexW2093524741MaRDI QIDQ2798480
Publication date: 12 April 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2014.938788
Production models (90B30) Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Soundness of workflow nets: classification, decidability, and analysis
- Complexity results for 1-safe nets
- Real-time management of resource allocation systems. A discrete event systems approach.
- A parameterized liveness and ratio-enforcing supervisor for a class of generalized Petri nets
- Controllability of control and mixture weakly dependent siphons in S3PR
- Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
- The Resource Allocation Problem in Flexible Manufacturing Systems
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Understanding Petri Nets
- Necessary and sufficient liveness condition of GS3PR Petri nets
- On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems
This page was built for publication: Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait