Other formats:
BibTeX
LaTeX
RIS
@inproceedings{780196,
author = {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim G. and Markey, Nicolas and Srba, Jiří},
address = {Netherlands},
booktitle = {Proceedings of Formal Modeling and Analysis of Timed Systems (FORMATS'08), Lecture Notes in Computer Science 5215},
keywords = {timed automata; infinite runs; decidability; complexity},
language = {eng},
location = {Netherlands},
isbn = {978-3-540-85777-8},
pages = {33-47},
publisher = {Springer-Verlag},
title = {Infinite Runs in Weighted Timed Automata with Energy Constraints},
year = {2008}
}
TY - JOUR
ID - 780196
AU - Bouyer, Patricia - Fahrenberg, Uli - Larsen, Kim G. - Markey, Nicolas - Srba, Jiří
PY - 2008
TI - Infinite Runs in Weighted Timed Automata with Energy Constraints
PB - Springer-Verlag
CY - Netherlands
SN - 9783540857778
KW - timed automata
KW - infinite runs
KW - decidability
KW - complexity
N2 - We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (e.g. energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g. remains between 0 and some given upper-bound). We also consider a game version of the above, where certain transitions may be uncontrollable.
ER -
BOUYER, Patricia, Uli FAHRENBERG, Kim G. LARSEN, Nicolas MARKEY and Jiří SRBA. Infinite Runs in Weighted Timed Automata with Energy Constraints. In \textit{Proceedings of Formal Modeling and Analysis of Timed Systems (FORMATS'08), Lecture Notes in Computer Science 5215}. Netherlands: Springer-Verlag, 2008, p.~33-47. ISBN~978-3-540-85777-8.
|
