论文信息 - Formulas for the extremal controllable sequences in timed-event graphs

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.

Shigemasa Takai | Shinzo Kodama

[1] J. Loiseau,et al. Admissible initial conditions and control of timed event graphs , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[2] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .

[3] Vijay K. Garg,et al. Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control , 1995, Theor. Comput. Sci..

[4] V.K. Garg,et al. Control of event separation times in discrete event systems , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[5] J. Quadrat,et al. A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[6] P. Ramadge,et al. On the supermal controllable sublanguage of a given language , 1987 .

[7] J. Quadrat,et al. Algebraic tools for the performance evaluation of discrete event systems , 1989, Proc. IEEE.

[8] Shigemasa Takai,et al. A characterization of realizable behavior in supervisory control of timed event graphs , 1997, Autom..

[9] V. Garg,et al. Supervisory control of real-time discrete-event systems using lattice theory , 1996, IEEE Trans. Autom. Control..

[10] Geert Jan Olsder,et al. Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[11] Darren D. Cofer. Control and analysis of real-time discrete event systems , 1995 .