@inproceedings{72514beead584bb58bab9d4eb7dd94df,

title = "Staying alive as cheaply as possible",

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

author = "P. Bouyer and E. Brinksma and K.G. Larsen",

year = "2004",

doi = "10.1007/978-3-540-24743-2_14",

language = "English",

isbn = "3-540-21259-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "203--218",

editor = "R. Alur and G.J. Pappas",

booktitle = "Hybrid Systems : Computation and Control ; Proceedings 7th International Workshop HSCC2004, Philadelphia PA, USA, March 25-27, 2004",

address = "Germany",

}