International audienceWe study the robust safety problem for timed automata under guard imprecisions which consists in computing an imprecision parameter under which a safety specification holds. We give a symbolic semi-algorithm for the problem based on a parametric data structure, and evaluate its performance in comparison with a recently published one, and with a binary search on enlargement values
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
We define and study a new approach to the implementability of timed automata, where the semantics is...
This thesis is about verification of timed automata, a well-established model for real time systems....
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
Whereas formal verification of timed systems has become a very active field of research, the idealiz...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of t...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
In this paper we survey several approaches to the robustness of timed automata, that is, the ability...
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...
International audienceFormal verification of timed systems is well understood, but their \emphimplem...
International audienceRobustness of timed systems aims at studying whether infinitesimal perturbatio...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
We define and study a new approach to the implementability of timed automata, where the semantics is...
This thesis is about verification of timed automata, a well-established model for real time systems....
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
Whereas formal verification of timed systems has become a very active field of research, the idealiz...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of t...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
In this paper we survey several approaches to the robustness of timed automata, that is, the ability...
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...
International audienceFormal verification of timed systems is well understood, but their \emphimplem...
International audienceRobustness of timed systems aims at studying whether infinitesimal perturbatio...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
We define and study a new approach to the implementability of timed automata, where the semantics is...
This thesis is about verification of timed automata, a well-established model for real time systems....
DOI
Add to ORKG