Mickael Randour
Mickael Randour
Verified email at umons.ac.be - Homepage
Cited by
Cited by
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
V Bruyère, E Filiot, M Randour, JF Raskin
STACS 2014 - Symposium on Theoretical Aspects of Computer Science, 199-213, 2014
Percentile queries in multi-dimensional Markov decision processes
M Randour, JF Raskin, O Sankur
CAV 2015 - International Conference on Computer Aided Verification, 123-139, 2015
Strategy synthesis for multi-dimensional quantitative objectives
K Chatterjee, M Randour, JF Raskin
Acta informatica 51 (3-4), 129-163, 2014
Looking at mean-payoff and total-payoff through windows
K Chatterjee, L Doyen, M Randour, JF Raskin
ATVA 2013 - Automated Technology for Verification and Analysis, 118-132, 2013
Variations on the stochastic shortest path problem
M Randour, JF Raskin, O Sankur
VMCAI 2015 - Verification, Model Checking, and Abstract Interpretation, 1-18, 2014
Strategy synthesis for multi-dimensional quantitative objectives
K Chatterjee, M Randour, JF Raskin
CONCUR 2012 - International Conference on Concurrency Theory, 115-131, 2012
Average-energy games
P Bouyer, N Markey, M Randour, KG Larsen, S Laursen
GandALF 2015 - International Symposium on Games, Automata, Logics and Formal …, 2015
Non-Zero Sum Games for Reactive Synthesis
R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ...
LATA 2016 - International Conference on Language and Automata Theory and …, 2015
Threshold constraints with guarantees for parity objectives in Markov decision processes
R Berthon, M Randour, JF Raskin
arXiv preprint arXiv:1702.05472, 2017
Automated synthesis of reliable and efficient systems through game theory: a case study
M Randour
ECCS 2012 - European Conference on Complex Systems, 731-738, 2013
Window parity games: an alternative approach toward parity games with time bounds
V Bruyère, Q Hautem, M Randour
arXiv preprint arXiv:1606.01831, 2016
Reachability in networks of register protocols under stochastic schedulers
P Bouyer, N Markey, M Randour, A Sangnier, D Stan
arXiv preprint arXiv:1602.05928, 2016
Bounding average-energy games
P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann
International Conference on Foundations of Software Science and Computation …, 2017
Simple strategies in multi-objective MDPs
F Delgrange, JP Katoen, T Quatmann, M Randour
International Conference on Tools and Algorithms for the Construction and …, 2020
Multi-weighted Markov decision processes with reachability objectives
P Bouyer, M González, N Markey, M Randour
arXiv preprint arXiv:1809.03107, 2018
Synthesis in Multi-Criteria Quantitative Games
M Randour
Université de Mons, 2014
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
Extending finite-memory determinacy by Boolean combination of winning conditions
SL Roux, A Pauly, M Randour
arXiv preprint arXiv:1808.05791, 2018
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs
V Bruyere, E Filiot, M Randour, JF Raskin
SR 2014 - Strategic Reasoning, 1-8, 2014
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
The system can't perform the operation now. Try again later.
Articles 1–20