Optimal infinite scheduling for multi-priced timed automata

Patricia Bouyer*, Ed Brinksma, Kim G. Larsen

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    51 Citations (Scopus)
    49 Downloads (Pure)

    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.
    Original languageEnglish
    Pages (from-to)3-23
    Number of pages21
    JournalFormal methods in system design
    Volume32
    Issue number1
    DOIs
    Publication statusPublished - Feb 2008

    Keywords

    • Priced timed automata
    • Optimal mean-payoff

    Fingerprint

    Dive into the research topics of 'Optimal infinite scheduling for multi-priced timed automata'. Together they form a unique fingerprint.

    Cite this