On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems

DOI10.1080/00207721.2013.783946zbMath1317.93175OpenAlexW2076993150MaRDI QIDQ5265607

Daniel Yuh Chao

Publication date: 28 July 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2013.783946

zbMATH Keywords

Petri netdeadlock preventionflexible manufacturing system (FMS)

Mathematics Subject Classification ID

Production models (90B30) Application models in control theory (93C95) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Related Items

Complexity of the deadlock problem for Petri nets modeling resource allocation systems ⋮ Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait ⋮ Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems ⋮ Necessary and sufficient liveness condition of GS³PR Petri nets

Cites Work

• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• Controllability of control and mixture weakly dependent siphons in S³PR
• Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
• Feedback control designs for manufacturing systems modelled by continuous Petri nets
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case
• Refining and verifying regular Petri nets