%0 Conference Paper %1 conf/concur/BlondinEK18 %A Blondin, Michael %A Esparza, Javier %A Kucera, Antonín %B 29th International Conference on Concurrency Theory (CONCUR 2018) %D 2018 %E Schewe, Sven %E Zhang, Lijun %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik %K conference %P 33:1-33:16 %R 10.4230/LIPIcs.CONCUR.2018.33 %T Automatic Analysis of Expected Termination Time for Population Protocols. %U https://drops.dagstuhl.de/opus/volltexte/2018/9571/ %V 118 %X 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. %@ 978-3-95977-087-3

@inproceedings{conf/concur/BlondinEK18, 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. }, added-at = {2018-10-16T15:51:04.000+0200}, author = {Blondin, Michael and Esparza, Javier and Kucera, Antonín}, biburl = {https://www.bibsonomy.org/bibtex/2607dd008376507b394f0f3f93b67a555/paves}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, crossref = {conf/concur/2018}, doi = {10.4230/LIPIcs.CONCUR.2018.33}, editor = {Schewe, Sven and Zhang, Lijun}, ee = {http://dx.doi.org/10.4230/LIPIcs.CONCUR.2018.33}, interhash = {e94d2955f7e1293f84cc6c523df0532f}, intrahash = {607dd008376507b394f0f3f93b67a555}, isbn = {978-3-95977-087-3}, keywords = {conference}, note = {https://arxiv.org/abs/1807.00331}, pages = {33:1-33:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, timestamp = {2023-09-24T19:46:53.000+0200}, title = {Automatic Analysis of Expected Termination Time for Population Protocols.}, url = {https://drops.dagstuhl.de/opus/volltexte/2018/9571/}, volume = 118, year = 2018 }