Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets

DOI10.1016/j.matcom.2005.11.002zbMath1093.93022OpenAlexW2067598604MaRDI QIDQ2489594

Ramavarapu S. Sreenivas

Publication date: 28 April 2006

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2005.11.002

zbMATH Keywords

Petri netsSupervisory control

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Complexity of some problems in Petri nets
• On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets
• On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets
• Liveness-enforcing supervision of bounded ordinary Petri nets using partial order methods
• Counterexamples to “Liveness-Enforcing Supervision of Bounded Ordinary Petri Nets Using Partial-Order Methods”
• Author's Reply
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets