Optimal infinite scheduling for multi-priced timed automata

Abstract. 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 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 ing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules.

• Type: Journal
• Year: 2008
• Where: FMSD
• Authors: Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen
• Keywords: Double-priced Timed Automata, FMSD 2008, Optimal Infinite Behaviours, Optimal Non-terminating Schedules