A simple population protocol for fast robust approximate majority, Distributed Computing, pp.87-102, 2008. ,
The computational power of population protocols, Distributed Computing, vol.34, issue.3, pp.279-304, 2007. ,
DOI : 10.1007/s00446-007-0040-2
Leader Election in Anonymous Rings: Franklin Goes Probabilistic, IFIP TCS, pp.57-72, 2008. ,
DOI : 10.1007/978-0-387-09680-3_4
Guidelines for the Verification of Population Protocols, 2011 31st International Conference on Distributed Computing Systems, 1999. ,
DOI : 10.1109/ICDCS.2011.36
Algorithmic Verification of Population Protocols, Proceedings of SSS, pp.221-235, 2010. ,
DOI : 10.1007/978-3-642-16023-3_19
Secretive birds : Privacy in population protocols Characterizing correctness properties of parallel programs using fixpoints Reasoning about systems with many processes Spin model checker : the primer and reference manual Parallel program schemata Probabilistic symbolic model checking with PRISM : A hybrid approach, OPODIS ICALP Liu, J. Pang, J. Sun, and J. Zhao. Verification of population ring protocols in PAT. In TASE, pp.329-342, 1969. ,
On automatic verification of self-stabilizing population protocols [Pnu77] A. Pnueli. The temporal logic of programs, TASE FOCS, pp.185-192, 1977. ,
Iterative methods for the analysis of petri nets, Proceedings of APN of Informatik-Fachberichte, pp.161-167, 1981. ,
PAT: Towards Flexible Verification under Fairness, CAV, pp.709-714, 2009. ,
DOI : 10.1007/978-3-642-02658-4_59
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.806