On the Fairness of Probabilistic Schedulers for Population Protocols
暂无分享,去创建一个
[1] Michael J. Fischer,et al. Stably Computable Properties of Network Graphs , 2005, DCOSS.
[2] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[3] James Aspnes,et al. An Introduction to Population Protocols , 2007, Bull. EATCS.
[4] Paul G. Spirakis,et al. Mediated Population Protocols , 2009, ICALP.
[5] Paul G. Spirakis,et al. Recent Advances in Population Protocols , 2009, MFCS.
[6] David Eisenstat,et al. A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.
[7] Sándor P. Fekete,et al. Shawn: A new approach to simulating wireless sensor networks , 2005, ArXiv.
[8] Joseph Sifakis,et al. Fairness and related properties in transition systems — a temporal logic to deal with fairness , 1983, Acta Informatica.
[9] Ioannis Chatzigiannakis,et al. Brief Announcement: Decidable Graph Languages by Mediated Population Protocols , 2009, DISC.
[10] Ioannis Chatzigiannakis,et al. Distributed simulation of heterogeneous systems of small programmable objects and traditional processors , 2008, MobiWac '08.
[11] Rachid Guerraoui,et al. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.
[12] Michael J. Fischer,et al. A simple game for the study of trust in distributed systems , 2009, Wuhan University Journal of Natural Sciences.
[13] David Eisenstat,et al. Fast computation by population protocols with a leader , 2006, Distributed Computing.