Formulas for the extremal controllable sequences in timed-event graphs

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.