
Lower Bounds on the State Complexity of Population Protocols
Population protocols are a model of computation in which an arbitrary nu...
read it

Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs
We present a new version of Peregrine, the tool for the analysis and par...
read it

Verification of Immediate Observation Population Protocols
Population protocols (Angluin et al., PODC, 2004) are a formal model of ...
read it

Population Protocols for Graph Class Identification Problems
In this paper, we focus on graph class identification problems in the po...
read it

Simple and Fast Distributed Computation of Betweenness Centrality
Betweenness centrality is a graph parameter that has been successfully a...
read it

Approximate Majority With Catalytic Inputs
Thirdstate dynamics (Angluin et al. 2008; Perron et al. 2009) is a well...
read it

On the Necessary Memory to Compute the Plurality in MultiAgent Systems
We consider the RelativeMajority Problem (also known as Plurality), in ...
read it
The Complexity of Verifying Population Protocols
Population protocols [Angluin et al., PODC, 2004] are a model of distributed computation in which indistinguishable, finitestate agents interact in pairs to decide if their initial configuration, i.e., the initial number of agents in each state, satisfies a given property. In a seminal paper Angluin et al. classified population protocols according to their communication mechanism, and conducted an exhaustive study of the expressive power of each class, that is, of the properties they can decide [Angluin et al., Distributed Computing, 2007]. In this paper we study the correctness problem for population protocols, i.e., whether a given protocol decides a given property. A previous paper [Esparza et al., Acta Informatica, 2017] has shown that the problem is decidable for the main population protocol model, but at least as hard as the reachability problem for Petri nets, which has recently been proved to have nonelementary complexity. Motivated by this result, we study the computational complexity of the correctness problem for all other classes introduced by Angluin et al., some of which are less powerful than the main model. Our main results show that for the class of observation models the complexity of the problem is much lower, ranging from Π_2^p to PSPACE.
READ FULL TEXT
Comments
There are no comments yet.