Michael Blondin

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 50

Top Venues

CoRR

LICS

Log. Methods Comput. Sci.

CONCUR

University of Paris-Saclay, France (PHD)

Education History

University of Paris-Saclay, France

PHD

Publications

Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. Log. Methods Comput. Sci. 20 (1) (2024)
Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Soundness of reset workflow nets. LICS (2024)
Michael Blondin, François Ladouceur
Population Protocols with Unordered Data. CoRR (2023)
Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan
Verifying linear temporal specifications of constant-rate multi-mode systems. CoRR (2023)
Michael Blondin, François Ladouceur
Population Protocols with Unordered Data. ICALP (2023)
Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan
Verifying linear temporal specifications of constant-rate multi-mode systems. LICS (2023)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-counter Automata. ACM Trans. Comput. Log. 24 (1) (2023)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
The complexity of soundness in workflow nets. LICS (2022)
Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. CoRR (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Verifying generalised and structural soundness of workflow nets via relaxations. CoRR (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) (2022)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
The complexity of soundness in workflow nets. CoRR (2022)
Michael Blondin, Javier Esparza
Separators in Continuous Petri Nets. FoSSaCS (2022)
Michael Blondin, Christoph Haase, Philip Offtermatt
Directed Reachability for Infinite-State Systems. TACAS (2) (2021)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-Counter Automata. CoRR (2021)
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
Continuous One-Counter Automata. LICS (2021)
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57 (3) (2021)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17 (3) (2021)
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68 (5) (2021)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. 17 (3) (2021)
Michael Blondin, Christoph Haase, Philip Offtermatt
Directed Reachability for Infinite-State Systems. CoRR (2020)
Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR (2020)
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Succinct Population Protocols for Presburger Arithmetic. STACS (2020)
Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) (2020)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16 (2) (2020)
Michael Blondin
The ABCs of petri net reachability relaxations. ACM SIGLOG News 7 (3) (2020)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. LICS (2020)
Michael Blondin, Javier Esparza, Stefan Jaax
Expressive Power of Oblivious Consensus Protocols. CoRR (2019)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. CoRR (2019)
Michael Blondin, Javier Esparza, Stefan Jaax
Expressive Power of Broadcast Consensus Protocols. CONCUR (2019)
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
Succinct Population Protocols for Presburger Arithmetic. CoRR (2019)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR (2019)
Michael Blondin, Alain Finkel, Pierre McKenzie
Handling infinitely branching well-structured transition systems. Inf. Comput. 258 (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR (2018)
Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS (2018)
Michael Blondin, Christoph Haase, Filip Mazowiecki
Affine Extensions of Integer Vector Addition Systems with States. CONCUR (2018)
Michael Blondin, Javier Esparza, Antonín Kucera
Automatic Analysis of Expected Termination Time for Population Protocols. CONCUR (2018)
Michael Blondin, Javier Esparza, Antonín Kucera
Automatic Analysis of Expected Termination Time for Population Protocols. CoRR (2018)
Michael Blondin, Javier Esparza, Stefan Jaax
Peregrine: A Tool for the Analysis of Population Protocols. CAV (1) (2018)
Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer
Towards Efficient Verification of Population Protocols. CoRR (2017)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18 (3) (2017)
Michael Blondin, Alain Finkel, Pierre McKenzie
Well Behaved Transition Systems. Log. Methods Comput. Sci. 13 (3) (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS (2017)
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer
Towards Efficient Verification of Population Protocols. PODC (2017)
Michael Blondin, Christoph Haase
Logics for continuous reachability in Petri nets and vector addition systems with states. LICS (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR (2017)
Michael Blondin, Andreas Krebs, Pierre McKenzie
The complexity of intersecting finite automata having few final states. Comput. Complex. 25 (4) (2016)
Michael Blondin, Alain Finkel, Pierre McKenzie
Well Behaved Transition Systems. CoRR (2016)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. TACAS (2016)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS (2015)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. CoRR (2015)
Michael Blondin, Alain Finkel, Pierre McKenzie
Handling Infinitely Branching WSTS. ICALP (2) (2014)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR (2014)
Michael Blondin, Andreas Krebs, Pierre McKenzie
The Complexity of Intersecting Finite Automata Having Few Final States. Electron. Colloquium Comput. Complex. 19 (2012)
Michael Blondin, Pierre McKenzie
The Complexity of Intersecting Finite Automata Having Few Final States. CSR (2012)

Michael Blondin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Blondin