{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:18Z","timestamp":1761611058863},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/s004460050017","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T04:52:48Z","timestamp":1030251168000},"page":"157-171","source":"Crossref","is-referenced-by-count":46,"title":["Design and analysis of dynamic leader election protocols in broadcast networks"],"prefix":"10.1007","volume":"9","author":[{"given":"Jacob","family":"Brunekreef","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Koymans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50090157446_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/12.2189","volume":"37","author":"HH Abu-Amara","year":"1988","unstructured":"Abu-Amara HH: Fault-tolerant distributed algorithm for election in complete networks. IEEE Trans Comput 37: 449\u2013453 (1988)","journal-title":"IEEE Trans Comput"},{"key":"50090157446_CR2","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0220023","volume":"20","author":"Y Afek","year":"1991","unstructured":"Afek Y, Gafni E: Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J Comput 20: 376\u2013394 (1991)","journal-title":"SIAM J Comput"},{"key":"50090157446_CR3","first-page":"337","volume-title":"Distributed algorithms. Lect Notes Comput Sci","author":"H Attiya","year":"1987","unstructured":"Attiya H: Constructing efficient election algorithms from efficient traversal algorithms. In: van Leeuwen J (ed) Distributed algorithms. Lect Notes Comput Sci, vol 312. Springer, Berlin Heidelberg New York 1987, pp 337\u2013344"},{"key":"50090157446_CR4","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01553900","volume":"4","author":"H Attiya","year":"1989","unstructured":"Attiya H, van Leeuwen J, Santoro N, Zaks S: Efficient elections in chordal ring networks. Algorithmica 4: 437\u2013446 (1989)","journal-title":"Algorithmica"},{"key":"50090157446_CR5","doi-asserted-by":"crossref","unstructured":"Baeten JCM, Weijland WP: Process algebra. Cambridge Tracts in Theoretical Computer Science, vol 18, Cambridge University Press 1990","DOI":"10.1017\/CBO9780511624193"},{"key":"50090157446_CR6","first-page":"361","volume":"2","author":"G Bochmann von","year":"1978","unstructured":"von Bochmann G: Finite state description of communication protocols. Comput Networks 2: 361\u2013372 (1978)","journal-title":"Comput Networks"},{"key":"50090157446_CR7","volume-title":"On modular algebraic protocol specification","author":"JJ Brunekreef","year":"1995","unstructured":"Brunekreef JJ: On modular algebraic protocol specification. PhD thesis, University of Amsterdam, The Netherlands 1995"},{"key":"50090157446_CR8","volume-title":"Design and analysis of dynamic leader election protocols in broadcast networks","author":"JJ Brunekreef","year":"1993","unstructured":"Brunekreef JJ, Katoen J-P, Koymans RLC, Mauw S: Design and analysis of dynamic leader election protocols in broadcast networks. Memoranda Informatica 93\u201343, Department of Computer Science, University of Twente, The Netherlands (1993)"},{"key":"50090157446_CR9","first-page":"338","volume-title":"Algebra of communicating processes. Workshops in Computing","author":"JJ Brunekreef","year":"1994","unstructured":"Brunekreef JJ, Katoen J-P, Koymans RLC, Mauw S: Algebraic specification of dynamic leader election protocols in broadcast networks. In: Ponse A, Verhoef C, van Vlijmen SFM (eds) Algebra of communicating processes. Workshops in Computing, Springer, Berlin Heidelberg New York 1994, pp 338\u2013357"},{"key":"50090157446_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0169-7552(87)90084-5","volume":"14","author":"S Budkowski","year":"1987","unstructured":"Budkowski S, Dembinski P: An introduction to Estelle: a specification language for distributed systems. Comput Networks ISDN Syst 14: 3\u201323 (1987)","journal-title":"Comput Networks ISDN Syst"},{"key":"50090157446_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E Chang","year":"1979","unstructured":"Chang E, Roberts R: An improved algorithm for decentralized extrema-finding in circular configurations of processors. Commun ACM 22: 281\u2013283 (1979)","journal-title":"Commun ACM"},{"key":"50090157446_CR12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-57271-6_34","volume-title":"Distributed algorithms. Lect Notes Comput Sci","author":"S Dolev","year":"1993","unstructured":"Dolev S: Optimal time self stabilization in dynamic systems. In: Schiper A (ed) Distributed algorithms. Lect Notes Comput Sci, vol 725. Springer, Berlin Heidelberg New York 1993, pp 160\u2013173"},{"key":"50090157446_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0022445","volume-title":"Distributed algorithms. Lect Notes Comput Sci","author":"S Dolev","year":"1992","unstructured":"Dolev S, Israeli A, Moran S: Uniform dynamic self-stabilizing leader election. In: Toueg S et al (eds) Distributed algorithms. Lect Notes Comput Sci, vol 579. Springer, Berlin Heidelberg New York 1992, pp 167\u2013180"},{"key":"50090157446_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev D, Dwork C, Stockmeyer L: On the minimal synchronism needed for distributed consensus. J ACM 34: 77\u201397 (1987)","journal-title":"J ACM"},{"key":"50090157446_CR15","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra EW: Self-stabilizing systems in spite of distributed control. Commun ACM 17: 634\u2013644 (1974)","journal-title":"Commun ACM"},{"key":"50090157446_CR16","first-page":"1","volume-title":"Fault-tolerant distributed computing. Lect Notes Comput Sci","author":"MJ Fisher","year":"1991","unstructured":"Fisher MJ: A theoretician\u2019s view of fault-tolerant distributed computing. In: Simons B, Spector A (eds) Fault-tolerant distributed computing. Lect Notes Comput Sci, vol 448. Springer, Berlin Heidelberg New York 1991, pp 1\u20139"},{"key":"50090157446_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TSE.1984.5010247","volume":"10","author":"NH Gehani","year":"1984","unstructured":"Gehani NH: Broadcasting sequential processes. IEEE Trans Softw Eng 10: 343\u2013351 (1984)","journal-title":"IEEE Trans Softw Eng"},{"key":"50090157446_CR18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0169-7552(92)90109-4","volume":"24","author":"R Gotzhein","year":"1992","unstructured":"Gotzhein R: Temporal logic and its applications \u2014 a tutorial. Comput Networks ISDN Syst 24: 203\u2013218 (1992)","journal-title":"Comput Networks ISDN Syst"},{"key":"50090157446_CR19","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/0169-7552(93)90094-K","volume":"25","author":"MG Gouda","year":"1993","unstructured":"Gouda MG: Protocol verification made simple: a tutorial. Comput Networks ISDN Syst 25: 969\u2013980 (1993)","journal-title":"Comput Networks ISDN Syst"},{"key":"50090157446_CR20","doi-asserted-by":"crossref","unstructured":"Gusella R, Zatti S: An election algorithm for a distributed clock synchronization program. In: Proc 6th IEEE Int Conf on Distributed Computing Systems (1986), pp 364\u2013371","DOI":"10.21236\/ADA611781"},{"key":"50090157446_CR21","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TCOM.1983.1095720","volume":"31","author":"BT Hailpern","year":"1983","unstructured":"Hailpern BT, Owicki SS: Modular verification of computer communication protocols. IEEE Trans Commun 31: 56\u201368 (1983)","journal-title":"IEEE Trans Commun"},{"key":"50090157446_CR22","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes. Prentice-Hall, Englewood Cliffs 1985"},{"key":"50090157446_CR23","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1109\/32.54293","volume":"16","author":"A Itai","year":"1990","unstructured":"Itai A, Kutten S, Wolfstahl Y, Zaks S: Optimal distributed r-resilient election in complete networks. IEEE Trans Softw Eng 16: 415\u2013420 (1990)","journal-title":"IEEE Trans Softw Eng"},{"key":"50090157446_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/0743-7315(89)90034-8","volume":"7","author":"C-T King","year":"1989","unstructured":"King C-T, Gendreau TB, Ni LM: Reliable election in broadcast networks. J Parallel Distrib Comput 7: 521\u2013540 (1989)","journal-title":"J Parallel Distrib Comput"},{"key":"50090157446_CR25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/77606.77610","volume":"12","author":"E Korach","year":"1990","unstructured":"Korach E, Kutten S, Moran S: A modular technique for the design of efficient distributed leader finding algorithms. ACM Trans Prog Lang Syst 12: 84\u2013101 (1990)","journal-title":"ACM Trans Prog Lang Syst"},{"key":"50090157446_CR26","doi-asserted-by":"crossref","unstructured":"Korach E, Moran S, Zaks S: Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In: Proc ACM Symp Principles Distributed Comput (1984), pp 199\u2013207","DOI":"10.1145\/800222.806747"},{"key":"50090157446_CR27","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-51803-7_28","volume-title":"Proc Colloquium on Temporal Logic and Specification. Lect Notes Comput Sci","author":"RLC Koymans","year":"1989","unstructured":"Koymans RLC: Specifying message passing systems requires extending temporal logic. In: Banieqbal B et al (eds) Proc Colloquium on Temporal Logic and Specification. Lect Notes Comput Sci, vol 398. Springer, Berlin Heidelberg New York 1989, pp 213\u2013223"},{"key":"50090157446_CR28","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L Lamport","year":"1983","unstructured":"Lamport L: Specifying concurrent program modules. ACM Trans Prog Lang Syst 5: 190\u2013222 (1983)","journal-title":"ACM Trans Prog Lang Syst"},{"key":"50090157446_CR29","doi-asserted-by":"crossref","unstructured":"Larsen KG, Thomsen B: A modal process logic. In: Proc IEEE Symposium on Logic in Computer Science (1988), pp 203\u2013210","DOI":"10.1109\/LICS.1988.5119"},{"key":"50090157446_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01782775","volume":"2","author":"J Leeuwen van","year":"1987","unstructured":"van Leeuwen J, Tan RB: An improved upperbound for distributed election in bidirectional rings of processors. Distrib Comput 2: 149\u2013160 (1987)","journal-title":"Distrib Comput"},{"key":"50090157446_CR31","first-page":"155","volume-title":"Information Processing (vol. 77) (IFIP)","author":"G LeLann","year":"1977","unstructured":"LeLann, G: Distributed systems \u2014 towards a formal approach. In: Gilchrist B (ed) Information Processing (vol. 77) (IFIP). North-Holland, Amsterdam 1977, pp 155\u2013160"},{"key":"50090157446_CR32","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","volume":"22","author":"MC Loui","year":"1986","unstructured":"Loui MC, Matsushita TA, West DB: Election in a complete network with a sense of direction. Inf Process Lett 22: 185\u2013187 (1986) (correction in Inf Process Letters 28: 327 (1988))","journal-title":"Inf Process Lett"},{"key":"50090157446_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The temporal logic of reactive and concurrent systems \u2014 Specification","author":"Z Manna","year":"1992","unstructured":"Manna Z, Pnueli A: The temporal logic of reactive and concurrent systems \u2014 Specification. Springer, Berlin Heidelberg New York 1992"},{"key":"50090157446_CR34","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-51687-5_41","volume-title":"Distributed algorithms. Lect Notes Comput Sci","author":"T Masuzawa","year":"1989","unstructured":"Masuzawa T, Nishikawa N, Hagihara K. Tokura N: Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction. In: Bermond J-C, Raynal M (eds) Distributed algorithms. Lect Notes Comput Sci. vol 392, Springer, Berlin Heidelberg New York 1989, pp 171\u2013182"},{"key":"50090157446_CR35","first-page":"85","volume":"VIII","author":"S Mauw","year":"1990","unstructured":"Mauw S, Veltink G: A process specification formalism. Fund Inf VIII: 85\u2013139 (1990)","journal-title":"Fund Inf"},{"key":"50090157446_CR36","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/71.80121","volume":"1","author":"PM Melliar-Smith","year":"1990","unstructured":"Melliar-Smith PM, Moser LE, Agrawala V: Broadcast protocols for distributed systems. IEEE Trans Parallel Distrib Syst 1: 17\u201325 (1990)","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"50090157446_CR37","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"GL Peterson","year":"1982","unstructured":"Peterson GL: An O(nlogn) unidirectional algorithm for the circular extrema problem. ACM Trans Program Lang Syst 4: 758\u2013762 (1982)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090157446_CR38","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/151254.151256","volume":"25","author":"M Schneider","year":"1993","unstructured":"Schneider M: Self-stabilization. ACM Comput Surv 25: 45\u201367 (1993)","journal-title":"ACM Comput Surv"},{"key":"50090157446_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(84)90009-1","volume":"4","author":"FB Schneider","year":"1984","unstructured":"Schneider FB, Gries D, Schlichting RD: Fault-tolerant broadcasts. Sci Comput Program 4: 1\u201316 (1984)","journal-title":"Sci Comput Program"},{"key":"50090157446_CR40","doi-asserted-by":"crossref","unstructured":"Shasha DE, Pnueli A, Ewald W: Temporal verification of carrier-sense local area network protocols. In: Proc ACM Symposium on Principles of Programming Languages (1984), pp 54\u201365","DOI":"10.1145\/800017.800516"},{"key":"50090157446_CR41","first-page":"79","volume":"24","author":"L Shrira","year":"1989","unstructured":"Shrira L, Goldreich O: Electing a leader in a ring with link failures. Acta Inf 24: 79\u201391 (1989)","journal-title":"Acta Inf"},{"key":"50090157446_CR42","doi-asserted-by":"crossref","unstructured":"Singh G: Efficient distributed algorithms for leader election in complete networks. In: Proc 11th IEEE Int Conf on Distributed Computing Systems (1991), pp 472\u2013479","DOI":"10.1109\/ICDCS.1991.148712"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s004460050017\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T11:45:16Z","timestamp":1578397516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s004460050017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["50090157446"],"URL":"https:\/\/doi.org\/10.1007\/s004460050017","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}