Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets

DOI10.1016/j.automatica.2020.109430zbMath1461.93316OpenAlexW3119803127MaRDI QIDQ2663929

Arun Raman, Ramavarapu S. Sreenivas

Publication date: 20 April 2021

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2020.109430

zbMATH Keywords

supervisory controldiscrete-event systemsPetri netsfault-tolerant systemsdiscrete-event dynamic systemsdeadlock

Mathematics Subject Classification ID

Controllability (93B05) Discrete event control/observation systems (93C65) Mathematical modeling or simulation for problems pertaining to systems and control theory (93-10)

Cites Work

• Unnamed Item
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• Closed-loop live marked graphs under generalized mutual exclusion constraint enforcement
• A sufficient condition for the liveness of weighted event graphs
• Robustness of deadlock avoidance algorithms for sequential processes.
• A branch and bound approach for the design of decentralized supervisors in Petri net models
• On a Sufficient Information Structure for Supervisory Policies That Enforce Liveness in a Class of General Petri Nets
• On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets
• Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
• On the Existence of Supervisory Policies That Enforce Liveness in Partially Controlled Free-Choice Petri Nets
• Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
• On Liveness Enforcing Supervisory Policies for Arbitrary Petri Nets

This page was built for publication: Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets