Michael Blondin

According to our database, Michael Blondin authored at least 32 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Separators in Continuous Petri Nets.

Michael Blondin, Javier Esparza

Log. Methods Comput. Sci., 2024

2023

Continuous One-counter Automata.

Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez

ACM Trans. Comput. Log., January, 2023

Verifying linear temporal specifications of constant-rate multi-mode systems.

Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan

LICS, 2023

Population Protocols with Unordered Data.

Michael Blondin, François Ladouceur

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

The complexity of soundness in workflow nets.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations.

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

The Complexity of Reachability in Affine Vector Addition Systems with States.

Michael Blondin, Mikhail A. Raskin

Log. Methods Comput. Sci., 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 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

Towards efficient verification of population protocols.

Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer

Formal Methods Syst. Des., 2021

Directed Reachability for Infinite-State Systems.

Michael Blondin, Christoph Haase, Philip Offtermatt

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020

The ABCs of petri net reachability relaxations.

Michael Blondin

ACM SIGLOG News, 2020

Forward Analysis for WSTS, Part III: Karp-Miller Trees.

Michael Blondin, Alain Finkel, Jean Goubault-Larrecq

Log. Methods Comput. Sci., 2020

Succinct Population Protocols for Presburger Arithmetic.

Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling.

Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019

Expressive Power of Oblivious Consensus Protocols.

Michael Blondin, Javier Esparza, Stefan Jaax

CoRR, 2019

Expressive Power of Broadcast Consensus Protocols.

Michael Blondin, Javier Esparza, Stefan Jaax

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Handling infinitely branching well-structured transition systems.

Michael Blondin, Alain Finkel, Pierre McKenzie

Inf. Comput., 2018

Large Flocks of Small Birds: on the Minimal Size of Population Protocols.

Michael Blondin, Javier Esparza, Stefan Jaax

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 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, 2018

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Automatic Analysis of Expected Termination Time for Population Protocols.

Michael Blondin, Javier Esparza, Antonín Kucera

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Peregrine: A Tool for the Analysis of Population Protocols.

Michael Blondin, Javier Esparza, Stefan Jaax

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

The Logical View on Continuous Petri Nets.

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad

ACM Trans. Comput. Log., 2017

Well Behaved Transition Systems.

Michael Blondin, Alain Finkel, Pierre McKenzie

Log. Methods Comput. Sci., 2017

Logics for continuous reachability in Petri nets and vector addition systems with states.

Michael Blondin, Christoph Haase

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

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

Michael Blondin

PhD thesis, 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

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

2015

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.

Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Handling Infinitely Branching WSTS.

Michael Blondin, Alain Finkel, Pierre McKenzie

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2012

The Complexity of Intersecting Finite Automata Having Few Final States.

Michael Blondin, Pierre McKenzie

Proceedings of the Computer Science - Theory and Applications, 2012