Mikhail A. Raskin

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 31

Top Topics

Projective Invariants

Top Venues

Log. Methods Comput. Sci.

Publications

Roland Guttenberg, Mikhail A. Raskin, Javier Esparza
Geometry of Reachability Sets of Vector Addition Systems. CONCUR (2023)
Mikhail A. Raskin
Protocols with constant local storage and unreliable communication. Theor. Comput. Sci. 940 (Part) (2023)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. Log. Methods Comput. Sci. 19 (4) (2023)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Regular Model Checking Upside-Down: An Invariant-Based Approach. CONCUR (2022)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Regular Model Checking Upside-Down: An Invariant-Based Approach. CoRR (2022)
Roland Guttenberg, Mikhail A. Raskin
Geometry of VAS reachability sets. CoRR (2022)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. Fundam. Informaticae 187 (2-4) (2022)
Mikhail A. Raskin
Population Protocols with Unreliable Communication. ALGOSENSORS (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. Petri Nets (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Computing Parameterized Invariants of Parameterized Petri Nets. CoRR (2021)
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
The complexity of verifying population protocols. Distributed Comput. 34 (2) (2021)
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
Abduction of trap invariants in parameterized systems. GandALF (2021)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS (2021)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17 (3) (2021)
Mikhail A. Raskin
Modular population protocols. CoRR (2021)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. 17 (3) (2021)
Mikhail A. Raskin
Constructive expressive power of population protocols. CoRR (2020)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR (2020)
Mikhail A. Raskin, Chana Weil-Kennedy
On the Flatness of Immediate Observation Petri Nets. CoRR (2020)
Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza
Flatness and Complexity of Immediate Observation Petri Nets. CONCUR (2020)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. LICS (2020)
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets (2019)
Kristoffer Arnsfelt Hansen, Mikhail A. Raskin
A Stay-in-a-Set Game without a Stationary Equilibrium. GandALF (2019)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. CoRR (2019)
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
Parameterized Analysis of Immediate Observation Petri Nets. CoRR (2019)
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
The Complexity of Verifying Population Protocols. CoRR (2019)
Mikhail A. Raskin
Population protocols with unreliable communication. CoRR (2019)
Michael Blondin, Mikhail A. Raskin
The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR (2019)
Mikhail A. Raskin
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. ICALP (2018)
Mikhail A. Raskin
A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model. ICALP (2017)
Mikhail A. Raskin
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model. CoRR (2016)