Mikhail Raskin

MaRDI QIDQ2025855zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Geometry of reachability sets of vector addition systems	2025-06-26	Paper
Vector TSP: a traveling salesperson problem with racetrack-like acceleration constraints Discrete Applied Mathematics	2025-04-17	Paper
Abduction of trap invariants in parameterized systems	2024-12-06	Paper
Regular model checking upside-down: an invariant-based approach	2024-08-13	Paper
Parameterized Analysis of Immediate Observation Petri Nets Application and Theory of Petri Nets and Concurrency	2024-01-29	Paper
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy Logical Methods in Computer Science	2023-10-23	Paper
Protocols with constant local storage and unreliable communication Theoretical Computer Science	2023-04-20	Paper
Computing Parameterized Invariants of Parameterized Petri Nets Fundamenta Informaticae	2022-10-31	Paper
Flatness and Complexity of Immediate Observation Petri Nets (available as arXiv preprint)	2022-07-18	Paper
Population protocols with unreliable communication (available as arXiv preprint)	2022-06-24	Paper
Computing parameterized invariants of parameterized Petri nets (available as arXiv preprint)	2022-03-21	Paper
A stay-in-a-set game without a stationary equilibrium	2022-01-06	Paper
A stay-in-a-set game without a stationary equilibrium (available as arXiv preprint)	2022-01-06	Paper
Finding cut-offs in leaderless rendez-vous protocols is easy (available as arXiv preprint)	2021-10-18	Paper
scientific article; zbMATH DE number 7407775 (Why is no real title available?) (available as arXiv preprint)	2021-10-08	Paper
scientific article; zbMATH DE number 7407775 (Why is no real title available?)	2021-10-08	Paper
scientific article; zbMATH DE number 7407773 (Why is no real title available?) (available as arXiv preprint)	2021-10-08	Paper
scientific article; zbMATH DE number 7407773 (Why is no real title available?)	2021-10-08	Paper
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton (available as arXiv preprint)	2021-07-28	Paper
The complexity of verifying population protocols Distributed Computing	2021-05-17	Paper
The complexity of reachability in affine vector addition systems with states Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science	2021-01-21	Paper
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model (available as arXiv preprint)	2020-05-27	Paper
A Stay-in-a-Set Game without a Stationary Equilibrium (available as arXiv preprint)	2019-03-28	Paper

Research outcomes over time

This page was built for person: Mikhail Raskin