Randomized finite-state distributed algorithms as markov chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 240-254

  Duflot, Marie ^a   Fribourg, Laurent ^a   Picaronny, Claudine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING;

CONVERGENCE RESULTS; DISTRIBUTED SYSTEMS; FINITE MARKOV CHAIN; MARKOV CHAINS THEORY; MUTUAL EXCLUSION ALGORITHMS; RANDOMIZED ALGORITHMS; RANDOMIZED DISTRIBUTED ALGORITHMS; SELF-STABILIZING ALGORITHM;

MARKOV PROCESSES;

EID: 84956970401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_17     Document Type: Conference Paper

References (14)

1. J. Beauquier, S. Cordier, and S. Delaët. Optimum probabilistic self-stabilization on uniform ring. In Proc. Of the 2nd Worshop on Self-Stabilizing Systems, 1995.
2. J. Beauquier and S. Delaët. Probabilistic self-stabilizing mutual exclusion in uniform ring. In Proc. Of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC’94), page 378, 1994.
3. J. Beauquier, J. Durand-Lose, M. Gradinariu, and C. Johnen. Token based selfstabilizing uniform algorithms. J. Of Parallel and Distributed Systems, To appear.
4. J. Beauquier, M. Gradinariu, and C. Johnen. Memory space requirements for selfstabilizing leader election protocols. In Proc. Of the 18th Annual ACM Symposium on Principles of Distributed Computing (PODC’99), pages 199–208, 1999.
5. E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643–644, Nov. 1974.
6. S. Dolev. Self-Stabilization. MIT Press, 2000.
7. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Transactions on Softare Engineering, 21(5):429–439, May 1995.
8. M. Duflot, L. Fribourg, and C. Picaronny. Randomized distributed algorithms as markov chains. Technical report, Lab. Specification and Verification, ENS de Cachan, Cachan, France, May 2001. Available on http://www.lsv.ens-cachan.fr/Publis/RAPPORTS LSV/.
9. M. Flatebo and A.K. Datta. Two-state self-stabilizing algorithms for token rings. IEEE Transactions on Software Engineering, 20(6):500–504, June 1994.
10. T. Herman. Probabilistic self-stabilization. IPL, 35(2):63–67, June 1990.
11. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In Proc. Of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC’90), pages 119–131, 1990.
12. A. Israeli and M. Jalfon. Uniform self-stabilizing ring orientation. Information and Computation, 104(2):175–196, 1993.
13. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Trans. Parallel and Distributed Systems, 8(2), 1997.
14. J.G. Kemeny and J.L. Snell. Finite Markov Chains. D. van Nostrand Co., 1969.