Michael Blondin

Available identifiers

zbMath Open blondin.michaelMaRDI QIDQ347112

List of research outcomes

Publication	Date of Publication	Type
The complexity of soundness in workflow nets	2024-12-06	Paper
Population protocols with unordered data	2024-11-14	Paper
Separators in Continuous Petri Nets	2024-03-11	Paper
Separators in continuous Petri nets	2024-01-23	Paper
Automata theory. An algorithmic approach	2023-11-24	Paper
Succinct Population Protocols for Presburger Arithmetic	2023-02-07	Paper
Continuous One-counter Automata	2023-02-07	Paper
Expressive Power of Broadcast Consensus Protocols	2023-02-03	Paper
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	2022-12-08	Paper
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations	2022-12-07	Paper
Directed reachability for infinite-state systems	2021-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q5155664	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5155662	2021-10-08	Paper
Affine extensions of integer vector addition systems with states	2021-08-04	Paper
Automatic analysis of expected termination time for population protocols	2021-08-04	Paper
Checking qualitative liveness properties of replicated systems with stochastic scheduling	2021-02-09	Paper
The complexity of reachability in affine vector addition systems with states	2021-01-21	Paper
Black Ninjas in the dark: formal analysis of population protocols	2021-01-20	Paper
Logics for continuous reachability in Petri nets and vector addition systems with states	2021-01-19	Paper
Forward analysis for WSTS. III: Karp-Miller trees	2020-11-25	Paper
Large flocks of small birds: on the minimal size of population protocols	2020-08-05	Paper
Forward analysis for WSTS. III: Karp-Miller trees	2020-06-26	Paper
Approaching the coverability problem continuously	2019-09-17	Paper
Reachability in two-dimensional vector addition systems with states is PSPACE-complete	2018-04-23	Paper
Handling infinitely branching well-structured transition systems	2017-12-20	Paper
The logical view on continuous Petri nets	2017-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q5367063	2017-10-12	Paper
The complexity of intersecting finite automata having few final states	2016-11-30	Paper
Handling infinitely branching WSTS	2014-07-01	Paper
The complexity of intersecting finite automata having few final states	2012-09-10	Paper

Research outcomes over time

This page was built for person: Michael Blondin