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 …

We present a general framework for the formal specification and algorithmic analysis of
hybrid systems. A hybrid system consists of a discrete program with an analog environment …

We introduce the framework of hybrid automata as a model and specification language for
hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in …

We describe finite-state programs over real-numbered time in a guarded-command
language with real-valued clocks or, equivalently, as finite automata with real-valued clocks …

Abstract Model checking is emerging as a practical tool for automated debugging of complex
reactive systems such as embedded controllers and network protocols (see [23] for a …

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 …

Test und Validierung spielen bei Echtzeitsystemen eine zentrale Rolle: Auf die
Spezifikationen, die der Hersteller angibt, muss sich der Kunde hier in besonders hohem …

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 …

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

In this paper, an algebra of timed processes with real-valued clocks is presented, which
serves as a formal description language for real-time communicating systems. We show that …