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 …

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 …

In this paper we define and study the class of stopwatch automata which are timed automata
augmented with stopwatches and unobservable behaviour. In particular, we investigate the …

In this thesis, we present efficient implementation techniques for probabilistic model
checking, a method which can be used to analyse probabilistic systems such as randomised …

During the past few years, a number of verification tools have been developed for real-time
systems in the framework of timed automata (eg KRONOS and UPPAAL). One of the major …

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 …

An overview of the current state of the art of formal verification of real-time systems is
presented. We discuss commonly accepted models, specification languages, verification …

One of the major problems in applying automatic verification tools to industrial-size systems
is the excessive amount of memory required during the state-space exploration of a model …

This paper describes a newdata structure, difference decision diagrams (DDDs), for
representing a Boolean logic over inequalities of the form xy≤ c where the variables are …

In this paper, we present Clock Di erence Diagrams (CDD), a new BDD-like data-structure
for e ective representation and manipulation of certain non-convex subsets of the Euclidean …