Timed automata are among the most widely studied models for real-time systems. Silent
transitions, ie, ϵ-transitions, have already been proposed in the original paper on timed …

Timed automata are among the most widely studied models for real-time systems. Silent
transitions, ie, ε-transitions, have already been proposed in the original paper on timed …

Timed finite automata, introduced by Alur and Dill, are one of the most widely studied
models for real-time systems. We focus in this paper on the power of silent transitions, ie ε …

Since their introduction by A lur and D ill, timed automata have been one of the most widely
studied models for real-time systems. The syntactic extension of so-called updatable timed …

We investigate extensions of Alur and Dill's timed automata, based on the possibility to
update the clocks in a more elaborate way than simply reset them to zero. We call these …

Parametric timed automata extend the standard timed automata with the possibility to use
parameters in the clock guards. In general, if the parameters are real-valued, the problem of …

A notion of alternating timed automata is proposed. It is shown that such automata with only
one clock have decidable emptiness problem over finite words. This gives a new class of …

We propose in this paper a decomposition theorem for the timed automata introduced by
Alur and Dill [2]. To this purpose, we define a new simple and natural concatenation …

There has been a growing interest in defining models of automata enriched with time. For
instance, timed automata were introduced as automata extended with clocks. In this paper …

In this paper, we propose an abstract procedure which, given a timed automaton, produces
a language-equivalent deterministic infinite timed tree. We prove that under a certain …