Michael Blondin

Available identifiers

zbMath Open blondin.michaelMaRDI QIDQ347112

List of research outcomes

Publication	Date of Publication	Type
Separators in Continuous Petri Nets	2024-03-11	Paper
Separators in continuous Petri nets	2024-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q6091631	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
Towards efficient verification of population protocols	2021-12-08	Paper
Directed reachability for infinite-state systems	2021-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q5155662	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5155664	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5009428	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	2021-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q5144614	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5136306	2020-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q3304110	2020-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5114831	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
Towards efficient verification of population protocols	2017-10-11	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

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael Blondin