Preprints:

• Explorable Parity Automata
  With Émile Hazard, Olivier Idir.
  Extended version of the CSL 2023 paper.


• Thermodynamic consistency of autocatalytic cycles
  With Thomas Kosc, Etienne Rajon, Sylvain Charlat.


• Tree algebras and bisimulation-invariant MSO on finite graphs
  With Thomas Colcombet and Amina Doumane.


• Positive and monotone fragments of FO and LTL
  With Quentin Moreau.


• On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
  With Antonio Casares, Olivier Idir, Corto Mascle, Aditya Prakash.
  Accepted for publication in CSL 2025.

• Positive First-order Logic on Words and Graphs
  In LMCS 2023.
  Here is the conference version, distinguished paper at LICS 2021.


• Explorable Automata
  With Emile Hazard, in CSL 2023.


• Bouncing threads for infinitary and circular proofs
  With David Baelde, Amina Doumane and Alexis Saurin, in LICS 2022.


• Cyclic Proofs for Transfinite Expressions
  With Emile Hazard, in CSL 2022.


• Positive First-order Logic on Words
  Distinguished paper at LICS 2021.


• Cyclic Proofs, System T, and the Power of Contraction
  with Laureline Pinault and Damien Pous, in POPL 2021.


• On the Succinctness of Alternating Parity Good-for-Games Automata
  with Udi Boker, Karoliina Lehtinen and Michał Skrzypczak, in FSTTCS 2020.


• Regular Resynchronizability of Origin Transducers is Undecidable
  with Jan Martens, in MFCS 2020.


• Cyclic Proofs and Jumping Automata
  with Laureline Pinault and Damien Pous, in FSTTCS 2019.


• Eventually Safe Languages
  with Simon Iosti, in DLT 2019.


• Coinductive algorithms for Büchi automata
  with Laureline Pinault and Damien Pous, in DLT 2019.


• Kleene Algebra with Hypotheses
  with Amina Doumane, Damien Pous and Cécilia Pradic, in FoSSaCS 2019.


• Sensing as a Complexity Measure
  Survey paper on sensing,
  With Shaull Almagor and Orna Kupferman, in IJFCS 2019.
  Conference version in DFCS 2017.


• Computing the Width of Non-deterministic Automata
  With Anirban Majumdar, in LMCS 2019.
  Conference Version: Width of Non-deterministic Automata in STACS 2018 .


• Büchi Good-for-Games Automata are Efficiently Recognizable
  with Marc Bagnol, in FSTTCS 2018.


• Soundness in Negotiations
  With Javier Esparza, Anca Muscholl and Igor Walukiewicz, in LMCS 2018.
  Conference version in CONCUR 2016.


• Stamina: Stabilisation Monoids IN Automata theory
  Presenting the tool Stamina,
  with Nathanaël Fijalkow, Hugo Gimbert and Edon Kelmendi, in CIAA 2017.


• On Finite Domains in First-Order Linear Temporal Logic
  With Julien Brunel and David Chemouil, in ATVA 2016.


• Lightweight Specification and Analysis of Dynamic Systems with Rich Configurations
  Presenting the tool Electrum,
  with Nuno Macedo, Julien Brunel, David Chemouil and Alcino Cunha, in FSE 2016.


• Varieties of Cost Functions
  With Laure Daviaud and Jean-Éric Pin, in STACS 2016.


• Cost Functions Definable by Min/Max Automata
  With Thomas Colcombet, Amaldev Manuel and Szymon Toruńczyk, in STACS 2016.


• The Sensing Cost of Monitoring and Synthesis
  With Shaull Almagor and Orna Kupferman, in FSTTCS 2015.


• On Determinisation of Good-for-Games Automata
  With Michał Skrzypczak, in ICALP 2015.


• Trading Bounds for Memory in Games with Counters
  With Nathanaël Fijalkow, Florian Horn and Michał Skrzypczak, in ICALP 2015.


• Regular Sensing.
  With Saull Almagor and Orna Kupferman, in FSTTCS 2014.


• ACME: Automata with Counters, Monoids and Equivalence.
  Presenting the tool Acme,
  With Nathanaël Fijalkow, in ATVA 2014.


• Two-Way Cost Automata and Cost Logics over Infinite Trees.
  With Achim Blumensath, Thomas Colcombet, Paweł Parys and Michael Vanden Boom, in CSL-LICS 2014.


• Linear Temporal Logic for Regular Cost Functions.
  in LMCS 2014.
  This work contains an error: ERRATUM.
  Conference version in STACS 2011.


• Deciding the weak definability of Büchi definable tree languages.
  With Thomas Colcombet, Christof Löding, and Michael Vanden Boom, in CSL 2013.


• Nondeterminism in the Presence of a Diverse or Unknown Future.
  With Udi Boker, Orna Kupferman, and Michał Skrzypczak, in ICALP 2013.


• On the Expressive Power of Cost Logics over Infinite Words.
  With Michael Vanden Boom, in ICALP 2012.


• Quasi-Weak Cost Automata: A New Variant of Weakness.
  With Michael Vanden Boom, in FSTTCS 2011.


• Regular Temporal Cost Functions.
  With Thomas Colcombet and Sylvain Lombardy, in ICALP 2010.


• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.
  With Peter Dybjer, in Annals of Pure and Applied Logic, 2012.