Passer à la navigation principale Passer à la recherche Passer au contenu principal

Trustful population protocols

  • Laboratoire d'Informatique (LIX)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

Population protocols have been introduced by Angluin et al. as a model in which passively mobile anonymous finite-state agents stably compute a predicate of the multiset of their inputs via interactions by pairs. Stably computable predicates under this model have been characterized as exactly semi-linear predicates, that is to say exactly those definable in Presburger's arithmetic. We consider several variants of the models. In all these variants, the agents are called trustful : agents with a similar opinion that meet do not change their common opinion. We provide a characterization of the computational power of the obtained models, considering both the case when agents have finitely many states, and when agents can possibly be arbitrary Turing machines. We also provide some time complexity considerations.

langue originaleAnglais
titreDistributed Computing - 27th International Symposium, DISC 2013, Proceedings
Pages447-461
Nombre de pages15
Les DOIs
étatPublié - 1 déc. 2013
Evénement27th International Symposium on Distributed Computing, DISC 2013 - Jerusalem, Israël
Durée: 14 oct. 201318 oct. 2013

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8205 LNCS
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Une conférence

Une conférence27th International Symposium on Distributed Computing, DISC 2013
Pays/TerritoireIsraël
La villeJerusalem
période14/10/1318/10/13

Empreinte digitale

Examiner les sujets de recherche de « Trustful population protocols ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation