Add to ORKGInvited PaperInternational audienceIn this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games
International audienceIn this paper we consider the problem of controller synthesis for timed games ...
International audienceWe consider parametric reachability control problems for real-time systems. We...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...
International audienceIn this paper, we review some recent results on the efficient synthesis of con...
Abstract. In this paper, we review some recent results on the efficient synthesis of controllers for...
International audienceIn this paper, we propose a first efficient on-the-fly algorithm for solving g...
International audienceTimed game automata are used for solving control problems on real-time systems...
Abstract. In this paper, we propose a first efficient on-the-fly algorithm for solving games based o...
Abstract. We revisit the synthesis of timed controllers with partial observability. Bouyer et al. sh...
This report deals with non-deterministic timed strategies, also called timed multi-strategies, for t...
Abstract: Timed game automata are used for solving control problems on real-time systems. A timed re...
International audienceIn this paper we consider the problem of controller synthesis for timed games ...
version 1.1We propose a subclass of timed game automata (TGA), called Task TGA, representing network...
42 pagesSolving games played on timed automata is a well-known problem and has led to tools and indu...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
International audienceIn this paper we consider the problem of controller synthesis for timed games ...
International audienceWe consider parametric reachability control problems for real-time systems. We...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...
International audienceIn this paper, we review some recent results on the efficient synthesis of con...
Abstract. In this paper, we review some recent results on the efficient synthesis of controllers for...
International audienceIn this paper, we propose a first efficient on-the-fly algorithm for solving g...
International audienceTimed game automata are used for solving control problems on real-time systems...
Abstract. In this paper, we propose a first efficient on-the-fly algorithm for solving games based o...
Abstract. We revisit the synthesis of timed controllers with partial observability. Bouyer et al. sh...
This report deals with non-deterministic timed strategies, also called timed multi-strategies, for t...
Abstract: Timed game automata are used for solving control problems on real-time systems. A timed re...
International audienceIn this paper we consider the problem of controller synthesis for timed games ...
version 1.1We propose a subclass of timed game automata (TGA), called Task TGA, representing network...
42 pagesSolving games played on timed automata is a well-known problem and has led to tools and indu...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
International audienceIn this paper we consider the problem of controller synthesis for timed games ...
International audienceWe consider parametric reachability control problems for real-time systems. We...
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While...