Summary
I am a PhD student cosupervised by Mickael Randour from the Effective Mathematics Team at the University of Mons (UMONS) and by Patricia Bouyer-Decitre from the Laboratoire Méthodes Formelles (Université Paris-Saclay, CNRS, ENS Paris-Saclay). My PhD started in October 2019 and is funded by an F.R.S.-FNRS Research Fellow grant. My research interests are focused on logic in computer science, and more precisely on automata theory, game theory, formal verification, and controller synthesis for reactive systems.
I defended my thesis on April 26, 2023. See this page for more details.
Publications
My publications on DBLP.Peer-reviewed journals
- 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]
- 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, 2022. [DOI]
- 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]
- 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
- How to Play Optimally for Regular Objectives? Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove. Accepted to the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Schloss Dagstuhl, 18 pages, 2023. [Extended version on arXiv]
- Half-Positional Objectives Recognized by Deterministic Büchi Automata. Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove. 33nd International Conference on Concurrency Theory (CONCUR 2022), LIPIcs 243, Schloss Dagstuhl, 18 pages, 2022. [DOI] [Extended version on arXiv]
- 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]
- 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]
- Decisiveness of Stochastic Systems and its Application to Hybrid Models. Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. Eleventh International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020), EPTCS 326, 17 pages, 2020. [DOI] [Extended version on arXiv]
- 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] Nominated (among 4 papers) for the Best Paper Award of CONCUR 2020.
Invited papers in international conferences
- The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove. Keynote lecture at the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022), LIPIcs 250, Schloss Dagstuhl, 18 pages, 2022. [DOI]
PhD Thesis
Strategy Complexity of Zero-Sum Games on Graphs. April 2023. Supervised by Patricia Bouyer and Mickael Randour. [Manuscript]Attended events
My talks with slides.- 2022: CONCUR 2022: The 33rd International Conference on Concurrency Theory (Warsaw, Poland), LAMAS and SR 2022: Logical Aspects in Multi-Agent Systems and Strategic Reasoning (Rennes, France), Highlights 2022 of Logic, Games and Automata (Paris, France), Current Trends in Graph and Stochastic Games (GAMENET Workshop) (Maastricht, The Netherlands), 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Online).
- 2021: Journées du GT Vérif (ENS Paris-Saclay, Gif-sur-Yvette, France), Highlights 2021 of Logic, Games and Automata (Online), CONCUR 2021: The 32nd International Conference on Concurrency Theory (Online), Reinforcement Learning - From Theory to Practice Summer School (Alan Turing Institute), GT ALGA - Journées annuelles 2021 (Online).
- 2020: Spotlight on Games (Online), GandALF 2020: Eleventh International Symposium on Games, Automata, Logics, and Formal Verification (Online), Highlights 2020 of Logic, Games and Automata (Online), CONCUR 2020: The 31st International Conference on Concurrency Theory (Online), MOVEP 2020: 14th Summer School on Modelling and Verification of Parallel Processes (Online).
- 2019: Highlights 2019 of Logic, Games and Automata (Warsaw, Poland), 13th International Conference on Reachability Problems (RP'19) (Brussels, Belgium), Theory and Algorithms in Graph and Stochastic Games (Université de Mons, Mons, Belgium), Mardi des Chercheurs (Université de Mons, Mons, Belgium).
- 2018: FoPSS Logic and Learning School (University of Oxford, Oxford, UK), MOVEP 2018 (ENS Paris-Saclay, Cachan, France), International Conference on Functional Programming (ICFP'18) (St. Louis, Missouri, United States).
- 2017: Computers in Scientific Discoveries 8 (Université de Mons, Mons, Belgium).
Projects
Regular Memory Requirements [link]
Algorithms that compute minimal memory structures to play optimally in two-player zero-sum games with regular reachability and safety objectives.
Algorithms that compute minimal memory structures to play optimally in two-player zero-sum games with regular reachability and safety objectives.
Mask R-CNN in OCaml [link]
Implementation and optimisation of the Mask R-CNN architecture for image segmentation and classification using OCaml's numerical library Owl. Work produced during an internship at OCaml Labs, University of Cambridge. See my internship report for more details.
Implementation and optimisation of the Mask R-CNN architecture for image segmentation and classification using OCaml's numerical library Owl. Work produced during an internship at OCaml Labs, University of Cambridge. See my internship report for more details.