Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
From MaRDI portal
Publication:3063811
DOI10.1080/00207720903171779zbMath1202.90120OpenAlexW2040680386MaRDI QIDQ3063811
Publication date: 15 December 2010
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903171779
Mixed integer programming (90C11) Production models (90B30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (13)
Min-plus realizable control design for partially observable timed event graphs under marking constraints ⋮ Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors ⋮ Recursive solution of number of reachable states of a simple subclass of FMS ⋮ Extended Elementary Siphons and Their Application to Liveness‐Enforcement of Generalized <scp>P</scp>etri Nets ⋮ State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints ⋮ 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 ⋮ Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait ⋮ A suboptimal deadlock control policy for designing non-blocking supervisors in flexible manufacturing systems ⋮ An efficient siphon-based deadlock prevention policy for a class of generalized 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 ⋮ Controllability of control and mixture weakly dependent siphons in S3PR
Uses Software
Cites Work
- On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems
- A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Estimation of the firing frequencies in discrete and continuous Petri nets models
- Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources
This page was built for publication: Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming