This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …

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 …

Abstract (Priced) timed games are two-player quantitative games involving an environment
assumed to be completely antogonistic. Classical analysis consists in the synthesis of …

Quantitative analysis of real-time systems using priced timed automata Page 1 78
communications of the acm | september 2011 | vol. 54 | no. 9 review articles Il lu s t r a t Io n …

In a reachability-time game, players Min and Max choose moves so that the time to reach a
final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler …

In this paper we study one-clock priced timed automata in which prices can grow linearly
(dp/dt= k) or exponentially (dp/dt= kp), with discontinuous updates on edges. We propose …

We consider the model of priced (aka weighted) timed automata, an extension of timed
automata with cost information on both locations and transitions, and we study various …

From Qualitative to Quantitative Analysis of Timed Systems Page 1 From Qualitative to
Quantitative Analysis of Timed Systems Mémoire d’habilitation `a diriger des recherches …

A weighted timed game is a timed game with extra quantitative information representing eg
energy consumption. Optimizing the weight for reaching a target is a natural question, which …

Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of
configurations of priced timed automata where two players take turns to choose transitions in …