The Complexity of Intersecting Finite Automata Having Few Final States. - Michael Blondin; Pierre McKenzie (CSR, 2012)

Handling Infinitely Branching WSTS. - Michael Blondin; Alain Finkel; Pierre McKenzie (ICALP (2), 2014)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (LICS, 2015)

Approaching the Coverability Problem Continuously. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (TACAS, 2016)

The complexity of intersecting finite automata having few final states. - Michael Blondin; Andreas Krebs; Pierre McKenzie (Comput. Complex., 2016)

Algorithmique et complexité des systèmes à compteurs. (Algorithmics and complexity of counter machines). - Michael Blondin (2016)

Logics for continuous reachability in Petri nets and vector addition systems with states. - Michael Blondin; Christoph Haase (LICS, 2017)

Well Behaved Transition Systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Log. Methods Comput. Sci., 2017)

The Logical View on Continuous Petri Nets. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (ACM Trans. Comput. Log., 2017)

Peregrine: A Tool for the Analysis of Population Protocols. - Michael Blondin; Javier Esparza; Stefan Jaax (CAV (1), 2018)

Automatic Analysis of Expected Termination Time for Population Protocols. - Michael Blondin; Javier Esparza; Antonín Kucera 001 (CONCUR, 2018)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki (CONCUR, 2018)

Black Ninjas in the Dark: Formal Analysis of Population Protocols. - Michael Blondin; Javier Esparza; Stefan Jaax; Antonín Kucera 001 (LICS, 2018)

Large Flocks of Small Birds: on the Minimal Size of Population Protocols. - Michael Blondin; Javier Esparza; Stefan Jaax (STACS, 2018)

Handling infinitely branching well-structured transition systems. - Michael Blondin; Alain Finkel; Pierre McKenzie (Inf. Comput., 2018)

Expressive Power of Broadcast Consensus Protocols. - Michael Blondin; Javier Esparza; Stefan Jaax (CONCUR, 2019)

Expressive Power of Oblivious Consensus Protocols. - Michael Blondin; Javier Esparza; Stefan Jaax (CoRR, 2019)

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. - Michael Blondin; Javier Esparza; Martin Helfrich; Antonín Kucera 001; Philipp J. Meyer (CAV (2), 2020)

Succinct Population Protocols for Presburger Arithmetic. - Michael Blondin; Javier Esparza; Blaise Genest; Martin Helfrich; Stefan Jaax (STACS, 2020)

Forward Analysis for WSTS, Part III: Karp-Miller Trees. - Michael Blondin; Alain Finkel; Jean Goubault-Larrecq (Log. Methods Comput. Sci., 2020)

The ABCs of petri net reachability relaxations. - Michael Blondin (ACM SIGLOG News, 2020)

Directed Reachability for Infinite-State Systems. - Michael Blondin; Christoph Haase; Philip Offtermatt (TACAS (2), 2021)

Towards efficient verification of population protocols. - Michael Blondin; Javier Esparza; Stefan Jaax; Philipp J. Meyer (Formal Methods Syst. Des., 2021)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki; Mikhail A. Raskin (Log. Methods Comput. Sci., 2021)

The Complexity of Reachability in Affine Vector Addition Systems with States. - Michael Blondin; Mikhail A. Raskin (Log. Methods Comput. Sci., 2021)

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (CAV (2), 2022)

The complexity of soundness in workflow nets. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (LICS, 2022)

Population Protocols with Unordered Data. - Michael Blondin; François Ladouceur (ICALP, 2023)

Verifying linear temporal specifications of constant-rate multi-mode systems. - Michael Blondin; Philip Offtermatt; Alex Sansfaçon-Buchanan (LICS, 2023)

Continuous One-counter Automata. - Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo A. Pérez 001 (ACM Trans. Comput. Log., 2023)

Soundness of reset workflow nets. - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (LICS, 2024)

Separators in Continuous Petri Nets. - Michael Blondin; Javier Esparza (Log. Methods Comput. Sci., 2024)

Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. - Michael Blondin; Michaël Cadilhac; Xin-Yi Cui; Philipp Czerner; Javier Esparza; Jakob Schulz (TACAS (3), 2025)