Infinite Runs in Weighted Timed Automata with Energy Constraints

Abstract : 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 (\emphe.g.~energy). We~ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (\emphe.g.~remains between~\(0\) and some given upper-bound). We~also consider a game version of the above, where certain transitions may be uncontrollable.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Nicolas Markey <>
Submitted on : Monday, September 7, 2015 - 12:02:16 PM
Last modification on : Friday, April 19, 2019 - 5:02:11 PM
Long-term archiving on : Tuesday, December 8, 2015 - 12:01:42 PM


Files produced by the author(s)



Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jiří Srba. Infinite Runs in Weighted Timed Automata with Energy Constraints. Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), 2008, Saint-Malo, France. pp.33-47, ⟨10.1007/978-3-540-85778-5_4⟩. ⟨hal-01194594⟩



Record views


Files downloads