Control synthesis for discrete event systems

From MaRDI portal





The author investigates supervisory control of problem decomposition and he describes some of the computational aspects of the monolithic subproblems that such a decomposition yields. The paper considers algorithms for the synthesis of supervisory control observations in the case where all pertinent formal languages are represented by finite automata. The main section of the paper gives an overview of discrete event control synthesis in the case of complete observations, introducing the \(\mu\)-calculus and illustrating its use in control. Finally, the author discusses related work on formal synthesis and verification of computer systems, and applications to control synthesis for hybrid systems with simple dynamics, namely, timed discrete-event systems. For the entire collection see [Zbl 0911.00015].




Cited in
(24)








This page was built for publication: Control synthesis for discrete event systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240486)