Supervisory control of deterministic Petri nets with regular specification languages

DOI10.1109/9.481527zbMath0867.93045OpenAlexW2160906685MaRDI QIDQ4876593

Lawrence E. Holloway, Ratnesh Kumar

Publication date: 13 June 1996

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.481527

zbMATH Keywords

algorithmsdiscrete-event systemsregular languageminimally restrictive supervisorsupervisory control theorydeterministic Petri net language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (8)

Controller Synthesis with Highly Simplified Linear Constraints ⋮ Supervision based on place invariants: a survey ⋮ A class of non-deterministic specifications for supervisory control ⋮ Reduction of constraints for controller synthesis based on safe Petri nets ⋮ Solving the Problem of Forbidden States in Discrete Event Systems: A Novel Systematic Method for Reducing the Number of Control Places ⋮ Structural optimal control for safe Petri nets ⋮ Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm ⋮ Grafcet: behavioural issues and control synthesis

This page was built for publication: Supervisory control of deterministic Petri nets with regular specification languages