{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T16:40:02Z","timestamp":1738341602179,"version":"3.35.0"},"publisher-location":"Boston, MA","reference-count":46,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096797"},{"type":"electronic","value":"9780387096803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-09680-3_4","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T11:37:14Z","timestamp":1216640234000},"page":"57-72","source":"Crossref","is-referenced-by-count":0,"title":["Leader Election in Anonymous Rings: Franklin Goes Probabilistic"],"prefix":"10.1007","author":[{"given":"Rena","family":"Bakhshi","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin. Local and global properties in networks of processors. In Proc. 12th ACM Symp. on Theory of Computing, pages 82\u201393. ACM, 1980.","DOI":"10.1145\/800141.804655"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013117. Springer, 2005.","DOI":"10.1007\/11795490_10"},{"key":"4_CR3","unstructured":"R. Bakhshi, W. Fokkink, J. Pang, and J. van de Pol. \u03bcCRL specification of probabilistic Franklin leader election algorithm. http:\/\/www.few.vu.nl\/ rbakhshi\/alg\/franklin. mcrl."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013207. ACM, 1999.","DOI":"10.1145\/301308.301358"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-007-0034-0","volume":"20","author":"J. Beauquier","year":"2007","unstructured":"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\u201393, 2007.","journal-title":"Distributed Computing"},{"key":"4_CR6","unstructured":"S. Blom. Partial \u03c4-confluence for efficient state space generation. Technical Report SEN-R0123, CWI, Amsterdam, The Netherlands, 2001."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"S. Blom, J. Calam\u00e9, B. Lisser, S. Orzan, J. Pang, J. van de Pol, M. Torabi Dashti, and A. Wijs. Distributed analysis with (\u03bc)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\u2013689. Springer, 2007.","DOI":"10.1007\/978-3-540-71209-1_53"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"S. Blom, W. Fokkink, J.-F. Groote, I. van Langevelde, B. Lisser, and J. van de Pol. \u03bcCRL: A toolset for analysing algebraic specifications. In Proc. 13th Conf. on Computer Aided Verification, volume 2102 of LNCS, pages 250\u2013254. Springer, 2001.","DOI":"10.1007\/3-540-44585-4_23"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S1571-0661(05)80099-4"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013609. Springer, 2002.","DOI":"10.1007\/3-540-45657-0_50"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"J. Burns","year":"1989","unstructured":"J. Burns and J. Pachl. Uniform self-stabilizing rings. ACM Trans. Program. Lang. Systems, 11(2):330\u2013344, 1989.","journal-title":"ACM Trans. Program. Lang. Systems"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"E. Chang and R. Roberts. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun. ACM, 22(5):281\u2013283, 1979.","journal-title":"Commun. ACM"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013470. IEEE Computer Society, 2000.","DOI":"10.1109\/IPDPS.2000.846023"},{"issue":"11","key":"4_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"E. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643\u2013644, 1974.","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"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\u2013260, 1982.","journal-title":"J. of Algorithms"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013229. Springer Verlag, 2004.","DOI":"10.1007\/978-3-540-30186-8_16"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013440. Springer, 1996.","DOI":"10.1007\/3-540-61474-5_97"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013239. Springer, 2001.","DOI":"10.1007\/3-540-45414-4_16"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013409. Springer, 2006.","DOI":"10.1007\/11945529_28"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"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\u201368. Elsevier, 2005.","DOI":"10.1016\/j.entcs.2005.04.004"},{"issue":"8","key":"4_CR21","first-page":"981","volume":"12","author":"W. Fokkink","year":"2006","unstructured":"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\u20131006, 2006.","journal-title":"J. of Universal Computer Science"},{"issue":"5","key":"4_CR22","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"R. Franklin","year":"1982","unstructured":"R. Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM, 25(5):336\u2013337, 1982.","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.van Glabbeek","year":"1996","unstructured":"R. van Glabbeek and P. Weijland. Branching time and abstraction in bisimulation semantics. J. of the ACM, 43(3):555\u2013600, 1996.","journal-title":"J. of the ACM"},{"issue":"12","key":"4_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/636517.636531","volume":"37","author":"J.F. Groote","year":"2002","unstructured":"J. F. Groote and B. Lisser. Computer assisted manipulation of algebraic process specifications. SIGPLAN Notices, 37(12):98\u2013107, 2002.","journal-title":"SIGPLAN Notices"},{"issue":"1-2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S1567-8326(01)00005-4","volume":"48","author":"J.-F. Groote","year":"2001","unstructured":"J.-F. Groote, A. Ponse, and Y. Usenko. Linearization in parallel pCRl. J. Log. Algebr. Program., 48(1-2):39\u201370, 2001.","journal-title":"J. Log. Algebr. Program."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013638. Springer, 1990.","DOI":"10.1007\/BFb0032063"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(90)90107-9","volume":"35","author":"T. Herman","year":"1990","unstructured":"T. Herman. Probabilistic self-stabilization. Inf. Process. Lett., 35(2):63\u201367, 1990.","journal-title":"Inf. Process. Lett."},{"key":"4_CR28","unstructured":"L. Higham and S. Myers. Self-stabilizing token circulation on anonymous message passing. In Proc. 2nd Conf. on Principles of Distributed Systems, pages 115\u2013128. Hermes, 1998."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013444. Springer, 2006.","DOI":"10.1007\/11691372_29"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/169683.174161","volume":"15","author":"S.-T. Huang","year":"1993","unstructured":"S.-T. Huang. Leader election in uniform rings. ACM Trans. Program. Lang. Systems, 15(3):563\u2013573, 1993.","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In Proc. 9th ACM Symp. on Principles of Distributed Computing, pages 119\u2013131. ACM, 1990.","DOI":"10.1145\/93385.93409"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh. Symmetry breaking in distributive networks. In Proc. 22nd Symp. on Foundations of Computer Science, pages 150\u2013158. IEEE, 1981.","DOI":"10.1109\/SFCS.1981.41"},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A. Itai","year":"1990","unstructured":"A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60\u201387, 1990.","journal-title":"Inf. Comput."},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"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\u2013302. Springer, 1995.","DOI":"10.1007\/BFb0022154"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"C. Johnen. Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings. In Proc. 21st Symp. on Reliable Distributed Systems, pages 80\u201389. IEEE Computer Society, 2002.","DOI":"10.1109\/RELDIS.2002.1180176"},{"issue":"5","key":"4_CR36","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1006\/jpdc.2001.1831","volume":"62","author":"H. Kakugawa","year":"2002","unstructured":"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\u2013898, 2002.","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"L. Lamport. Checking a multithreaded algorithm with +CAL. In Proc. 20th Symp. on Distributed Computing, volume 4167 of LNCS, pages 151\u2013163. Springer, 2006.","DOI":"10.1007\/11864219_11"},{"issue":"11","key":"4_CR38","first-page":"1145","volume":"6","author":"S. Maharaj","year":"2000","unstructured":"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\u20131163, 2000.","journal-title":"J. of Universal Computer Science"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"R. Mateescu. On-the-fly state space reductions for weak equivalences. In Proc. 10th Workshop on Formal Methods for Industrial Critical Systems, pages 80\u201389. ACM, 2005.","DOI":"10.1145\/1081180.1081191"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"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\u2013678. ACM, 1992.","DOI":"10.1145\/129712.129777"},{"key":"4_CR41","unstructured":"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\u2013573. Society for Industrial and Applied Mathematics, 1996."},{"issue":"4","key":"4_CR42","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. Peterson","year":"1982","unstructured":"G. Peterson. An O(n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Systems, 4(4):758\u2013762, 1982.","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"4_CR43","unstructured":"J. van de Pol. A prover for the (\u03bc)CRL toolset with applications, version 0.1. Technical Report SEN-R0106, CWI, Amsterdam, The Netherlands, 2001."},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"L. Rosaz. Self-stabilizing token circulation on asynchronous uniform unidirectional rings. In Proc. 19th ACM Symp. on Principles of Distributed Computing, pages 249\u2013258. ACM, 2000.","DOI":"10.1145\/343477.343626"},{"issue":"2","key":"4_CR45","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM J. on Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM J. on Computing"},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2000. 2nd edition.","DOI":"10.1017\/CBO9781139168724"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T03:14:07Z","timestamp":1738293247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387096797","9780387096803"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_4","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[],"published":{"date-parts":[[2008]]}}}