Optimal control for timed automata 1

Abstract Timed automata enrich discrete event systems with quantitative timing information, incorporating information about delays and durations into discrete models. In this paper our previous work on controller synthesis for timed automata, which dealt with qualitative properties such as avoidance of forbidden states, is extended to the following problem: given a timed game automaton, find a strategy (=controller) which brings it to a desired set of stales as fast as possible.

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

[2]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[3]  H. Wong-Toi,et al.  The synthesis of controllers for linear hybrid automata , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[4]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[5]  John Lygeros,et al.  Synthesizing Controllers for Nonlinear Hybrid Systems , 1998, HSCC.