On controlling timed discrete event systems
This paper is a survey of our work on controlling discrete event systems modelled by timed event graphs. Such systems are structurally related to finite state machines in that both can be described by linear equations over an appropriate algebra. Using this structural similarity, we have extended supervisory control techniques developed for untimed DES to the timed case. When behavioral constraints are given as a range of acceptable schedules, it is possible to compute an extremal controllable subset or superset of the desired behavior. When constraints are expressed in terms of minimum separation times between events, it is possible to determine whether there is a controllable schedule which realizes the desired behavior.
Unable to display preview. Download preview PDF.
- 1.A. V. Aho, J. E. Hopcroft, J. D. Ullman (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley.Google Scholar
- 2.F. Baccelli, G. Cohen, G. J. Olsder, J. P. Quadrat (1992), Synchronization and Linearity, Wiley, New York.Google Scholar
- 3.D. D. Cofer (1995), Control and Analysis of Real-time Discrete Event Systems, Ph.D. Thesis, Dept. of Elec. & Comp. Eng., The University of Texas at Austin.Google Scholar
- 4.D. D. Cofer, V. K. Garg (1994), 'supervisory control of timed event graphs,’ in Proc. 1994 IEEE Conf. on Sys, Man & Cyb., San Antonio, 994–999.Google Scholar
- 5.D. D. Cofer, V. K. Garg (1995), 'supervisory control of real-time discrete event systems using lattice theory,’ Proc. 33rd IEEE Conf. Dec. & Ctl., Orlando, 978–983 (also to appear in IEEE Trans. Auto. Ctl., Feb. 1996).Google Scholar
- 7.M. Gondran, M. Minoux (1984), Graphs and Algorithms, Wiley, New York.Google Scholar
- 8.R. Kumar, V. K. Garg (1995), Modeling and Control of Logical Discrete Event Systems, Kluwer.Google Scholar
- 9.R. Kumar, V. K. Garg, S. I. Marcus (1991), ‘On controllability and normality of discrete event dynamical systems,’ Sys. & Ctl. Ltrs, 17 157–168.Google Scholar