Title :
Formulas for the extremal controllable sequences in timed-event graphs
Author :
Takai, Shigemasa ; Kodama, Shinzo
Author_Institution :
Dept. of Electron. Eng., Osaka Univ., Japan
fDate :
10/1/1998 12:00:00 AM
Abstract :
This paper studies controllable sequences in the max-algebra model of timed event graphs. We present a formula for the supremal controllable sequence when a desirable behavior is specified as a single sequence. As a result, the supremal sequence can be computed without iterative computation. A formula for the infimal controllable sequence is also obtained under some assumptions
Keywords :
algebra; discrete event systems; graph theory; optimisation; discrete event systems; extremal controllable sequences; infimal controllable sequence; max-algebra model; supervisory control; supremal sequence; timed-event graphs; Automatic control; Control systems; Discrete event systems; Equations; Linear systems; Petri nets; Polynomials; Robust stability; Robustness; Supervisory control;
Journal_Title :
Automatic Control, IEEE Transactions on
