Youssouf Oualhadj

35 papers A* 1A 2B 7C 1Journal 16Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Controller synthesis in timed Büchi automata: Robustness and punctual guards. Perform. Evaluation Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2024	—	`conf`	Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. QEST+FORMATS Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2024	J	`jnl`	Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. CoRR Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2024	C	`conf`	Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. ICFEM Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau
2024	J	`jnl`	Deciding the synthesis problem for hybrid games through bisimulation. CoRR Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau
2024	—	`conf`	Promptness and Fairness in Muller LTL Formulas. FSTTCS Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible, Daniele Varacca
2024	—	`book`	The Controller Synthesis Problem: Implementability and robustness. Youssouf Oualhadj
2023	J	`jnl`	Arena-Independent Finite-Memory Determinacy in Stochastic Games. Log. Methods Comput. Sci. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2023	A	`conf`	Synthesis of Resource-Aware Controllers Against Rational Agents. AAMAS Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
2022	—	`conf`	Careful Autonomous Agents in Environments With Multiple Common Resources. AREA@IJCAI-ECAI Rodica Condurache, Catalin Dima, Madalina Jitaru, Youssouf Oualhadj, Nicolas Troquard
2022	J	`jnl`	Fairness and promptness in Muller formulas. CoRR Youssouf Oualhadj, Léo Tible, Daniele Varacca
2022	J	`jnl`	Games Where You Can Play Optimally with Arena-Independent Finite Memory. Log. Methods Comput. Sci. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2021	B	`conf`	Arena-Independent Finite-Memory Determinacy in Stochastic Games. CONCUR Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2021	J	`jnl`	Arena-Independent Finite-Memory Determinacy in Stochastic Games. CoRR Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2021	A	`conf`	Rational Synthesis in the Commons with Careless and Careful Agents. AAMAS Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
2020	B	`conf`	Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2020	J	`jnl`	Games Where You Can Play Optimally with Finite Memory. CoRR Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
2020	J	`jnl`	Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Log. Methods Comput. Sci. Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2019	B	`conf`	Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. CONCUR Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2019	J	`jnl`	Life is Random, Time is Not: Markov Decision Processes with Window Objectives. CoRR Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2018	J	`jnl`	Banach-Mazur Parity Games and Almost-sure Winning Strategies. CoRR Youssouf Oualhadj, Léo Tible, Daniele Varacca
2018	B	`conf`	The Complexity of Rational Synthesis for Concurrent Games. CONCUR Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard
2017	J	`jnl`	The Complexity of Concurrent Rational Synthesis. CoRR Rodica Condurache, Youssouf Oualhadj
2017	J	`jnl`	Two Recursively Inseparable Problems for Probabilistic Automata. CoRR Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2016	—	`conf`	Rational verification in Iterated Electric Boolean Games. SR Youssouf Oualhadj, Nicolas Troquard
2015	J	`jnl`	Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj
2014	B	`conf`	Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes. SOFSEM Hugo Gimbert, Youssouf Oualhadj
2014	B	`conf`	Perfect-Information Stochastic Mean-Payoff Parity Games. FoSSaCS Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj
2014	B	`conf`	Probabilistic Robust Timed Games. CONCUR Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
2014	—	`conf`	Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2012	A*	`conf`	Deciding the Value 1 Problem for Probabilistic Leaktight Automata. LICS Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2012	—	`—`	The value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques). Youssouf Oualhadj
2011	J	`jnl`	A Class of Probabilistic Automata with a Decidable Value 1 Problem CoRR Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2011	J	`jnl`	Pushing undecidability of the isolation problem for probabilistic automata CoRR Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2010	—	`conf`	Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. ICALP (2) Hugo Gimbert, Youssouf Oualhadj