Michael Blondin

From MaRDI portal
Person:347112

Available identifiers

zbMath Open blondin.michaelMaRDI QIDQ347112

List of research outcomes





PublicationDate of PublicationType
The complexity of soundness in workflow nets2024-12-06Paper
Population protocols with unordered data2024-11-14Paper
Separators in Continuous Petri Nets2024-03-11Paper
Separators in continuous Petri nets2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q60916312023-11-24Paper
Succinct Population Protocols for Presburger Arithmetic2023-02-07Paper
Continuous One-counter Automata2023-02-07Paper
Expressive Power of Broadcast Consensus Protocols2023-02-03Paper
The Reachability Problem for Two-Dimensional Vector Addition Systems with States2022-12-08Paper
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations2022-12-07Paper
Towards efficient verification of population protocols2021-12-08Paper
Directed reachability for infinite-state systems2021-10-18Paper
https://portal.mardi4nfdi.de/entity/Q51556642021-10-08Paper
https://portal.mardi4nfdi.de/entity/Q51556622021-10-08Paper
https://portal.mardi4nfdi.de/entity/Q50094282021-08-04Paper
Automatic Analysis of Expected Termination Time for Population Protocols2021-08-04Paper
Checking qualitative liveness properties of replicated systems with stochastic scheduling2021-02-09Paper
The Complexity of Reachability in Affine Vector Addition Systems with States2021-01-21Paper
Black Ninjas in the Dark2021-01-20Paper
https://portal.mardi4nfdi.de/entity/Q51446142021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51363062020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q33041102020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q51148312020-06-26Paper
Approaching the coverability problem continuously2019-09-17Paper
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete2018-04-23Paper
Handling infinitely branching well-structured transition systems2017-12-20Paper
The Logical View on Continuous Petri Nets2017-10-16Paper
https://portal.mardi4nfdi.de/entity/Q53670632017-10-12Paper
Towards efficient verification of population protocols2017-10-11Paper
The complexity of intersecting finite automata having few final states2016-11-30Paper
Handling Infinitely Branching WSTS2014-07-01Paper
The Complexity of Intersecting Finite Automata Having Few Final States2012-09-10Paper

Research outcomes over time

This page was built for person: Michael Blondin