Distributed computation of supremal conditionally controllable sublanguages

DOI10.1080/00207179.2015.1079736zbMath1332.93259OpenAlexW2219877619MaRDI QIDQ2792732

Jan Komenda, Tomáš Masopust

Publication date: 14 March 2016

Published in: International Journal of Control (Search for Journal in Brave)

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

zbMATH Keywords

supervisory controldiscrete-event systemscoordination control

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)

Cites Work

• Unnamed Item
• Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
• On nonconflicting languages that arise in supervisory control of discrete event systems
• PSPACE-completeness of modular supervisory control problems
• On conditional decomposability
• Supervisory control synthesis of discrete-event systems using a coordination scheme
• Coordination control of discrete-event systems revisited
• Supervisory control of modular systems with global specification languages
• Introduction to Discrete Event Systems
• Verification of Nonconflict of Supervisors Using Abstractions

This page was built for publication: Distributed computation of supremal conditionally controllable sublanguages