18 citations · 34 across the 12 of their papers we have counts for
14 papers
Deciding the synthesis problem for hybrid games through bisimulation
Catalin Dima, Mariem Hammami, Youssouf Oualhadj +1
Hybrid games are games played on a finite graph endowed with real variables which may model behaviors of discrete controllers of continuous systems. The synthesis problem for hybri…
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards
Benoît Barbot, Damien Busatto-Gaston, Catalin Dima +1
We consider the synthesis problem on timed automata with Büchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller ne…
Careful Autonomous Agents in Environments With Multiple Common Resources
Rodica Condurache, Catalin Dima, Madalina Jitaru +2
Careful rational synthesis was defined in (Condurache et al. 2021) as a quantitative extension of Fisman et al.'s rational synthesis (Fisman et al. 2010), as a model of multi-agent…
Fairness and promptness in Muller formulas
Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible +1
In this paper we consider two different views of the model checking problems for the Linear Temporal Logic (LTL). On the one hand, we consider the universal model checking problem…
Arena-Independent Finite-Memory Determinacy in Stochastic Games
Patricia Bouyer, Youssouf Oualhadj, Mickael Randour +1
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, a…
Games Where You Can Play Optimally with Arena-Independent Finite Memory
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj +2
For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller sy…