000080862 001__ 80862
000080862 005__ 20180622133014.0
000080862 02470 $$2DAR$$a9130
000080862 02470 $$2ISI$$a000239426200004
000080862 037__ $$aCONF
000080862 245__ $$aWhen Birds Die: Making Population Protocols Fault-tolerant
000080862 269__ $$a2006
000080862 260__ $$c2006
000080862 336__ $$aConference Papers
000080862 520__ $$aIn the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise interactions. The ability of such systems to compute functions on a multiset of inputs that are initially distributed across all of the agents has been studied in the absence of failures. Here, we show that essentially the same set of functions can be computed in the presence of halting and transient failures, provided preconditions on the inputs are added so that the failures cannot immediately obscure enough of the inputs to change the outcome. We do this by giving a general-purpose transformation that makes any algorithm for the fault-free setting tolerant to failures.
000080862 700__ $$aDelporte-Gallet, Carole
000080862 700__ $$aFauconnier, Hugues
000080862 700__ $$0240335$$aGuerraoui, Rachid$$g105326
000080862 700__ $$aRuppert, Eric
000080862 7112_ $$a2006 ACM/IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS '06)
000080862 773__ $$tProceedings of the 2006 International Conference on Distributed Computing in Sensor Systems (DCOSS '06)
000080862 8564_ $$s384656$$uhttps://infoscience.epfl.ch/record/80862/files/birds.pdf$$zn/a
000080862 909CO $$ooai:infoscience.tind.io:80862$$pconf$$pIC
000080862 909C0 $$0252114$$pDCL$$xU10407
000080862 937__ $$aLPD-CONF-2006-035
000080862 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000080862 980__ $$aCONF