A characterization of realizable behavior in supervisory control of timed event graphs (Q1129729)
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 1192944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of realizable behavior in supervisory control of timed event graphs |
scientific article; zbMATH DE number 1192944 |
Statements
A characterization of realizable behavior in supervisory control of timed event graphs (English)
0 references
20 August 1998
0 references
The author studies supervisory control of timed event graphs in the max-algebra framework. He addresses a control problem which requires that the behavior of the supervised system equals the specification set. A necessary and sufficient condition (called strong controllability condition) for the existence of a control input set to solve the problem is presented. Moreover, the author derives a necessary and sufficient condition for the supremal strongly controllable subset to be nonempty under the assumption that the desirable behavior is specified by the upper time bound sequence.
0 references
discrete event system
0 references
supervisory control
0 references
timed event graphs
0 references
max-algebra
0 references
strong controllability
0 references
supremal strongly controllable subset
0 references
0 references
0 references
0.8845019340515137
0 references
0.8375527262687683
0 references
0.8113845586776733
0 references
