TY - GEN
T1 - Automatic analysis of expected termination time for population protocols
AU - Blondin, Michael
AU - Esparza, Javier
AU - Kucera, Antonín
N1 - Publisher Copyright:
© Michael Blondin, Javier Esparza, and Antonín Ku era.
PY - 2018/8/1
Y1 - 2018/8/1
N2 - 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.
AB - 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.
KW - Expected termination time
KW - Performance analysis
KW - Phrases population protocols
UR - https://www.scopus.com/pages/publications/85053624297
U2 - 10.4230/LIPIcs.CONCUR.2018.33
DO - 10.4230/LIPIcs.CONCUR.2018.33
M3 - Conference contribution
AN - SCOPUS:85053624297
SN - 9783959770873
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 29th International Conference on Concurrency Theory, CONCUR 2018
A2 - Schewe, Sven
A2 - Zhang, Lijun
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 29th International Conference on Concurrency Theory, CONCUR 2018
Y2 - 4 September 2018 through 7 September 2018
ER -