The theory of timed automata provides a formal framework to model and to verify the correct
functioning of real-time systems. Among the different verification problems that have been …

Both approaches presented in this paper considerably improve Kronos performance and
functionalities. Forward analysis permits handling examples with a large number of clocks …

The theory of finite automata on finite stings, infinite strings, and trees has had a dis
tinguished history. First, automata were introduced to represent idealized switching circuits …

Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …

We present a new application of the abstract interpretation by means of convex polyhedra, to
a class of hybrid systems, ie, systems involving both discrete and continuous variables. The …

The objective of this paper is to show how verification of dense-time systems modeled as
timed automata can be effectively performed using untimed verification techniques. In that …

We describe a new implementation of HYTECH, a symbolic model checker for hybrid
systems. Given a parametric description of an embedded system as a collection of …

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 …

Timed automata are a widely studied model. Its decidability has been proved using the so-
called region automaton construction. This construction provides a correct abstraction for the …

By definitionTimedAutomata have an infinite state-space, thus for verification purposes, an
exact finite abstraction is required. We propose a locationbased finite zone abstraction …