The Complexity of Verifying Population Protocols
Preprint
Abstract
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 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 non-elementary 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 ${\Pi}_2^p$ to PSPACE.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Recent Algorithmic Advances in Population ProtocolsACM SIGACT News, 2018
- Probability 1 computation with chemical reaction networksNatural Computing, 2015
- Guidelines for the Verification of Population Protocols2011
- Algorithmic Verification of Population Protocols2010
- Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networksNatural Computing, 2009
- PAT: Towards Flexible Verification under Fairness2009
- On Automatic Verification of Self-Stabilizing Population Protocols2008
- The computational power of population protocolsDistributed Computing, 2007
- Complexity results for 1-safe netsTheoretical Computer Science, 1995
- The polynomial-time hierarchyTheoretical Computer Science, 1976