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 (Tools and Algorithms for the Construction and Analysis of Systems - 31st International Conference, TACAS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3-8, 2025, Proceedings, Part III, 2025)

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

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

Soundness of reset workflow nets - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024, 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 (CoRR, 2024)

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

Population Protocols with Unordered Data - Michael Blondin; François Ladouceur (50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, 2023)

Verifying linear temporal specifications of constant-rate multi-mode systems - Michael Blondin; Philip Offtermatt; Alex Sansfaçon-Buchanan (38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, Boston, MA, USA, June 26-29, 2023, 2023)

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

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

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (Computer Aided Verification - 34th International Conference, CAV 2022, Haifa, Israel, August 7-10, 2022, Proceedings, Part II, 2022)

Separators in Continuous Petri Nets - Michael Blondin; Javier Esparza (Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, 2022)

The complexity of soundness in workflow nets - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, 2022)

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

Verifying generalised and structural soundness of workflow nets via relaxations - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (CoRR, 2022)

Separators in Continuous Petri Nets - Michael Blondin; Javier Esparza (CoRR, 2022)

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; 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)

Continuous One-Counter Automata - Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo A. Pérez (36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, 2021)

Directed Reachability for Infinite-State Systems - Michael Blondin; Christoph Haase; Philip Offtermatt (Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part II, 2021)

Continuous One-Counter Automata - Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo A. Pérez (CoRR, 2021)

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)

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling - Michael Blondin; Javier Esparza; Martin Helfrich; Antonín Kucera; Philipp J. Meyer (Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II, 2020)

The Complexity of Reachability in Affine Vector Addition Systems with States - Michael Blondin; Mikhail A. Raskin (LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, 2020)

Succinct Population Protocols for Presburger Arithmetic - Michael Blondin; Javier Esparza; Blaise Genest; Martin Helfrich; Stefan Jaax (37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, 2020)

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

Directed Reachability for Infinite-State Systems - Michael Blondin; Christoph Haase; Philip Offtermatt (CoRR, 2020)

Expressive Power of Broadcast Consensus Protocols - Michael Blondin; Javier Esparza; Stefan Jaax (30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands, 2019)

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

The Complexity of Reachability in Affine Vector Addition Systems with States - Michael Blondin; Mikhail A. Raskin (CoRR, 2019)

Affine Extensions of Integer Vector Addition Systems with States - Michael Blondin; Christoph Haase; Filip Mazowiecki; Mikhail A. Raskin (CoRR, 2019)

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

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

Peregrine: A Tool for the Analysis of Population Protocols - Michael Blondin; Javier Esparza; Stefan Jaax (Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I, 2018)

Affine Extensions of Integer Vector Addition Systems with States - Michael Blondin; Christoph Haase; Filip Mazowiecki (29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018)

Automatic Analysis of Expected Termination Time for Population Protocols - Michael Blondin; Javier Esparza; Antonín Kucera (29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, 2018)

Black Ninjas in the Dark: Formal Analysis of Population Protocols - Michael Blondin; Javier Esparza; Stefan Jaax; Antonín Kucera (Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018)

Large Flocks of Small Birds: on the Minimal Size of Population Protocols - Michael Blondin; Javier Esparza; Stefan Jaax (35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, 2018)

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

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

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)

Forward Analysis for WSTS, Part III: Karp-Miller Trees - Michael Blondin; Alain Finkel; Jean Goubault-Larrecq (37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, 2017)

Logics for continuous reachability in Petri nets and vector addition systems with states - Michael Blondin; Christoph Haase (32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, 2017)

Towards Efficient Verification of Population Protocols - Michael Blondin; Javier Esparza; Stefan Jaax; Philipp J. Meyer (Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, 2017)

Towards Efficient Verification of Population Protocols - Michael Blondin; Stefan Jaax; Javier Esparza; Philipp J. Meyer (CoRR, 2017)

Forward Analysis for WSTS, Part III: Karp-Miller Trees - Michael Blondin; Alain Finkel; Jean Goubault-Larrecq (CoRR, 2017)

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

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

Approaching the Coverability Problem Continuously - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, 2016)

Well Behaved Transition Systems - Michael Blondin; Alain Finkel; Pierre McKenzie (CoRR, 2016)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, 2015)

Approaching the Coverability Problem Continuously - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (CoRR, 2015)

Handling Infinitely Branching WSTS - Michael Blondin; Alain Finkel; Pierre McKenzie (Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014)

Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (CoRR, 2014)

The Complexity of Intersecting Finite Automata Having Few Final States - Michael Blondin; Pierre McKenzie (Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings, 2012)

The Complexity of Intersecting Finite Automata Having Few Final States - Michael Blondin; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2012)