2 search results - page 1 / 1 » An Optimal Self-stabilizing Firing Squad |
SSS
2009
Springer
13 years 9 months ago
2009
Springer
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...
BCS
2008
13 years 6 months ago
2008
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...