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 …

We study the cost-optimal reachability problem for weighted timed automata such that
positive and negative costs are allowed on edges and locations. By optimality, we mean an …

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 this paper, we strengthen two recent undecidability results about weighted timed
automata, an extension of timed automata with cost variables. More precisely, we propose …

In this paper, we show how to apply recent tools for the automatic synthesis of robust and
near-optimal controllers for a real industrial case study. We show how to use three different …

We consider dynamic route planning for a fleet of Autonomous Mobile Robots (AMRs) doing
fetch and carry tasks on a shared factory floor. In this paper, we propose Stochastic Work …

We consider timed games extended with cost information, and prove computability of the
optimal cost and of ε-optimal memoryless strategies in timed games with one clock. In …

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 …