A max-algebra solution to the supervisory control problem for real-time discrete event systems
For timed systems the supervisory control problem is to impose delays on controllable events to modify system behavior to meet some specified performance goal. Using the tools of max-algebra it is possible to compute the uncontrolled behavior of a timed event graph, define a specification for some new desired behavior, and determine whether the specification can be realized by any supervisor given the set of controllable events. When the desired behavior cannot be realized (i.e, it is uncontrollable), a minimally restrictive behavior which meets the original specification always exists. All of these concepts have direct analogy in the control of untimed automata.
KeywordsControllable Event Acceptable Behavior Firing Sequence Acceptable Region Time Event Graph
Unable to display preview. Download preview PDF.
- 1.F. Baccelli, G. Cohen, G. J. Olsder, J. P. Quadrat, Synchronization and Linearity, Wiley, New York, 1992.Google Scholar
- 2.D. D. Cofer, V. K. Garg, “A Generalized Max-algebra Model for Timed and Untimed DES,” T. R. SCC-93-02, Dept. of ECE, Univ. of Texas, Austin, 1993.Google Scholar
- 4.B. H. Krogh, “Controlled Petri Nets and Maximally Permissive Feedback Logic,” Proc. 25th Allerton Conf. on Comm., Ctrl. and Comp., Urbana, IL, 1987.Google Scholar