research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleAlgorithmic Verification of Population Protocols
Bibtex cite IDRACTI-RU1-2010-25
Booktitle 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
Series LNCS
Year published 2010
Month September
Volume 6366/2010
Pages 221-235
Publisher Springer-Verlag Berlin Heidelberg
Location New York City, USA
DOI 10.1007/978-3-642-16023-3_19
Keywords protocol verification,population protocol,np-hard,verifier
In this work, we study the Population Protocol model of Angluin et al. from the perspective of protocol verification. In particular, we are interested in algorithmically solving the problem of determining whether a given population protocol conforms to its specifications. Since this is the first work on verification of population protocols, we redefine most notions of population protocols in order to make them suitable for algorithmic verification. Moreover, we formally define the general verification problem and some interesting special cases. All these problems are shown to be NP-hard. We next propose some first algorithmic solutions for a natural special case. Finally, we conduct experiments and algorithmic engineering in order to improve our verifiers' running times.
Chatzigiannakis, Ioannis
Michail, Othon
Spirakis, Paul
ver-sss10.pdf (main file)
Publication ID768