首页    期刊浏览 2025年05月01日 星期四
登录注册

文章基本信息

  • 标题:Automatic Analysis of Expected Termination Time for Population Protocols
  • 本地全文:下载
  • 作者:Michael Blondin ; Javier Esparza ; Anton{\'i}n Kucera
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2018
  • 卷号:118
  • 页码:1-16
  • DOI:10.4230/LIPIcs.CONCUR.2018.33
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:population protocols; performance analysis; expected termination time
国家哲学社会科学文献中心版权所有