Stably computable predicates are semilinear

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 292-299

  Angluin, Dana ^a   Aspnes, James ^a   Eisenstat, David ^b  

^a YALE UNIVERSITY   (United States)

^b University of Rochester   (United States)

Author keywords

Population protocols; Semilinear sets; Stable computation

Indexed keywords

COMPUTATIONAL METHODS; FINITE AUTOMATA; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

FINITE-STATE AGENTS; POPULATION PROTOCOLS; SEMILINEAR SETS;

LINEAR SYSTEMS;

EID: 33748697610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146425     Document Type: Conference Paper

References (9)

1. Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Hang, and René Peralta. Stably computable properties of network graphs. In Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis, and Matt Welsh, editors, Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, volume 3560 of Lecture Notes in Computer Science, pages 63-74. Springer-Verlag, June 2005.
2. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. In PODC '04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pages 290-299. ACM Press, 2004.
3. Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. On the power of anonymous one-way communication. In Ninth International Conference on Principles of Distributed Systems, pages 307-318, December 2005.
4. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 3(2):326-336, 1952.
5. J. Hopcroft and J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159, 1978.
6. Oscar H. Ibarra, Zhe Dang, and Omer Egecioglu. Catalytic p systems, semilinear sets, and vector addition systems. Theor. Comput. Sci., 312(2-3):379-399, 2004.
7. Serge Lang. Algebra (Revised, Third Edition). Springer-Verlag, 2002.
8. Steven R. Lay. Convex Sets and their Applications. Krieger Publishing Company, 1992.
9. Mojzesz Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes-Rendus du l Congrès de Mathématiciens des Pays Slaves, pages 92-101, Warszawa, 1929.