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 …

We consider the fundamental problem of Büchi acceptance in timed automata in a robust
setting. The problem is formalised in terms of controller synthesis: timed automata are …

We define and study a new approach to the implementability of timed automata, where the
semantics is perturbed by imprecisions and finite frequency of the hardware. In order to …

Weighted Timed Games (WTG for short) are the most widely used model to describe
controller synthesis problems involving real-time issues. The synthesized strategies rely on …

Solving games played on timed automata is a well-known problem and has led to tools and
industrial case studies. In these games, the first player (Controller) chooses delays and …

Modeling and verifying complex real-time systems, involving timing delays, are notoriously
difficult problems. Checking the correctness of a system for one particular value for each …

We equip a recently developed model for the specification of service contracts with real-time
constraints. Service contracts offer a means to define the behavioural compliance of a …

Timed automata are a convenient framework for modelling and reasoning about real-time
systems. While these models are now well-understood, they do not offer a convenient way of …

Timed automata are a convenient mathematical model for modelling and reasoning about
real-time systems. While they provide a powerful way of representing timing aspects of such …

We present a tool for the robustness analysis of timed automata that can check whether a
given time-abstract behaviour of a timed automaton is still present when the guards are …