A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of n agents modeled as identical finite-state machines. In each time step, a pair of agents is selected uniformly at random to interact. In an interaction, agents update their states according to a common transition function. We empirically and analytically analyze two classes of simulators for this model. First, we consider sequential simulators executing onearXiv:2005.03584v1 fatcat:dwxl5y53lrcrznwpkvxf6cdmpy