Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Population Protocols with Unordered Data (2305.00872v2)

Published 1 May 2023 in cs.DC and cs.LO

Abstract: Population protocols form a well-established model of computation of passively mobile anonymous agents with constant-size memory. It is well known that population protocols compute Presburger-definable predicates, such as absolute majority and counting predicates. In this work, we initiate the study of population protocols operating over arbitrarily large data domains. More precisely, we introduce population protocols with unordered data as a formalism to reason about anonymous crowd computing over unordered sequences of data. We first show that it is possible to determine whether an unordered sequence from an infinite data domain has a datum with absolute majority. We then establish the expressive power of the immediate observation restriction of our model, namely where, in each interaction, an agent observes another agent who is unaware of the interaction.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235–253, 2006.
  2. The computational power of population protocols. Distributed Computing, 20(4):279–304, 2007.
  3. Population protocols for exact plurality consensus: How a small chance of failure helps to eliminate insignificant opinions. In Proc. 41𝑠𝑡superscript41𝑠𝑡\text{41}^{\text{st}}41 start_POSTSUPERSCRIPT st end_POSTSUPERSCRIPT ACM Symposium on Principles of Distributed Computing (PODC), pages 224–234, 2022.
  4. Loosely-stabilizing phase clocks and the adaptive majority problem. In Proc. 1𝑠𝑡superscript1𝑠𝑡\text{1}^{\text{st}}1 start_POSTSUPERSCRIPT st end_POSTSUPERSCRIPT Symposium on Algorithmic Foundations of Dynamic Networks (SAND), pages 7:1–7:17, 2022.
  5. A population protocol for exact majority with O⁢(log5/3⁡n)𝑂superscript53𝑛{O}(\log^{5/3}n)italic_O ( roman_log start_POSTSUPERSCRIPT 5 / 3 end_POSTSUPERSCRIPT italic_n ) stabilization time and Θ⁢(log⁡n)Θ𝑛{\Theta}(\log n)roman_Θ ( roman_log italic_n ) states. In Proc. 32𝑛𝑑superscript32𝑛𝑑\text{32}^{\text{nd}}32 start_POSTSUPERSCRIPT nd end_POSTSUPERSCRIPT International Symposium on Distributed Computing (DISC), pages 10:1–10:18, 2018.
  6. Succinct population protocols for Presburger arithmetic. In Proc. 37𝑡ℎsuperscript37𝑡ℎ\text{37}^{\text{th}}37 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Symposium on Theoretical Aspects of Computer Science (STACS), pages 40:1–40:15, 2020.
  7. Towards efficient verification of population protocols. Formal Methods in System Design (FMSD), 57(3):305–342, 2021.
  8. Two-variable logic on data words. ACM Transactions on Computational Logic (TOCL), 12(4):27:1–27:26, 2011.
  9. Identifiers in registers – describing network algorithms with logic. In Proc. 22𝑛𝑑superscript22𝑛𝑑\text{22}^{\text{nd}}22 start_POSTSUPERSCRIPT nd end_POSTSUPERSCRIPT International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), pages 115–132, 2019.
  10. Reachability in distributed memory automata. In Proc. 29𝑡ℎsuperscript29𝑡ℎ\text{29}^{\text{th}}29 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT EACSL Annual Conference on Computer Science Logic (CSL), pages 13:1–13:16, 2021.
  11. Mjrty: A fast majority vote algorithm. In Automated Reasoning: Essays in Honor of Woody Bledsoe, 1991.
  12. Fast and succinct population protocols for Presburger arithmetic. In Proc. 1𝑠𝑡superscript1𝑠𝑡\text{1}^{\text{st}}1 start_POSTSUPERSCRIPT st end_POSTSUPERSCRIPT Symposium on Algorithmic Foundations of Dynamic Networks (SAND), pages 11:1–11:17, 2022.
  13. Adding data registers to parameterized networks with broadcast. Fundamenta Informaticae, 143(3-4):287–316, 2016.
  14. A time and space optimal stable population protocol solving exact majority. In Proc. 62𝑛𝑑superscript62𝑛𝑑\text{62}^{\text{nd}}62 start_POSTSUPERSCRIPT nd end_POSTSUPERSCRIPT IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1044–1055, 2021.
  15. Verification of population protocols. Acta Informatica, 54(2):191–215, 2017.
  16. Deterministic population protocols for exact majority and plurality. In Proc. 20𝑡ℎsuperscript20𝑡ℎ\text{20}^{\text{th}}20 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Conference on Principles of Distributed Systems (OPODIS), pages 14:1–14:14, 2016.
  17. Continuous reachability for unordered data Petri nets is in PTime. In Proc. 22𝑛𝑑superscript22𝑛𝑑\text{22}^{\text{nd}}22 start_POSTSUPERSCRIPT nd end_POSTSUPERSCRIPT International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), pages 260–276, 2019.
  18. Coverability trees for Petri nets with unordered data. In Proc. 19𝑡ℎsuperscript19𝑡ℎ\text{19}^{\text{th}}19 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), pages 445–461, 2016.
  19. Linear combinations of unordered data vectors. In Proc. 32𝑛𝑑superscript32𝑛𝑑\text{32}^{\text{nd}}32 start_POSTSUPERSCRIPT nd end_POSTSUPERSCRIPT Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–11, 2017.
  20. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, 1994.
  21. Feasible automata for two-variable logic with successor on data words. In Proc. 6𝑡ℎsuperscript6𝑡ℎ\text{6}^{\text{th}}6 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Conference on Language and Automata Theory and Applications (LATA), volume 7183, pages 351–362, 2012.
  22. Denis Lugiez. Multitree automata that count. Theoretical Computer Science, 333(1-2):225–263, 2005.
  23. Elements of the theory of dynamic networks. Communications of the ACM, 61(2):72, 2018.
  24. Decision procedures for multisets with cardinality constraints. In Proc. 9𝑡ℎsuperscript9𝑡ℎ\text{9}^{\text{th}}9 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 218–232, 2008.
  25. Zhilin Wu. Commutative data automata. In Proc. 26𝑡ℎsuperscript26𝑡ℎ\text{26}^{\text{th}}26 start_POSTSUPERSCRIPT th end_POSTSUPERSCRIPT International Workshop/21𝑠𝑡superscript21𝑠𝑡\text{21}^{\text{st}}21 start_POSTSUPERSCRIPT st end_POSTSUPERSCRIPT Annual Conference of the EACSL on Computer Science Logic (CSL), volume 16, pages 528–542, 2012.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now