| Strategy synthesis for multi-dimensional quantitative objectives K Chatterjee, M Randour, JF Raskin Acta informatica 51 (3-4), 129-163, 2014 | 104 | 2014 |
| 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 | 81 | 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 | 66 | 2015 |
| 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 | 52 | 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 | 48 | 2014 |
| 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 | 45 | 2015 |
| Average-energy games P Bouyer, N Markey, M Randour, KG Larsen, S Laursen GandALF 2015 - International Symposium on Games, Automata, Logics and Formal …, 2015 | 40* | 2015 |
| 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 | 27 | 2016 |
| Games where you can play optimally with arena-independent finite memory P Vandenhove, M Randour, Y Oualhadj, SL Roux, P Bouyer Logical Methods in Computer Science 18, 2022 | 26 | 2022 |
| Simple strategies in multi-objective MDPs F Delgrange, JP Katoen, T Quatmann, M Randour Tools and Algorithms for the Construction and Analysis of Systems: 26th …, 2020 | 22 | 2020 |
| Threshold constraints with guarantees for parity objectives in Markov decision processes R Berthon, M Randour, JF Raskin arXiv preprint arXiv:1702.05472, 2017 | 19 | 2017 |
| 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 | 19 | 2016 |
| 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 | 18 | 2013 |
| Extending finite-memory determinacy by Boolean combination of winning conditions SL Roux, A Pauly, M Randour arXiv preprint arXiv:1808.05791, 2018 | 17 | 2018 |
| Arena-independent finite-memory determinacy in stochastic games P Bouyer, Y Oualhadj, M Randour, P Vandenhove arXiv preprint arXiv:2102.10104, 2021 | 12 | 2021 |
| Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs P Bouyer, M Randour, P Vandenhove arXiv preprint arXiv:2110.01276, 2021 | 10 | 2021 |
| Bounding average-energy games P Bouyer, P Hofman, N Markey, M Randour, M Zimmermann Foundations of Software Science and Computation Structures: 20th …, 2017 | 9 | 2017 |
| Decisiveness of stochastic systems and its application to hybrid models P Bouyer, T Brihaye, M Randour, C Rivière, P Vandenhove Information and Computation 289, 104861, 2022 | 7 | 2022 |
| Energy mean-payoff games V Bruyère, Q Hautem, M Randour, JF Raskin arXiv preprint arXiv:1907.01359, 2019 | 7 | 2019 |
| Synthesis in Multi-Criteria Quantitative Games M Randour Université de Mons, 2014 | 7 | 2014 |
Jean-François RaskinUniversité Libre de Bruxelles, U.L.B.Verified email at ulb.ac.be
