Optimal infinite scheduling for multi-priced timed automata

Patricia Bouyer, Ed Brinksma, Kim G. Larsen
2007 Formal methods in system design  
This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for
more » ... such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules.
doi:10.1007/s10703-007-0043-4 fatcat:wxhauegqvbd3tkqpvrwsxz2nfa