2 citations · 5 across the 10 of their papers we have counts for
13 papers
Geometry of Reachability sets of Vector Addition Systems
Roland Guttenberg, Mikhail Raskin, Javier Esparza
Vector Addition Systems (VAS), aka Petri nets, are a popular model of concurrency. The reachability set of a VAS is the set of configurations reachable from the initial configurati…
Modular population protocols
Michael 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…
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…
Computing Parameterized Invariants of Parameterized Petri Nets
Javier Esparza, Mikhail Raskin, Christoph Welzel
A fundamental advantage of Petri net models is the possibility to automatically compute useful system invariants from the syntax of the net. Classical techniques used for this are…
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
In rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number such that all…
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…
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…
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…
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
M. Raskin
We present the first linear lower bound for the number of bits required to be accessed in the worst case to increment an integer in an arbitrary space- optimal binary representatio…