Infinite Runs in Weighted Timed Automata with Energy Constraints

Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jiri Srba

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

155 Citations (Scopus)

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 (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.
Original languageEnglish
Title of host publication6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08)
Number of pages15
PublisherSpringer
Publication date2008
Pages33-47
ISBN (Print)978-3-540-85777-8
DOIs
Publication statusPublished - 2008
EventInternational Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08) - Saint Malo, France
Duration: 15 Sept 200817 Sept 2008
Conference number: 6

Conference

ConferenceInternational Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08)
Number6
Country/TerritoryFrance
CitySaint Malo
Period15/09/200817/09/2008
SeriesLecture Notes in Computer Science
Number5215
ISSN0302-9743

Keywords

  • weighted automata
  • infinite runs

Fingerprint

Dive into the research topics of 'Infinite Runs in Weighted Timed Automata with Energy Constraints'. Together they form a unique fingerprint.

Cite this