OPTIMAL CONTROL FOR TIMED AUTOMATA

摘要

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 states as fast as possible.