Michael Blondin

Orcid: 0000-0003-2914-2734

According to our database1, Michael Blondin authored at least 33 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Separators in Continuous Petri Nets.
Log. Methods Comput. Sci., 2024

Soundness of reset workflow nets.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Continuous One-counter Automata.
ACM Trans. Comput. Log., January, 2023

Verifying linear temporal specifications of constant-rate multi-mode systems.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Population Protocols with Unordered Data.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
The complexity of soundness in workflow nets.
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.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
The Complexity of Reachability in Affine Vector Addition Systems with States.
Log. Methods Comput. Sci., 2021

Affine Extensions of Integer Vector Addition Systems with States.
Log. Methods Comput. Sci., 2021

The Reachability Problem for Two-Dimensional Vector Addition Systems with States.
J. ACM, 2021

Towards efficient verification of population protocols.
Formal Methods Syst. Des., 2021

Directed Reachability for Infinite-State Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020
The ABCs of petri net reachability relaxations.
ACM SIGLOG News, 2020

Forward Analysis for WSTS, Part III: Karp-Miller Trees.
Log. Methods Comput. Sci., 2020

Succinct Population Protocols for Presburger Arithmetic.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Expressive Power of Oblivious Consensus Protocols.
CoRR, 2019

Expressive Power of Broadcast Consensus Protocols.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Handling infinitely branching well-structured transition systems.
Inf. Comput., 2018

Large Flocks of Small Birds: on the Minimal Size of Population Protocols.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Black Ninjas in the Dark: Formal Analysis of Population Protocols.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Affine Extensions of Integer Vector Addition Systems with States.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Automatic Analysis of Expected Termination Time for Population Protocols.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Peregrine: A Tool for the Analysis of Population Protocols.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
The Logical View on Continuous Petri Nets.
ACM Trans. Comput. Log., 2017

Well Behaved Transition Systems.
Log. Methods Comput. Sci., 2017

Logics for continuous reachability in Petri nets and vector addition systems with states.
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).
PhD thesis, 2016

The complexity of intersecting finite automata having few final states.
Comput. Complex., 2016

Approaching the Coverability Problem Continuously.
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.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Handling Infinitely Branching WSTS.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2012
The Complexity of Intersecting Finite Automata Having Few Final States.
Proceedings of the Computer Science - Theory and Applications, 2012


  Loading...