A characterization of realizable behavior in supervisory control of timed event graphs (Q1129729)

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.