2 citations · 5 across the 10 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.LO2020★ 1 cited
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…
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…