2 citations · 5 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
The Complexity of Reachability in Affine Vector Addition Systems with States
Michael Blondin, Mikhail Raskin
Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches…
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…
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…
Population protocols with unreliable communication
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…