New Models for Population Protocols

Abstract Wireless sensor networks are about to be part of everyday life. Homes and workplaces capable of self-controlling and adapting air-conditioning for different temperature and humidity levels...

[1]  David Eisenstat,et al.  A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.

[2]  Shay Kutten,et al.  On utilizing speed in networks of mobile agents , 2010, PODC '10.

[3]  Paul G. Spirakis,et al.  Computational models for networks of tiny artifacts: A survey , 2011, Comput. Sci. Rev..

[4]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[5]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[6]  Johanne Cohen,et al.  Playing With Population Protocols , 2008, CSP.

[7]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[8]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[9]  Johanne Cohen,et al.  On the Convergence of Population Protocols When Population Goes to Infinity , 2009, Appl. Math. Comput..

[10]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[11]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[14]  Rachid Guerraoui,et al.  When Birds Die: Making Population Protocols Fault-Tolerant , 2006, DCOSS.

[15]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[16]  Sotiris Nikoletseas,et al.  Theoretical Aspects of Distributed Computing in Sensor Networks , 2011, Monographs in Theoretical Computer Science. An EATCS Series.

[17]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[18]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[19]  Peter van Emde Boas Space Measures for Storage Modification Machines , 1989, Inf. Process. Lett..

[20]  Joseph Sifakis,et al.  Fairness and related properties in transition systems — a temporal logic to deal with fairness , 1983, Acta Informatica.

[21]  C. L. Liu Elements of Discrete Mathematics , 1985 .

[22]  Paul G. Spirakis,et al.  Algorithmic Verification of Population Protocols , 2010, SSS.

[23]  Arnold Schönhage Storage Modification Machines , 1980, SIAM J. Comput..

[24]  Oscar H. Ibarra,et al.  Catalytic P systems, semilinear sets, and vector addition systems , 2004, Theor. Comput. Sci..

[25]  Paul G. Spirakis,et al.  Passively mobile communicating machines that use restricted space , 2011, FOMC '11.

[26]  Michael J. Fischer,et al.  Stably Computable Properties of Network Graphs , 2005, DCOSS.

[27]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[28]  Paul G. Spirakis,et al.  Passively Mobile Communicating Logarithmic Space Machines , 2010, ArXiv.

[29]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[30]  Michael J. Fischer,et al.  A simple game for the study of trust in distributed systems , 2009, Wuhan University Journal of Natural Sciences.

[31]  Paul G. Spirakis,et al.  Recent Advances in Population Protocols , 2009, MFCS.

[32]  Joseph Sifakis,et al.  A temporal logic to deal with fairness in transition systems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[33]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[34]  Paul G. Spirakis,et al.  All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model , 2010, MFCS.

[35]  T. Kurtz Approximation of Population Processes , 1987 .

[36]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[37]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[38]  Paul G. Spirakis,et al.  Mediated population protocols , 2011, Theor. Comput. Sci..

[39]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[40]  Viliam Geffert Space hierarchy theorem revised , 2003, Theor. Comput. Sci..

[41]  Paul G. Spirakis,et al.  Mediated Population Protocols , 2009, ICALP.

[42]  Paul G. Spirakis,et al.  The Dynamics of Probabilistic Population Protocols , 2008, DISC.

[43]  Róbert Szelepcsényi The moethod of focing for nondeterministic automata , 1987, Bull. EATCS.

[44]  Joffroy Beauquier,et al.  Self-stabilizing counting in mobile sensor networks , 2007, PODC '07.

[45]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[46]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[47]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[48]  Rachid Guerraoui,et al.  Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.

[49]  Neil Immerman Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[50]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[51]  Maris Alberts Space complexity of alternating Turing machines , 1985, FCT.

[52]  Johanne Cohen,et al.  Population Protocols that Correspond to Symmetric Games , 2009, Int. J. Unconv. Comput..

[53]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[54]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[55]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[56]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[57]  Andrzej Szepietowski Turing Machines with Sublogarithmic Space , 1994, Lecture Notes in Computer Science.

[58]  Michael J. Fischer,et al.  Self-stabilizing population protocols , 2005, TAAS.

[59]  Paul G. Spirakis,et al.  Stably Decidable Graph Languages by Mediated Population Protocols , 2010, SSS.

[60]  Ioannis Chatzigiannakis,et al.  Brief Announcement: Decidable Graph Languages by Mediated Population Protocols , 2009, DISC.

[61]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[62]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[63]  Paul G. Spirakis,et al.  Not All Fair Probabilistic Schedulers Are Equivalent , 2009, OPODIS.

[64]  Gabor Karsai,et al.  Smart Dust: communicating with a cubic-millimeter computer , 2001 .

[65]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[66]  Maria J. Serna,et al.  Sensor Field: A Computational Model , 2009, ALGOSENSORS.

[67]  Michael J Sailor,et al.  "Smart dust": nanostructured devices in a grain of sand. , 2005, Chemical communications.