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 robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter than expected. We consider the perturbation model of guard enlargement and formulate several robust verification problems that have been studied recently, including robustness analysis, robust implementation, and robust control
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...
Specification theories for real-time systems allow to reason about interfaces and their implementati...
In this paper we survey several approaches to the robustness of timed automata, that is, the ability...
Timed automata are a formalism to model, verify, and synthesize real-time systems. They have the adv...
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of t...
Abstract. Robustness of timed systems aims at studying whether infinitesimal perturbations in clock ...
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
Timed automata (TA) have been widely adopted as a suitable formalism to modeltime-critical systems. ...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
We consider several questions related to the use of digitization tech-niques for timed automata. The...
Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to mo...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...
Specification theories for real-time systems allow to reason about interfaces and their implementati...
In this paper we survey several approaches to the robustness of timed automata, that is, the ability...
Timed automata are a formalism to model, verify, and synthesize real-time systems. They have the adv...
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of t...
Abstract. Robustness of timed systems aims at studying whether infinitesimal perturbations in clock ...
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
Timed automata (TA) have been widely adopted as a suitable formalism to modeltime-critical systems. ...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
We consider several questions related to the use of digitization tech-niques for timed automata. The...
Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to mo...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...
Specification theories for real-time systems allow to reason about interfaces and their implementati...