License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.33
URN: urn:nbn:de:0030-drops-95711
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9571/
Go to the corresponding LIPIcs Volume Portal

Blondin, Michael ; Esparza, Javier ; Kucera, Antonín

Automatic Analysis of Expected Termination Time for Population Protocols

pdf-format:
LIPIcs-CONCUR-2018-33.pdf (0.6 MB)

Abstract

Population protocols are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinite sequences of interactions in which the interacting devices are chosen uniformly at random.
In well designed population protocols, for every initial configuration of devices, and for every computation starting at this configuration, all devices eventually agree on a consensus value. We address the problem of automatically computing a parametric bound on the expected time the protocol needs to reach this consensus. We present the first algorithm that, when successful, outputs a function f(n) such that the expected time to consensus is bound by O(f(n)), where n is the number of devices executing the protocol. We experimentally show that our algorithm terminates and provides good bounds for many of the protocols found in the literature.

BibTeX - Entry

@InProceedings{blondin_et_al:LIPIcs:2018:9571,
  author =	{Michael Blondin and Javier Esparza and Anton{\'i}n Kucera},
  title =	{{Automatic Analysis of Expected Termination Time for Population Protocols}},
  booktitle =	{29th International Conference on Concurrency Theory  (CONCUR 2018)},
  pages =	{33:1--33:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Sven Schewe and Lijun Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9571},
  URN =		{urn:nbn:de:0030-drops-95711},
  doi =		{10.4230/LIPIcs.CONCUR.2018.33},
  annote =	{Keywords: population protocols, performance analysis, expected termination time}
}

Keywords: population protocols, performance analysis, expected termination time
Collection: 29th International Conference on Concurrency Theory (CONCUR 2018)
Issue Date: 2018
Date of publication: 31.08.2018
Supplementary Material: Source code: https://github.com/blondimi/pp-time-analysis.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI