This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of
timed automata implemented in the tool, to present its interface, and to explain how to use …

This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavour
of timed automata implemented in the tool, to present its interface, and to explain how to use …

This tutorial paper surveys the main features of Uppaal SMC, a model checking approach in
Uppaal family that allows us to reason on networks of complex real-timed systems with a …

The control of complex systems poses new challenges that fall beyond the traditional
methods of control theory. One of these challenges is given by the need to control …

This paper offers a survey of uppaalsmc, a major extension of the real-time verification tool
uppaal. uppaalsmc allows for the efficient analysis of performance properties of networks of …

We consider an optimal-reachability problem for a timed automaton with respect to a linear
cost function which results in a weighted timed automaton. Our solution to this optimization …

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 …

This paper offers a natural stochastic semantics of Networks of Priced Timed Automata
(NPTA) based on races between components. The semantics provides the basis for …

In this work, we present timed automata as a natural tool for posing and solving scheduling
problems. We show how efficient shortest path algorithms for timed automata can find …

Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour
incorporates both probabilistic and real-time characteristics. Applications include wireless …