Not All Fair Probabilistic Schedulers Are Equivalent
暂无分享,去创建一个
[1] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[2] David Eisenstat,et al. Fast computation by population protocols with a leader , 2006, Distributed Computing.
[3] Rachid Guerraoui,et al. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.
[4] Ioannis Chatzigiannakis,et al. Brief Announcement: Decidable Graph Languages by Mediated Population Protocols , 2009, DISC.
[5] W. Mccrea,et al. XXII.—Random Paths in Two and Three Dimensions. , 1940 .
[6] Paul G. Spirakis,et al. Recent Advances in Population Protocols , 2009, MFCS.
[7] David Eisenstat,et al. Stably computable predicates are semilinear , 2006, PODC '06.
[8] David Eisenstat,et al. A Simple Population Protocol for Fast Robust Approximate Majority , 2007, DISC.
[9] Paul G. Spirakis,et al. Stably Decidable Graph Languages by Mediated Population Protocols , 2010, SSS.
[10] Joseph Sifakis,et al. Fairness and related properties in transition systems — a temporal logic to deal with fairness , 1983, Acta Informatica.
[11] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[12] Paul G. Spirakis,et al. Mediated Population Protocols , 2009, ICALP.
[13] Paul G. Spirakis,et al. The Dynamics of Probabilistic Population Protocols , 2008, DISC.
[14] Michael J. Fischer,et al. Stably Computable Properties of Network Graphs , 2005, DCOSS.
[15] James Aspnes,et al. An Introduction to Population Protocols , 2007, Bull. EATCS.