In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas
over signals that take values in metric spaces. For such signals, which are generated by …

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 …

This paper offers a natural stochastic semantics of Networks of Priced Timed Automata
(NPTA) based on races between components. The semantics provides the basis for …

In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas
over timed sequences of states. For systems whose states are equipped with nontrivial …

We present a new language semantics for real-time concurrency. Its operational models are
higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional …

Timed automata are governed by an idealized semantics that assumes a perfectly precise
behavior of the clocks. The traditional semantics is not robust because the slightest …

In this paper we survey several approaches to the robustness of timed automata, that is, the
ability of a system to resist to slight perturbations or errors. We will concentrate on …

Like most models used in model-checking, timed automata are an idealized mathematical
model used for representing systems with strong timing requirements. In such mathematical …

In this paper, we define two relaxed semantics (one based on probabilities and the other
one based on the topological notion of largeness) for LTL over infinite runs of timed …

In a probabilistic semantics for timed automata has been defined in order to rule out unlikely
(sequences of) events. The qualitative model-checking problem for LTL properties has been …