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 …

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 …

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 …

The classical theory of deterministic automata is presented in terms of the notions of
homomorphism and bisimulation, which are the cornerstones of the theory of (universal) …

Metric temporal logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …

Abstract Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …

Finite automata and regular languages have been useful in a wide variety of problems in
computing, communication and control, including formal modeling and verification …

LNCS 4202 - From MITL to Timed Automata Page 1 From MITL to Timed Automata * Oded
Maler 1 , Dejan Nickovic 1 , and Amir Pnueli 2,3 1 Verimag, 2 Av. de Vignate, 38610 Gi`eres …

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 …

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …