Black Ninjas in the Dark: Formal Analysis of Population Protocols

In this interactive paper, which you should preferably read connected to the Internet, the Black Ninjas introduce you to population protocols, a fundamental model of distributed computation, and to recent work by the authors and their colleagues on their automatic verification.

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

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

[3]  Yuxin Deng,et al.  Verifying Self-stabilizing Population Protocols with Coq , 2009, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering.

[4]  Dan Alistarh,et al.  Fast and Exact Majority in Population Protocols , 2015, PODC.

[5]  Philip Offtermatt.  A Tool for Verification and Simulation of Population Protocols , 2017 .

[6]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[7]  Rupak Majumdar,et al.  Verification of population protocols , 2016, Acta Informatica.

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

[9]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

[11]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

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

[13]  Javier Esparza,et al.  Peregrine: A Tool for the Analysis of Population Protocols , 2018, CAV.

[14]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[15]  Jun Sun,et al.  PAT: Towards Flexible Verification under Fairness , 2009, CAV.

[16]  Dan Alistarh,et al.  Time-Space Trade-offs in Population Protocols , 2016, SODA.

[17]  Rupak Majumdar,et al.  An SMT-Based Approach to Coverability Analysis , 2014, CAV.

[18]  Javier Esparza,et al.  Towards efficient verification of population protocols , 2017, Formal Methods in System Design.

[19]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[20]  Karsten Wolf,et al.  LoLA: A Low Level Analyser , 2000, ICATPN.

[21]  Javier Esparza,et al.  Large Flocks of Small Birds: on the Minimal Size of Population Protocols , 2018, STACS.

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

[23]  Jun Pang,et al.  On automatic verification of self-stabilizing population protocols , 2008, Frontiers of Computer Science in China.

[24]  Carole Delporte-Gallet,et al.  Guidelines for the Verification of Population Protocols , 2011, 2011 31st International Conference on Distributed Computing Systems.

[25]  Paul G. Spirakis,et al.  Elements of the theory of dynamic networks , 2018, Commun. ACM.

[26]  Zohar Manna,et al.  The calculus of computation - decision procedures with applications to verification , 2007 .