Simplifying Itai-Rodeh leader election for anonymous rings

Electronic Notes in Theoretical Computer Science

Volumn 128, Issue 6, 2005, Pages 53-68

  Fokkink, Wan ^a,b   Pang, Jun ^a  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Anonymous networks; Distributed computing; Leader election; Model checking; Probabilistic algorithms

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; COMPUTER SOFTWARE; FORMAL LOGIC; MATHEMATICAL MODELS; METADATA; PARALLEL ALGORITHMS; PROBABILITY;

ANONYMOUS NETWORKS; DISTRIBUTED COMPUTING; LEADER ELECTION; MODEL CHECKING; PROBABILISTIC ALGORITHMS;

ALGORITHMS;

EID: 18744372409     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.04.004     Document Type: Conference Paper

References (18)

1. R. Alur, and T.A. Henzinger Reactive modules Formal Methods in System Design 15 1 1999 7 48
2. D. Angluin Local and global properties in networks of processors (extended abstract) Proc. STOC'80 1980 ACM 82 93
3. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen Model checking continuous-time Markov chains by transient analysis Proc. CAV'00 LNCS 1855 2000 Springer 358 372
4. C. Baier, and M. Kwiatkowska Model checking for a probabilistic branching time logic with fairness Distributed Computing 11 3 1998 125 155
5. S.C.C. Blom, W.J. Fokkink, J.F. Groote, I.A. van Langevelde, B. Lisser, and J.C. van de Pol μCRL: A toolset for analysing algebraic specifications Proc. CAV'01 LNCS 2102 2001 Springer 250 254
6. J.E. Burns. A formal model for message passing systems. Technical Report TR-91, Indiana University, 1980
7. E.J.H. Chang, and R. Roberts An improved algorithm for decentralized extrema-finding in circular configurations of processes Communication of the ACM 22 5 1979 281 283
8. D. Dolev, M. Klawe, and M. Rodeh An O (n log n) unidirectional distributed algorithm for extrema finding in a circle Journal of Algorithms 3 1982 245 260
9. W.J. Fokkink and J. Pang. Simplifying Itai-Rodeh leader election for anonymous rings. Technical Report SEN-R0405, CWI Amsterdam, 2004
10. R. Franklin On an improved algorithm for decentralized extrema finding in circular configurations of processors Communication of the ACM 25 5 1982 336 337
11. M. Fujita, P.C. McGeer, and J.C.-Y. Yang Multi-terminal binary decision diagrams: An efficient data structure for matrix representation Formal Methods in System Design 10 2/3 1997 149 169
12. H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Formal Aspects of Computing 6 5 1994 512 535
13. D.S. Hirschberg, and J.B. Sinclair Decentralized extrema-finding in circular configurations of processes Communication of the ACM 23 11 1980 627 628
14. A. Itai, and M. Rodeh Symmetry breaking in distributive networks Proc. FOCS'81 1981 IEEE Computer Society 150 158
15. A. Itai, and M. Rodeh Symmetry breaking in distributed networks Information and Computation 88 1 1990 60 87
16. M.Z. Kwiatkowska, G. Norman, and D. Parker PRISM: Probabilistic symbolic model checker Proc. TOOLS'02 LNCS 2324 2002 Springer 200 204
17. G. Le Lann. Distributed systems: Towards a formal approach. Information Processing 77, Proc. of the IFIP Congress, pp. 155-160, 1977
18. G.L. Peterson An O (n log n) unidirectional algorithm for the circular extrema problem IEEE Transactions on Programming Languages and Systems 4 1982 758 762