Control synthesis for discrete event systems (Q4240486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1284133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Control synthesis for discrete event systems |
scientific article; zbMATH DE number 1284133 |
Statements
15 September 1999
0 references
monolithic synthesis
0 references
\(\mu\)-calculus
0 references
supervisory control
0 references
problem decomposition
0 references
discrete event control synthesis
0 references
hybrid systems
0 references
0.888226330280304
0 references
0.8559622764587402
0 references
0.8461100459098816
0 references
Control synthesis for discrete event systems (English)
0 references
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].
0 references
