| 2026 | ICALP | Population Protocols over Ordered Agents. | Michael Blondin, Michal Cadilhac, Benjamin Courchesne, Lucie Guillou, Corto Mascle, Isa Vialard |
| 2025 | TACAS | Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. | Michael Blondin, Michal Cadilhac, Xin-Yi Cui, Philipp Czerner, Javier Esparza, Jakob Schulz |
| 2024 | LICS | Soundness of reset workflow nets. | Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2023 | ICALP | Population Protocols with Unordered Data. | Michael Blondin, Franois Ladouceur |
| 2023 | LICS | Verifying linear temporal specifications of constant-rate multi-mode systems. | Michael Blondin, Philip Offtermatt, Alex Sansfaon-Buchanan |
| 2022 | CAV | Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. | Michael Blondin, Filip Mazowiecki, Philip Offtermatt |
| 2022 | FOSSACS | Separators in Continuous Petri Nets. | Michael Blondin, Javier Esparza |
| 2022 | LICS | The complexity of soundness in workflow nets. | Michael Blondin, Filip Mazowiecki, Philip Offtermatt |
| 2021 | LICS | Continuous One-Counter Automata. | Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Prez |
| 2021 | TACAS | Directed Reachability for Infinite-State Systems. | Michael Blondin, Christoph Haase, Philip Offtermatt |
| 2020 | CAV | Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. | Michael Blondin, Javier Esparza, Martin Helfrich, Antonn Kucera, Philipp J. Meyer |
| 2020 | LICS | The Complexity of Reachability in Affine Vector Addition Systems with States. | Michael Blondin, Mikhail A. Raskin |
| 2020 | STACS | Succinct Population Protocols for Presburger Arithmetic. | Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax |
| 2019 | CONCUR | Expressive Power of Broadcast Consensus Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax |
| 2018 | CAV | Peregrine: A Tool for the Analysis of Population Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax |
| 2018 | CONCUR | Automatic Analysis of Expected Termination Time for Population Protocols. | Michael Blondin, Javier Esparza, Antonn Kucera |
| 2018 | CONCUR | Affine Extensions of Integer Vector Addition Systems with States. | Michael Blondin, Christoph Haase, Filip Mazowiecki |
| 2018 | LICS | Black Ninjas in the Dark: Formal Analysis of Population Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax, Antonn Kucera |
| 2018 | STACS | Large Flocks of Small Birds: on the Minimal Size of Population Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax |
| 2017 | LICS | Logics for continuous reachability in Petri nets and vector addition systems with states. | Michael Blondin, Christoph Haase |
| 2017 | PODC | Towards Efficient Verification of Population Protocols. | Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer |
| 2016 | TACAS | Approaching the Coverability Problem Continuously. | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
| 2015 | LICS | Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. | Michael Blondin, Alain Finkel, Stefan Gller, Christoph Haase, Pierre McKenzie |
| 2014 | ICALP | Handling Infinitely Branching WSTS. | Michael Blondin, Alain Finkel, Pierre McKenzie |
| 2012 | CSR | The Complexity of Intersecting Finite Automata Having Few Final States. | Michael Blondin, Pierre McKenzie |