We study the trap depth requirement for the realization of an optical clock using atoms
confined in a lattice. We show that site-to-site tunneling leads to a residual sensitivity to the …

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 …

In this paper, we exend timed automata with asynchronous processes ie tasks triggered by
events as a model for real-time systems. The model is expressive enough to describe …

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 …

We present an algorithm that constructs a finite state “abstract” program from a given,
possibly infinite state,“concrete” program by means of a syntactic program transformation …

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

We provide an overview of theories of continuous time computation. These theories allow us
to understand both the hardness of questions related to continuous time dynamical systems …

In classical timed automata, as defined by Alur and Dill [AD90, AD94] and since widely
studied, the only operation allowed to modify the clocks is the reset operation. For instance …

Even though many attempts have been made to define the boundary between decidable
and undecidable hybrid systems, the affair is far from being resolved. More and more low …

Timed automata are known not to be complementable or determinizable. Natural questions
are, then, could we check whether a given TA enjoys these properties? These problems are …