Youssouf Oualhadj

Orcid: 0000-0003-0200-4032

According to our database1, Youssouf Oualhadj authored at least 25 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards.
Proceedings of the Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems, 2024

Deciding the Synthesis Problem for Hybrid Games Through Bisimulation.
Proceedings of the Formal Methods and Software Engineering, 2024

Promptness and Fairness in Muller LTL Formulas.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
Arena-Independent Finite-Memory Determinacy in Stochastic Games.
Log. Methods Comput. Sci., 2023

Synthesis of Resource-Aware Controllers Against Rational Agents.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Games Where You Can Play Optimally with Arena-Independent Finite Memory.
Log. Methods Comput. Sci., 2022

Careful Autonomous Agents in Environments With Multiple Common Resources.
Proceedings of the Second Workshop on Agents and Robots for reliable Engineered Autonomy, 2022

Fairness and promptness in Muller formulas.
CoRR, 2022

2021
Rational Synthesis in the Commons with Careless and Careful Agents.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Life is Random, Time is Not: Markov Decision Processes with Window Objectives.
Log. Methods Comput. Sci., 2020

Games Where You Can Play Optimally with Finite Memory.
CoRR, 2020

2018
Banach-Mazur Parity Games and Almost-sure Winning Strategies.
CoRR, 2018

The Complexity of Rational Synthesis for Concurrent Games.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
The Complexity of Concurrent Rational Synthesis.
CoRR, 2017

2016
Rational verification in Iterated Electric Boolean Games.
Proceedings of the 4th International Workshop on Strategic Reasoning, 2016

2015
Deciding the value 1 problem for probabilistic leaktight automata.
Log. Methods Comput. Sci., 2015

2014
Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Two Recursively Inseparable Problems for Probabilistic Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Perfect-Information Stochastic Mean-Payoff Parity Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Probabilistic Robust Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2012
The value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques).
PhD thesis, 2012

Deciding the Value 1 Problem for Probabilistic Leaktight Automata.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
A Class of Probabilistic Automata with a Decidable Value 1 Problem
CoRR, 2011

Pushing undecidability of the isolation problem for probabilistic automata
CoRR, 2011

2010
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010


  Loading...