International Conference on Concurrency on Concurrency 88
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Self-stabilization
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Self-Stabilization by Counter Flushing
SIAM Journal on Computing
IEEE Transactions on Computers
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilization with Global Rooted Synchronizers
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Snap-Stabilizing PIF Algorithm in Arbitrary Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
We propose a snap-stabilizingk-wave algorithm for routed trees, called kWA, which implements k consecutive waves, k 1. A snap-stabilizing algorithm, starting from an arbitrary system configuration, always behaves according to its specification. The maximum number of states per process is 2k + 1, better than the previous result of at most 3k states per process. A snap-stabilizing algorithm guarantees that, starting from an arbitrary system configuration, always behaves according to its specification.