{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:51Z","timestamp":1762458411933},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,2,1]],"date-time":"1988-02-01T00:00:00Z","timestamp":570672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1988,2]]},"DOI":"10.1007\/bf00263584","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T20:48:04Z","timestamp":1096318084000},"page":"179-201","source":"Crossref","is-referenced-by-count":31,"title":["On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes"],"prefix":"10.1007","volume":"25","author":[{"given":"L.","family":"Boug\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,2,1]]},"reference":[{"key":"BF00263584_CR1","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/579.584","volume":"6","author":"K.R. Apt","year":"1984","unstructured":"Apt, K.R., Francez, N.: Modelling the distributed termination convention of CSP. ACM Trans. Prog. Lang. Syst. 6, 370\u2013379 (1984)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"BF00263584_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Katz, S., Francez, N.: Appraising fairness in distributed languages. Proc. Ann. ACM Symp. on Princ. Progr. Languages, M\u00fcnchen (1987)","DOI":"10.1145\/41625.41642"},{"key":"BF00263584_CR3","series-title":"NATO ASI Series F14","first-page":"475","volume-title":"Control Flow and Data Flow: Concepts of Distributed Programming","author":"K. Apt","year":"1985","unstructured":"Apt, K., Richier, J.L.: Real time clocks versus virtual clocks. In: Control Flow and Data Flow: Concepts of Distributed Programming. M. Broy (ed.) NATO ASI Series F14, pp. 475\u2013502. Berlin Heidelberg New York: Springer 1985"},{"key":"BF00263584_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. Proceedings of the 12th Ann. ACM Symp. Theory Comp., pp. 82\u201393. Los Angeles, California (April 1980)","DOI":"10.1145\/800141.804655"},{"key":"BF00263584_CR5","series-title":"Rept. No. RUU-CS-85-15","volume-title":"New upper bounds for decentralized extrema-finding in a ring of processors","author":"H.L. Bodlaender","year":"1985","unstructured":"Bodlaender, H.L., van Leeuwen, J.: New upper bounds for decentralized extrema-finding in a ring of processors, Rept. No. RUU-CS-85-15. Dept. Comp. Science, Univ. Utrecht, The Netherlands 1985"},{"key":"BF00263584_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/69624.357208","volume":"5","author":"G.N. Buckley","year":"1983","unstructured":"Buckley, G.N., Silberschatz, A.: An effective implementation of the generalized input-output construct of CSP. ACM Trans. Prog. Lang. Syst. 5, 223\u2013235 (1983)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"BF00263584_CR7","doi-asserted-by":"crossref","unstructured":"Bracha, G., Toueg, S.: Resilient consensus protocols. Proc. 2nd Ann. ACM Symp. Princ. Distr. Syst., pp. 12\u201326 Montreal (August) 1983","DOI":"10.1145\/800221.806706"},{"key":"BF00263584_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). Proc. 2nd Ann. ACM Symp. Princ. Distr. Syst., pp. 27\u201330. Montreal (August) 1983","DOI":"10.1145\/800221.806707"},{"key":"BF00263584_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/357094.357101","volume":"2","author":"A.J. Bernstein","year":"1980","unstructured":"Bernstein, A.J.: Output guards and nondeterminism in communicating sequential processes. ACM Trans. Prog. Lang. Syst. 2, 234\u2013238 (1980)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"BF00263584_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90005-3","volume":"49","author":"L. Boug\u00e9","year":"1987","unstructured":"Boug\u00e9, L.: Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP. Theor. Comput. Sci. 49, 145\u2013169 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"BF00263584_CR11","unstructured":"Boug\u00e9, L.: Symmetry and genericity for CSP distributed system. Rept. No. 85-32, LITP, Univ. Paris 7, Paris (May) 1985"},{"key":"BF00263584_CR12","unstructured":"Boug\u00e9, L.: Genericity and symmetry for distributed systems: the case of CSP, Th\u00e8se d'\u00e9tat, Univ. Paris 7, 1987. Rept. No. 87\/2, LIENS, Paris 1987"},{"key":"BF00263584_CR13","series-title":"Rept. No. RUU-CS-87-10","volume-title":"Proc. 2nd Int. Workshop on Distributed Algorithms","author":"L. Boug\u00e9","year":"1987","unstructured":"Boug\u00e9, L.: On the existence of generic broadcast algorithms in networks of communicating sequential processes. Proc. 2nd Int. Workshop on Distributed Algorithms, Rept. No. RUU-CS-87-10. Dept. Comp. Science, Univ. Utrecht, The Netherlands (July) 1987"},{"key":"BF00263584_CR14","doi-asserted-by":"crossref","unstructured":"Burns, J.E.: Symmetry in systems of asynchronous processes. Proceedings 22nd Symp. on Found. of Comp. Science, pp. 169\u2013174. Nashville, Tennessee (1981)","DOI":"10.1109\/SFCS.1981.42"},{"key":"BF00263584_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0036903","volume":"154","author":"S. Cohen","year":"1983","unstructured":"Cohen, S., Lehmann, D., Pnueli, A.: Symmetric and economical solutions to the mutual exclusion problem in a distributed system. Automata, Languages and Programming, 10th Coll., Barcelona, Spain, July 1983. Lect. Notes Comp. Science 154, 128\u2013136 (1983)","journal-title":"Lect. Notes Comp. Science"},{"key":"BF00263584_CR16","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Trans. Prog. Lang. Syst. 6, 632\u2013646 (1984)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"BF00263584_CR17","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Misra, J.: How processes learn. Proc. 4th ACM ann. Symp. Princ. Distr. Comp., Minaki, Ontario, Canada (August) 1985","DOI":"10.1145\/323596.323615"},{"key":"BF00263584_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E.W. Dijkstra","year":"1983","unstructured":"Dijkstra, E.W., Feijen, W.H.J., van Gasteren, A.J.M.: Derivation of a termination detection algorithm for distributed computations. Inf. Proc. Letters 16, 217\u2013219 (1983)","journal-title":"Inf. Proc. Letters"},{"key":"BF00263584_CR19","first-page":"72","volume-title":"operating systems techniques","author":"E.W. Dijkstra","year":"1972","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. In: operating systems techniques. C.A.R. Hoare, R.H. Petrot (eds.), pp. 72\u201393. New York: Academic Press 1972"},{"key":"BF00263584_CR20","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-10699-5_105","volume":"107","author":"N. Francez","year":"1981","unstructured":"Francez, N., Rodeh, M., Sintzoff, N.: Distributed termination with interval assertions. Proc. Int. Coll. Formalization Progr. Concepts, Peniscola, Spain, April 1980. Lect. Notes Comp. Sci. 107, 280\u2013291 (1981)","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF00263584_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Francez, N.: Distributed termination. ACM Trans. Progr. Lang. Syst. 2, 42\u201355 (1980)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"BF00263584_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TC.1982.1675885","volume":"1","author":"H. Garcia-Molina","year":"1982","unstructured":"Garcia-Molina, H.: Elections in a distributed computing system. IEEE Trans. Comput. C31, 1, 48\u201359 (1982)","journal-title":"IEEE Trans. Comput. C31"},{"key":"BF00263584_CR23","series-title":"Rept. No. 185","volume-title":"Distributed state exploration for protocol validation","author":"M.G. Gouda","year":"1981","unstructured":"Gouda, M.G.: Distributed state exploration for protocol validation. Rept. No. 185, Dept. Computer Science, Univ. Texas at Austin, Texas 1981"},{"key":"BF00263584_CR24","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Commun. ACM 21, 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"BF00263584_CR25","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributive networks. Proc. 22nd Symp. Found. Comp. Science, pp. 169\u2013174. Nashville, Tennessee, 1981","DOI":"10.1109\/SFCS.1981.41"},{"key":"BF00263584_CR26","doi-asserted-by":"crossref","unstructured":"Johnson, R.E., Schneider, F.B.: Symmetry and similarity in distributed systems (extended abstract). Proc. 4th ACM Ann. Symp. Princ. Distr. Comp., Minaki, Ontario, Canada (August) 1985","DOI":"10.1145\/323596.323598"},{"key":"BF00263584_CR27","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Rabin, M.O.: On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. Proc. 8th Ann. ACM Symp. Princ. Progr. Lang., pp. 133\u2013138. Williamsburgh, Virginia 1981","DOI":"10.1145\/567532.567547"},{"key":"BF00263584_CR28","first-page":"155","volume-title":"Information Processing 77","author":"G. Lann Le","year":"1977","unstructured":"Le Lann, G.: Distributed systems \u2014 towards a formal approach. In: Information Processing 77. B. Gilchrist (ed.), pp. 155\u2013160. Amsterdam: North-Holland 1977"},{"key":"BF00263584_CR29","doi-asserted-by":"crossref","unstructured":"Merritt, M.: Elections in the presence of faults. Proc. 3rd Ann. ACM Symp. Princ. Distr. Comp., pp. 134\u2013142. Vancouver, B.C., Canada 1984","DOI":"10.1145\/800222.806741"},{"key":"BF00263584_CR30","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-11981-7_17","volume-title":"Logics of Programs and Their Applications","author":"Gordon Plotkin","year":"1983","unstructured":"Plotkin, G.: An operational semantics for CSP. In: Formal Description of Programming Concepts, D. Bj\u00f8rner (ed.), IFIP TC-2 Working Conference, pp. 199\u2013223. Garmisch-Partenkirchen, 1982 (North-Holland, 1983)"},{"key":"BF00263584_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0020-0190(83)90089-3","volume":"17","author":"S.R. Rana","year":"1983","unstructured":"Rana, S.R.: A Distributed solution of the distributed termination problem. Inf. Proc. Letters 17, 43\u201346 (1983)","journal-title":"Inf. Proc. Letters"},{"key":"BF00263584_CR32","unstructured":"Richier, J.L.: Distributed termination in CSP \u2014 symmetric solutions with minimal storage. Rept. No. 84-49, LITP, Univ. Paris 7, Paris 1984"},{"key":"BF00263584_CR33","doi-asserted-by":"crossref","unstructured":"Vitanyi, P.M.B.: Distributed elections in an archimedian ring of processors. Proc. 16th Ann. ACM Symp. Theory Comput. 542\u2013547 (1984)","DOI":"10.1145\/800057.808725"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263584.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00263584\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263584.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T06:22:02Z","timestamp":1565936522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00263584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,2]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,2]]}},"alternative-id":["BF00263584"],"URL":"https:\/\/doi.org\/10.1007\/bf00263584","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,2]]}}}