Staying alive as cheaply as possible

P. Bouyer, E. Brinksma, K.G. Larsen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    51 Citations (Scopus)


    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.
    Original languageEnglish
    Title of host publicationHybrid Systems : Computation and Control ; Proceedings 7th International Workshop HSCC2004, Philadelphia PA, USA, March 25-27, 2004
    EditorsR. Alur, G.J. Pappas
    ISBN (Print)3-540-21259-0
    Publication statusPublished - 2004

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    Dive into the research topics of 'Staying alive as cheaply as possible'. Together they form a unique fingerprint.

    Cite this