Add to ORKGWe propose an algorithm for the analysis of robustness of timed automata, that is, the correctness of a model in the presence of small drifts of the clocks. The algorithm is an extension of the region based algorithm of Puri and uses the idea of stable zones as introduced by Daws and Kordy. Similarly to the assumptions made by Puri, we restrict our analysis to the class of timed automata with closed guards, progress cycles, and bounded clocks. We have implemented the algorithm and applied it to several benchmark specifications. The algorithm is a depth-first search based on on-the-fly reachability using zones
Proving that programs behave correctly is a matter of both great theoretical interest as well as pra...
In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed ...
The timed automata formalism is an important model for specifying and analysing real-time systems. R...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
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...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
Whereas formal verification of timed systems has become a very active field of research, the idealiz...
International audienceGiven the versatility of timed automata a huge body of work has evolved that c...
Cette thèse revisite les algorithmes standards pour les problèmes d'accessibilité et de vivacité des...
The timed automata formalism is an important model for specifying and analysing real-time systems. R...
In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, his...
This thesis revisits the standard algorithms for reachability and liveness analysis of timed automat...
Proving that programs behave correctly is a matter of both great theoretical interest as well as pra...
In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed ...
The timed automata formalism is an important model for specifying and analysing real-time systems. R...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness o...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the co...
International audienceWe study the robust safety problem for timed automata under guard imprecisions...
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...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
Whereas formal verification of timed systems has become a very active field of research, the idealiz...
International audienceGiven the versatility of timed automata a huge body of work has evolved that c...
Cette thèse revisite les algorithmes standards pour les problèmes d'accessibilité et de vivacité des...
The timed automata formalism is an important model for specifying and analysing real-time systems. R...
In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, his...
This thesis revisits the standard algorithms for reachability and liveness analysis of timed automat...
Proving that programs behave correctly is a matter of both great theoretical interest as well as pra...
In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed ...
The timed automata formalism is an important model for specifying and analysing real-time systems. R...