On nonconflicting languages that arise in supervisory control of discrete event systems

DOI10.1016/0167-6911(91)90035-DzbMath0747.93004MaRDI QIDQ1186853

Stéphane Lafortune, Enke Chen

Publication date: 28 June 1992

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

supervisory controldiscrete event systemsnonconflicting sublanguages

Mathematics Subject Classification ID

General systems (93A10)

Related Items (5)

Robust nonblocking supervisory control of discrete-event systems under partial observation ⋮ On tolerable and desirable behaviors in supervisory control of discrete event systems ⋮ Logical models of discrete even systems: a comparative exposition ⋮ Distributed computation of supremal conditionally controllable sublanguages ⋮ Supervisory control using augmented languages in discrete event systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formulas for calculating supremal controllable and normal sublanguages
• On observability of discrete-event systems
• Modular supervisory control of discrete-event systems
• The infimal closed controllable superlanguage and its application in supervisory control
• Supervisory Control of a Class of Discrete Event Processes

This page was built for publication: On nonconflicting languages that arise in supervisory control of discrete event systems