This contribution reports on the considerable effort made recently towards extending and
applying well-established timed automata technology to optimal scheduling and planning …

Priced timed (game) automata extend timed (game) automata with costs on both locations
and transitions. In this paper we focus on reachability priced timed game automata and …

This contribution reports on the considerable effort made recently towards extending and
applying well-established timed automata technology to optimal scheduling and planning …

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

In this paper, we study energy and mean-payoff timed games. The decision problems that
consist in determining the existence of winning strategies in those games are undecidable …

Energy efficiency and energy savings are urging and intensively discussed topics in the
domain of industry automation because of environmental, social and legal reasons [5] …

A scheduler is an algorithm that assigns at any time a set of processes to a set of processors.
Processes usually interact with each other, which introduces dependencies amongst them …

The main result of this paper is that computing the value of a one-clock priced timed game
(OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an …

Timed automata are finite automata accompanied by a finite set of real-valued variables
called clocks. Optimisation problems on timed automata are fundamental to the verification …

Verification and Performance Analysis for Embedded Systems Page 1 Verification and
Performance Analysis for Embedded Systems Kim Guldstrand Larsen Aalborg University …