International audienceIn 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototype presented at that time has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of Uppaal-4.0. The new tool can output strategies or let the user play against them both from the command line and from the graphical simulator that was completely re-designed
International audienceIn this paper, we study the notion of admissibility in timed games. First, we ...
The rapid development of complex and safety-critical systems requires the use of reliable verificati...
Abstract: Timed game automata are used for solving control problems on real-time systems. A timed re...
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game a...
Abstract. In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on ti...
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game a...
International audienceIn this paper, we propose a first efficient on-the-fly algorithm for solving g...
version 1.1We propose a subclass of timed game automata (TGA), called Task TGA, representing network...
International audienceIn this paper, we review some recent results on the efficient synthesis of con...
Abstract. In this paper, we propose a first efficient on-the-fly algorithm for solving games based o...
Invited PaperInternational audienceIn this paper, we review some recent results on the efficient syn...
Control synthesis techniques, based on timed games, derive strategies to ensure a given control obje...
International audienceTimed game automata are used for solving control problems on real-time systems...
This paper presents a game-theoretic approach to the testing of uncontrollable real-time systems. By...
We propose a subclass of timed game automata (TGA), called Task TGA, representing networks of commun...
International audienceIn this paper, we study the notion of admissibility in timed games. First, we ...
The rapid development of complex and safety-critical systems requires the use of reliable verificati...
Abstract: Timed game automata are used for solving control problems on real-time systems. A timed re...
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game a...
Abstract. In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on ti...
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game a...
International audienceIn this paper, we propose a first efficient on-the-fly algorithm for solving g...
version 1.1We propose a subclass of timed game automata (TGA), called Task TGA, representing network...
International audienceIn this paper, we review some recent results on the efficient synthesis of con...
Abstract. In this paper, we propose a first efficient on-the-fly algorithm for solving games based o...
Invited PaperInternational audienceIn this paper, we review some recent results on the efficient syn...
Control synthesis techniques, based on timed games, derive strategies to ensure a given control obje...
International audienceTimed game automata are used for solving control problems on real-time systems...
This paper presents a game-theoretic approach to the testing of uncontrollable real-time systems. By...
We propose a subclass of timed game automata (TGA), called Task TGA, representing networks of commun...
International audienceIn this paper, we study the notion of admissibility in timed games. First, we ...
The rapid development of complex and safety-critical systems requires the use of reliable verificati...
Abstract: Timed game automata are used for solving control problems on real-time systems. A timed re...