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 …

Timed automata are a popular formalism to model real-time systems. They were introduced
two decades ago to support formal verification. Since then they have also been used for …

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

Hybrid systems are models which combine discrete and continuous behavior. They occur
frequently in safety-critical applications in various domains such as health care …

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 …

Timed automata are frequently used to model real-time systems. Their determinization is a
key issue for several validation problems. However, not all timed automata can be …

We present an algorithm to learn a deterministic timed automaton (DTA) via membership
and equivalence queries. Our algorithm is an extension of the L* algorithm with a Myhill …

Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the
last decades, timed automata have become the de facto model for the verification of real …

We discuss model-checking problems as formal models of algorithmic law. Specifically, we
ask for an algorithmically tractable general purpose model-checking problem that naturally …

We use a variant of Fraenkel-Mostowski sets (known also as nominal sets) as a framework
suitable for stating and proving the following two results on timed automata. The first result is …