Lower-Bound Constrained Runs in Weighted Timed Automata

We investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-constrained run is -- for us somewhat unexpected...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 Ninth International Conference on Quantitative Evaluation of Systems s. 128 - 137
Hlavní autoři: Bouyer, P., Larsen, K. G., Markey, N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2012
Témata:
Clocks
Cost accounting
Delay
energy constraints
Energy states
Schedules
Turing machines
Weighted timed automata
ISBN:9781467323468, 1467323462
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-constrained run is -- for us somewhat unexpectedly -- undecidable for weighted timed automata with four or more clocks. This undecidability result assumes a fixed and known initial credit. We show that the related problem of existence of an initial credit for which there exists a feasible run is decidable in PSPACE. We also investigate the variant of these problems where only bounded-duration runs are considered, showing that this restriction makes our original problem decidable in NEXPTIME. Finally, we prove that the universal versions of all those problems(i.e, checking that all the considered runs satisfy the lower-bound constraint) are decidable in PSPACE.
ISBN:9781467323468
1467323462
DOI:10.1109/QEST.2012.28