Sciweavers

620 search results - page 2 / 124
» The computational power of population protocols
Sort
View
PODC
2004
ACM
13 years 11 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
DALT
2003
Springer
13 years 11 months ago
Modeling Interactions Using Social Integrity Constraints: A Resource Sharing Case Study
Computees are abstractions of the entities that populate global and open computing environments. The societies that they populate give an institutional meaning to their interaction...
Marco Alberti, Marco Gavanelli, Evelina Lamma, Pao...
DCOSS
2006
Springer
13 years 10 months ago
When Birds Die: Making Population Protocols Fault-Tolerant
In 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 ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
OPODIS
2007
13 years 7 months ago
Secretive Birds: Privacy in Population Protocols
We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
FCSC
2008
104views more  FCSC 2008»
13 years 6 months ago
On automatic verification of self-stabilizing population protocols
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
Jun Pang, Zhengqin Luo, Yuxin Deng