Pic of Pierre Vandenhove

Pierre Vandenhove

Premier Assistant at UMONS

contact

Université de Mons
Faculté des Sciences

Publications

See also my publications on DBLP and Google Scholar .

Peer-reviewed journals

  1. Half-Positional Objectives Recognized by Deterministic Büchi Automata. Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. Logical Methods in Computer Science, volume 20, issue 3, 42 pages, 2024. [DOI] [On arXiv]
  2. Arena-Independent Finite-Memory Determinacy in Stochastic Games. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Logical Methods in Computer Science, volume 19, issue 4, 51 pages, 2023. [DOI] [On arXiv]
  3. Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. TheoretiCS, volume 2, 48 pages, 2023. [DOI] [On arXiv]
  4. Parallel and Memory-Efficient Distributed Edge Learning in B5G IoT Networks. Jianxin Zhao, Pierre Vandenhove, Peng Xu, Hao Tao, Liang Wang, Chi Harold Liu, Jon Crowcroft. IEEE Journal of Selected Topics in Signal Processing, volume 17, issue 1, 12 pages, IEEE, 2023. [DOI]
  5. Decisiveness of Stochastic Systems and Its Application to Hybrid Models. Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. Information and Computation, volume 289, part B, 25 pages, Elsevier, 2022. [DOI] [On arXiv]
  6. Games Where You Can Play Optimally with Arena-Independent Finite Memory. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Logical Methods in Computer Science, volume 18, issue 1, 44 pages, 2022. [DOI] [On arXiv]

Peer-reviewed conference proceedings and edited volumes

  1. LTL\(_f\) Learning Meets Boolean Set Cover. Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon, Baptiste Mouillon, Pierre Vandenhove. 32nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2026), Lecture Notes in Computer Science 16505, Springer, 22 pages, 2026. [DOI] [Extended version on arXiv]
  2. Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs. Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier, Pierre Vandenhove. Principles of Formal Quantitative Analysis (Essays Dedicated to Christel Baier on the Occasion of Her 60th Birthday), Lecture Notes in Computer Science 15760, Springer, 29 pages, 2025. [DOI] [Extended version on arXiv]
  3. Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove. 39th Annual AAAI Conference on Artificial Intelligence (AAAI 2025), 9 pages, 2025. [DOI] [Extended version on arXiv] Outstanding Paper Award (awarded to 3 papers out of 3000+ accepted papers).
  4. The Power of Counting Steps in Quantitative Games. Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove. 35th International Conference on Concurrency Theory (CONCUR 2024), LIPIcs 311, Schloss Dagstuhl, 18 pages, 2024. [DOI] [Extended version on arXiv] Best Paper Award nomination.
  5. How to Play Optimally for Regular Objectives? Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove. 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), LIPIcs 261, Schloss Dagstuhl, 18 pages, 2023. [DOI] [Extended version on arXiv]
  6. Half-Positional Objectives Recognized by Deterministic Büchi Automata. Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. 33rd International Conference on Concurrency Theory (CONCUR 2022), LIPIcs 243, Schloss Dagstuhl, 18 pages, 2022. [DOI] [Extended version on arXiv]
  7. Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), LIPIcs 219, Schloss Dagstuhl, 16 pages, 2022. [DOI] [Extended version on arXiv]
  8. Arena-Independent Finite-Memory Determinacy in Stochastic Games. Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. 32nd International Conference on Concurrency Theory (CONCUR 2021), LIPIcs 203, Schloss Dagstuhl, 18 pages, 2021. [DOI] [Extended version on arXiv]
  9. Decisiveness of Stochastic Systems and Its Application to Hybrid Models. Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020), EPTCS 326, 17 pages, 2020. [DOI] [Extended version on arXiv]
  10. Games Where You Can Play Optimally with Arena-Independent Finite Memory. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. 31st International Conference on Concurrency Theory (CONCUR 2020), LIPIcs 171, Schloss Dagstuhl, 22 pages, 2020. [DOI] [Extended version on arXiv] Best Paper Award nomination.

Invited papers in international conferences

  1. Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), Sister Conferences Best Papers, 6 pages, 2023. [DOI] [Extended version on arXiv]
  2. The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022, invited talk by Patricia Bouyer), LIPIcs 250, Schloss Dagstuhl, 18 pages, 2022. [DOI]

Book chapter

Positionality and Memory. Antonio Casares, Pierre Ohlmann, Pierre Vandenhove. Chapter 4 of book Games on Graphs: From Logic and Automata to Algorithms, coordinated by Nathanaël Fijalkow. Cambridge University Press, 2026. [DOI] [On arXiv]

Preprints

  1. Computing the Reachability Value of Posterior-Deterministic POMDPs. Nathanaël Fijalkow, Arka Ghosh, Roman Kniazev, Guillermo A. Pérez, Pierre Vandenhove. 37 pages, 2026. [On arXiv]
  2. A Positional \(\mathbf{\Pi}^0_3\)-Complete Objective. Antonio Casares, Pierre Ohlmann, Pierre Vandenhove. 7 pages, 2024. [On arXiv]

PhD Thesis

Strategy Complexity of Zero-Sum Games on Graphs. April 2023. Supervised by Patricia Bouyer and Mickael Randour. [Manuscript] [Webpage]
[Back to main page]