Brief Announcement: Decidable Graph Languages by Mediated Population Protocols

2009 ◽  
pp. 239-240 ◽  
Author(s):  
Ioannis Chatzigiannakis ◽  
Othon Michail ◽  
Paul G. Spirakis
Keyword(s):  
Population Protocols ◽  
Graph Languages

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

scholarly journals Time-Optimal Self-Stabilizing Leader Election in Population Protocols

2021 ◽  
Author(s):  
Janna Burman ◽  
Ho-Lin Chen ◽  
Hsueh-Ping Chen ◽  
David Doty ◽  
Thomas Nowak ◽  
...  
Keyword(s):  
Leader Election ◽  
Population Protocols ◽  
Time Optimal

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

2021 ◽  
Vol 68 (1) ◽  
pp. 1-21
Author(s):  
Leszek Gąsieniec ◽  
Grzegorz Stachowiak
Keyword(s):  
Leader Election ◽  
Population Protocols

scholarly journals Combinatorial properties of boundary NLC graph languages

1987 ◽  
Vol 16 (1) ◽  
pp. 59-73 ◽  
Author(s):  
Grzegorz Rozenberg ◽  
Emo Welzl
Keyword(s):  
Combinatorial Properties ◽  
Graph Languages

scholarly journals Stable leader election in population protocols requires linear time

2016 ◽  
Vol 31 (4) ◽  
pp. 257-271 ◽  
Author(s):  
David Doty ◽  
David Soloveichik
Keyword(s):  
Linear Time ◽  
Leader Election ◽  
Population Protocols

The Power of Global Knowledge on Self-stabilizing Population Protocols

2020 ◽  
pp. 237-254 ◽  
Author(s):  
Yuichi Sudo ◽  
Masahiro Shibata ◽  
Junya Nakamura ◽  
Yonghwan Kim ◽  
Toshimitsu Masuzawa
Keyword(s):  
Global Knowledge ◽  
Population Protocols

scholarly journals Leader Election Requires Logarithmic Time in Population Protocols

2020 ◽  
Vol 30 (01) ◽  
pp. 2050005 ◽  
Author(s):  
Yuichi Sudo ◽  
Toshimitsu Masuzawa
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Leader Election ◽  
Stabilization Time ◽  
Population Protocols ◽  
Population Protocol ◽  
Time Optimal ◽  
Exact Size

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.

Sign in / Sign up

Export Citation Format

Share Document