Leader election in anonymous rings: Franklin goes probabilistic

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 57-72

  Bakhshi, Rena ^a   Fokkink, Wan ^a,b   Pang, Jun ^c   van de Pol, Jaco ^d  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

^c UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^d UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MODEL CHECKING;

FINITE-STATE; FORMAL CORRECTNESS; LEADER ELECTION; LEADER ELECTION ALGORITHM; MODEL-CHECKING TECHNIQUES; MODULO 2; ROUND NUMBERS;

ALGORITHMS;

EID: 48249153390     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_4     Document Type: Conference Paper

References (46)

1. D. Angluin. Local and global properties in networks of processors. In Proc. 12th ACM Symp. on Theory of Computing, pages 82-93. ACM, 1980.
2. D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang. Self-stabilizing population protocols. In Proc. 9th Conf. on Principles of Distributed Systems, volume 3974 of LNCS, pages 103-117. Springer, 2005.
3. R. Bakhshi, W. Fokkink, J. Pang, and J. van de Pol. μCRL specification of probabilistic Franklin leader election algorithm. http://www.few.vu.nl/~rbakhshi/alg/franklin.mcrl.
4. J. Beauquier, M. Gradinariu, and C. Johnen. Memory space requirements for self-stabilizing leader election protocols. In Proc. 18th Symp. on Principles of Distributed Computing, pages 199-207. ACM, 1999.
5. J. Beauquier, M. Gradinariu, and C. Johnen. Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing, 20(1): 75-93, 2007.
6. S. Blom. Partial τ-confluence for efficient state space generation. Technical Report SEN-R0123, CWI, Amsterdam, The Netherlands, 2001.
7. S. Blom, J. Calamé, B. Lisser, S. Orzan, J. Pang, J. van de Pol, M. Torabi Dashti, and A. Wijs. Distributed analysis with μCRL: A compendium of case studies. In Proc. 13th Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 4424 of LNCS, pages 683-689. Springer, 2007.
8. S. Blom, W. Fokkink, J.-F. Groote, I. van Langevelde, B. Lisser, and J. van de Pol. μCRL: A toolset for analysing algebraic specifications. In Proc. 13th Conf. on Computer Aided Verification, volume 2102 of LNCS, pages 250-254. Springer, 2001.
9. S. Blom and S. Orzan. Distributed branching bisimulation reduction of state spaces. In Proc. 2nd Workshop on Parallel and Distributed Model Checking, volume 89(1) of ENTCS. Elsevier, 2003.
10. S. Blom and J. van de Pol. State space reduction by proving confluence. In Proc. 14th Conf. on Computer Aided Verification, volume 2404 of LNCS, pages 596-609. Springer, 2002.
11. J. Burns and J. Pachl. Uniform self-stabilizing rings. ACM Trans. Program. Lang. Systems, 11(2):330-344, 1989.
12. E. Chang and R. Roberts. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun. ACM 22(5):281-283, 1979.
13. A. Kumar Datta, M. Gradinariu, and S. Tixeuil. Self-stabilizing mutual exclusion using unfair distributed scheduler. In Proc. 14th Int. Parallel & Distributed Processing Symp., pages 465-470. IEEE Computer Society, 2000.
14. E. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643-644, 1974.
15. D. Dolev, M. Klawe, and M. Rodeh. An O (n log n) unidirectional algorithm for extrema finding in a circle. J. of Algorithms, 3(3):245-260, 1982.
16. P. Duchon, N. Hanusse, and S. Tixeuil. Optimal randomized self-stabilizing mutual exclusion in synchronous rings. In Proc. 18th Symp. on Distributed Computing, volume 3274 of LNCS, pages 216-229. Springer Verlag, 2004.
17. J.-C. Fernandez, H. Garavel, A. Kerbrat, L. Mounier, R. Mateescu, and M. Sighireanu. CADP - a protocol validation and verification toolbox. In Proc. 8th Conf. on Computer Aided Verification, volume 1102 of LNCS, pages 437-440. Springer, 1996.
18. F. Fich and C. Johnen. A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings. In Proc. 15th Conf. on Distributed Computing, volume 2180 of LNCS, pages 224-239. Springer, 2001.
19. M. Fischer and H. Jiang. Self-stabilizing leader election in networks of finite-state anonymous agents. In Proc. 10th Conf. on Principles of Distributed Systems, volume 4305 of LNCS, pages 395-409. Springer, 2006.
20. W. Fokkink and J. Pang. Simplifying Itai-Rodeh leader election for anonymous rings. In Proc. 4th Workshop on Automated Verification of Critical Systems, volume 128(6) of ENTCS, pages 53-68. Elsevier, 2005.
21. W. Fokkink and J. Pang. Variations on Itai-Rodeh leader election for anonymous rings and their analysis in PRISM. J. of Universal Computer Science, 12(8):981-1006, 2006.
22. R. Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM, 25(5):336-337, 1982.
23. R. van Glabbeek and P. Weijland. Branching time and abstraction in bisimulation semantics. J. of the ACM, 43(3):555-600, 1996.
24. J. F. Groote and B. Lisser. Computer assisted manipulation of algebraic process specifications. SIGPLAN Notices, 37(12):98-107, 2002.
25. J.-F. Groote, A. Ponse, and Y. Usenko. Linearization in parallel pcrl. J. Log. Algebr. Program., 48(1-2):39-70, 2001.
26. J.-F. Groote and F. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proc. 17th Colloq. on Automata, Languages and Programming, volume 443 of LNCS, pages 626-638. Springer, 1990.
27. T. Herman. Probabilistic self-stabilization. Inf. Process. Lett., 35(2):63-67, 1990.
28. L. Higham and S. Myers. Self-stabilizing token circulation on anonymous message passing. In Proc. 2nd Conf. on Principles of Distributed Systems, pages 115-128. Hermes, 1998.
29. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. 12th Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of LNCS, pages 441-444. Springer, 2006.
30. S.-T. Huang. Leader election in uniform rings. ACM Trans. Program. Lang. Systems, 15(3):563-573, 1993.
31. A. Israeli and M. Jalfon. Token management schemes and random walks yield selfstabilizing mutual exclusion. In Proc. 9th ACM Symp. on Principles of Distributed Computing, pages 119-131. ACM, 1990.
32. A. Itai and M. Rodeh. Symmetry breaking in distributive networks. In Proc. 22nd Symp. on Foundations of Computer Science, pages 150-158. IEEE, 1981.
33. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60-87, 1990.
34. G. Itkis, C. Lin, and J. Simon. Deterministic, constant space, self-stabilizing leader election on uniform rings. In Proc. 9th Workshop on Distributed Algorithms, volume 972 of LNCS, pages 288-302. Springer, 1995.
35. C. Johnen. Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings. In Proc. 21st Symp. on Reliable Distributed Systems, pages 80-89. IEEE Computer Society, 2002.
36. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon. J. Parallel Distrib. Comput., 62(5):885-898, 2002.
37. L. Lamport. Checking a multithreaded algorithm with +CAL. In Proc. 20th Symp. on Distributed Computing, volume 4167 of LNCS, pages 151-163. Springer, 2006.
38. S. Maharaj and C. Shankland. A survey of formal methods applied to leader election in IEEE 1394. J. of Universal Computer Science, 6(11):1145-1163, 2000.
39. R. Mateescu. On-the-fly state space reductions for weak equivalences. In Proc. 10th Workshop on Formal Methods for Industrial Critical Systems pages 80-89. ACM, 2005.
40. A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-stabilizing symmetry breaking in constant-space. In Proc. 24th ACM Symp. on Theory of Computing, pages 667-678. ACM, 1992.
41. A. Mayer, R. Ostrovsky, and M. Yung. Self-stabilizing algorithms for synchronous unidirectional rings. In Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, pages 564-573. Society for Industrial and Applied Mathematics, 1996.
42. G. Peterson. An O (n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Systems 4(4):758-762, 1982.
43. J. van de Pol. A prover for the μCRL toolset with applications, version 0.1. Technical Report SEN-R0106, CWI, Amsterdam, The Netherlands, 2001.
44. L. Rosaz. Self-stabilizing token circulation on asynchronous uniform unidirectional rings. In Proc. 19th ACM Symp. on Principles of Distributed Computing, pages 249-258. ACM, 2000.
45. R. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM J. on Computing, 1(2):146-160, 1972.
46. G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2000. 2nd edition.