2 citations · 2 across the 3 of their papers we have counts for
7 papers
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version)
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Efficient Restrictions of Immediate Observation Petri Nets
Michael Raskin, Chana Weil-Kennedy
In a previous paper we introduced immediate observation Petri nets, a subclass of Petri nets with application domains in distributed protocols (population protocols) and theoretica…
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…
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…