Distributed, replicated computer bulletin board service
Distributed, replicated computer bulletin board service
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
On the computational complexity of membrane systems
Theoretical Computer Science
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Theoretical Computer Science
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
We extend the population protocol model with a cover-time service that informs a walking state every time it covers the whole network. This is simply a known upper bound on the cover time of a random walk. This allows us to introduce termination into population protocols, a capability that is crucial for any distributed system. By reduction to an oracle-model we arrive at a very satisfactory lower bound on the computational power of the model: we prove that it is at least as strong as a Turing Machine of space logn with input commutativity, where n is the number of nodes in the network. We also give a logn-space, but nondeterministic this time, upper bound. Finally, we prove interesting similarities of this model to linear bounded automata.