youssouf oualhadj
youssouf oualhadj
LACL, UPEC
Verified email at lacl.fr - Homepage
Title
Cited by
Cited by
Year
Probabilistic automata on finite words: Decidable and undecidable problems
H Gimbert, Y Oualhadj
International Colloquium on Automata, Languages, and Programming, 527-538, 2010
1182010
Deciding the value 1 problem for probabilistic leaktight automata
N Fijalkow, H Gimbert, Y Oualhadj
2012 27th Annual IEEE Symposium on Logic in Computer Science, 295-304, 2012
452012
Perfect-information stochastic mean-payoff parity games
K Chatterjee, L Doyen, H Gimbert, Y Oualhadj
International Conference on Foundations of Software Science and Computation …, 2014
162014
Probabilistic robust timed games
Y Oualhadj, PA Reynier, O Sankur
International Conference on Concurrency Theory, 203-217, 2014
122014
Games where you can play optimally with arena-independent finite memory
P Bouyer, SL Roux, Y Oualhadj, M Randour, P Vandenhove
arXiv preprint arXiv:2001.03894, 2020
82020
Two recursively inseparable problems for probabilistic automata
N Fijalkow, H Gimbert, F Horn, Y Oualhadj
International Symposium on Mathematical Foundations of Computer Science, 267-278, 2014
62014
Deciding the Value 1 Problem for -acyclic Partially Observable Markov Decision Processes
H Gimbert, Y Oualhadj
International Conference on Current Trends in Theory and Practice of …, 2014
52014
Life is random, time is not: Markov decision processes with window objectives
T Brihaye, F Delgrange, Y Oualhadj, M Randour
arXiv preprint arXiv:1901.03571, 2019
42019
The complexity of rational synthesis for concurrent games
R Condurache, Y Oualhadj, N Troquard
29th International Conference on Concurrency Theory (CONCUR 2018), 2018
32018
Computing optimal strategies for Markov decision processes with parity and positive-average conditions
H Gimbert, Y Oualhadj, S Paul
32011
The value problem in stochastic games
Y Oualhadj
Université Sciences et Technologies-Bordeaux I, 2012
22012
Automates probabilistes: problémes décidables et indécidables
H Gimbert, Y Oualhadj
22009
Arena-Independent Finite-Memory Determinacy in Stochastic Games
P Bouyer, Y Oualhadj, M Randour, P Vandenhove
arXiv preprint arXiv:2102.10104, 2021
12021
A class of probabilistic automata with a decidable value 1 problem
N Fijalkow, H Gimbert, Y Oualhadj
CoRR, abs/1104.3055, 2011
12011
Pushing undecidability of the isolation problem for probabilistic automata
N Fijalkow, H Gimbert, Y Oualhadj
arXiv preprint arXiv:1104.3054, 2011
12011
Rational Synthesis in the Commons with Careless and Careful Agents
R Condurache, C Dima, Y Oualhadj, N Troquard
Proceedings of the 20th International Conference on Autonomous Agents and …, 2021
2021
Life is Random, Time is Not: Markov Decision Processes with Window Objectives
M Randour, Y Oualhadj, F Delgrange, T Brihaye
Logical Methods in Computer Science 16, 2020
2020
Games where you can play optimally with finite memory
P Bouyer, S Le Roux, Y Oualhadj, M Randour, P Vandenhove
2019
Banach-Mazur Parity Games and Almost-sure Winning Strategies
Y Oualhadj, L Tible, D Varacca
arXiv preprint arXiv:1806.10025, 2018
2018
Two Recursively Inseparable Problems for Probabilistic Automata
N Fijalkow, H Gimbert, F Horn, Y Oualhadj
arXiv preprint arXiv:1709.03122, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20