Short bio

I did a PhD (2018-2022) under the supervision of Thierry Jéron, Nicolas Markey and David Mentré about robustness of Timed Automata then I did around three years of postdoc and ATER at Paris and Villetaneuse (ISIR, IRIF, LIPN) about automata, synthesis, robotics and the geometry of concurrency.
Here is my Manuscript and Defense Slides.

News

  • 09-2026: I present talk at Highlights'2026 about games on HDA.
  • 08-2026: Our paper Property FA for random l-gonal groups has been accepted to the journal Mathematische Zeitschrift
  • 08-2026: Our PCR ANR CHAAT has been accepted (2026-2030) !
  • 06-2026: Maya Hayman joins Aloÿs Dufour and I at LIPN for a Bachelor Internship to work on Distance betwen Pomsets.
  • Research topic : Higher Dimensional Automata for games and verification

    My research focuses on formal verification for automata and higher dimensional automata. My main models are based on automata and its variants (Timed, Higher Dimensional Automata) in order to have more expressive models to fit reality. My aim is to work on games and robustness for HDA and its variants. I am also interested in logic and geometric aspects of HDA.

    A second interest of mine is geometry and groups. I study it both for verification purpose (polyhedra tiling for some optimisation function in verification, algebraic structure of models) or for more mathematical sujects (e.g random groups).

    Keywords :

  • Automata, Higher Dimensional Automata, Model-Checking, Temporal Logic (LTL, HyperLTL...), Games on graphs, Robustness
  • Polyhedra, Symbolic optimisation
  • Random Groups, Geometry

  • You can find below a sum up of my four main research topic.

    Concurrency : Higher Dimension Automata

    My goal is to provide verification for models of concurrency, as higher dimensional (timed) automata (HDA/HDTA). This model is based on automata and events can happen in parallel (true concurrency).
    My research focus are on :

  • Development of logic for Pomsets
  • Comparison of concurrent models
  • Verification and robustness
  • Collaborators : Amazigh Amrane, Hugo Bazille, Aloÿs Dufour, Enzo Erlich, Uli Fahrenberg, Marie Fortin, Léo Henry, Jérémy Ledent, Benjamin Monmege, Philipp Schlehuber-Caissier, Krzysztof Ziemiański

    Monitoring


    I aim to provide online monitoring algorithm based on automata techniques.
    My goals are to :

  • Compare traces (Hyperproperties, HyperLTL)
  • Provide a user-friendly language specification
  • Applied monitoring to use-cases (ex: malwares)
  • Collaborator : Étienne André

    Random groups

    Groups can be randomly generated with letters (generators) and cancelling subwords (relation). My goal is to study the asymptotical behaviours of such groups, depending on the length of the relations. In particular :

  • Are these groups free ? Hyperbolic ?
  • Can we splits them ?
  • Collaborator : John Mackay

    Last work

    Students

    Bachelor/Master Students

    Level Student Period Topic Co-supervision
    L3 Maya Hayman 06/2026-07/2026 Distance between iiPomset Aloÿs Dufour
    ATER (Université Sorbonne Paris-Nord)
    M2 Enzo Erlich 03/2024-08/2024 Logic for Pomset, Higher Dimensional Automata Jérémy Ledent
    MCF IRIF/Université Paris-Cité

    PhD Students

    Student Period Topic Co-supervision
    Enzo Erlich 10/2024 - now Logic for Pomset, Higher Dimensional Automata Jérémy Ledent
    MCF IRIF/Université Paris-Cité
    Uli Fahrenberg
    EC at Epita/LRE

    Projects participation

    ANR

    Name Period Topic Role
    PRC CHAAT 10/2026 - 06/2030 Concurrency and Higher-dimensional Automata: Applications and Theory Member
    PRC BiSoUS 10/2024 - 11/2025 Better Synthesis for Underspecified Quantitative Systems Member
    PRC TickTac 10/2018 - 05/2023 Efficient Techniques and Tools for the Verification and Synthesis of Real-Time Systems Member

    Research topic

    Get in touch