activity
20192021
most citedAbduction of trap invariants in parameterized systems

1 citations · 1 across the 3 of their papers we have counts for

collaborators

6 papers

cs.DC20211 cited

Abduction of trap invariants in parameterized systems

Javier Esparza, Mikhail Raskin, Christoph Welzel

In a previous paper we have presented a CEGAR approach for the verification of parameterized systems with an arbitrary number of processes organized in an array or a ring. The tech…

cs.DC2020

Constructive expressive power of population protocols

Mikhail Raskin

Population protocols are a model of distributed computation intended for the study of networks of independent computing agents with dynamic communication structure. Each agent has…

cs.LO2020

Flatness and Complexity of Immediate Observation Petri Nets

Mikhail Raskin, Chana Weil-Kennedy, Javier Esparza

In a previous paper we introduced immediate observation (IO) Petri nets, a class of interest in the study of population protocols and enzymatic chemical networks. In the first part…

cs.LO2019

The Complexity of Verifying Population Protocols

Javier Esparza, Stefan Jaax, Mikhail Raskin +1

Population protocols [Angluin et al., PODC, 2004] are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initia…

cs.LO2019

Parameterized Analysis of Immediate Observation Petri Nets

Javier Esparza, Mikhail Raskin, Chana Weil-Kennedy

We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In th…

math.OC2019

A Stay-in-a-Set Game without a Stationary Equilibrium

Kristoffer Arnsfelt Hansen, Mikhail Raskin

We give an example of a finite-state two-player turn-based stochastic game with safety objectives for both players which has no stationary Nash equilibrium. This answers an open qu…