{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:24Z","timestamp":1761610344186,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)01148-5","type":"journal-article","created":{"date-parts":[[2005,4,8]],"date-time":"2005-04-08T09:19:45Z","timestamp":1112951985000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Overview of Synchronous Message-Passing and Topology"],"prefix":"10.1016","volume":"39","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]},{"given":"Mark R.","family":"Tuttle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)01148-5_bib1","series-title":"Proceedings of the 10th International Workshop on Distributed Algorithms Lecture Notes in Computer Science 1151","first-page":"322","article-title":"The combinatorial structure of wait-free solvable tasks","author":"Attiya","year":"1996"},{"key":"10.1016\/S1571-0661(05)01148-5_bib2","doi-asserted-by":"crossref","unstructured":"Borowsky, E. and E. Gafni, Generalized FLP impossibility result for t-resilient asynchronous computations, in: Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 91\u2013100.","DOI":"10.1145\/167088.167119"},{"key":"10.1016\/S1571-0661(05)01148-5_bib3","unstructured":"Chaudhuri, S., Towards a complexity hierarchy of wait-free concurrent objects, in: Proceeding of the 3rd IEEE Symposium on Parallel and Distributed Processing, 1991."},{"key":"10.1016\/S1571-0661(05)01148-5_bib4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.1993.1043","article-title":"More choices allow more faults: Set consensus problems in totally asynchronous systems","volume":"105","author":"Chaudhuri","year":"1993","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)01148-5_bib5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., M. Herlihy, N. Lynch and M. R. Tuttle, A tight lower bound for k-set agreement, in: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 206\u2013215.","DOI":"10.1109\/SFCS.1993.366866"},{"key":"10.1016\/S1571-0661(05)01148-5_bib6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","article-title":"The Byzantine generals strikte again","volume":"3","author":"Dolev","year":"1982","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0661(05)01148-5_bib7","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithms for Byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(05)01148-5_bib8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","article-title":"Knowledge and common knowledge in a Byzantine environment: Crash failures","volume":"88","author":"Dwork","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)01148-5_bib9","doi-asserted-by":"crossref","unstructured":"Fischer, M. J., The consensus problem in unreliable distributed systems (a brief survey), in: M. Karpinsky, editor, Proceedings of the 10th International Colloquium on Automata, Languages, and Programming (1983), pp. 127\u2013140.","DOI":"10.1007\/3-540-12689-9_99"},{"key":"10.1016\/S1571-0661(05)01148-5_bib10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","article-title":"A lower bound for the time to assure interactive consistency","volume":"14","author":"Fischer","year":"1982","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(05)01148-5_bib11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty processor","volume":"32","author":"Fischer","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)01148-5_bib12","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1137\/S0097539796305766","article-title":"Three-processor tasks are undexidable","volume":"28","author":"Gafni","year":"1999","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(05)01148-5_bib13","unstructured":"Glaser, L. C., 1, Van Nostrand Reinhold, New York, 1970."},{"key":"10.1016\/S1571-0661(05)01148-5_bib14","unstructured":"Hadzilacos, V., A lower bound for Byzantine agreement with fail-stop processors, Technical Report TR-21\u201383, Harvard University (1983)."},{"key":"10.1016\/S1571-0661(05)01148-5_bib15","doi-asserted-by":"crossref","unstructured":"Herlihy, M. and S. Rajsbaum, Set consensus using arbitrary objects, in: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, 1994, pp. 324\u2013333.","DOI":"10.1145\/197917.198119"},{"key":"10.1016\/S1571-0661(05)01148-5_bib16","doi-asserted-by":"crossref","unstructured":"Herlihy, M. and S. Rajsbaum, Algebraic spans, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, 1995, pp. 90\u201399, Mathematical Structures in Computer Science, to appear.","DOI":"10.1145\/224964.224975"},{"key":"10.1016\/S1571-0661(05)01148-5_bib17","series-title":"Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing","first-page":"133","article-title":"Unifying synchronous and asynchronous message-passing models","author":"Herlihy","year":"1998"},{"key":"10.1016\/S1571-0661(05)01148-5_bib18","doi-asserted-by":"crossref","DOI":"10.1145\/331524.331529","article-title":"The topological structure of asynchronous computability","author":"Herlihy","year":"1999","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)01148-5_bib19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Transactions on Programming Languages and Systems"},{"year":"1949","series-title":"\u201cIntroduction to Topology,\u201d","author":"Lefschetz","key":"10.1016\/S1571-0661(05)01148-5_bib20"},{"key":"10.1016\/S1571-0661(05)01148-5_bib21","unstructured":"Merritt, M., Notes on the Dolev-Strong lower bound for byzantine agreement (1985), unpublished manuscript."},{"year":"1984","series-title":"\u201cElements Of Algebraic Topology,\u201d","author":"Munkres","key":"10.1016\/S1571-0661(05)01148-5_bib22"},{"key":"10.1016\/S1571-0661(05)01148-5_bib23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)01148-5_bib24","doi-asserted-by":"crossref","unstructured":"Saks, M. and F. Zaharoglou, Wait-free k-set agreement is impossible: The topology of public knowledge, in: Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 101\u2013110, SIAM Journal on Computing, to appear.","DOI":"10.1145\/167088.167122"},{"year":"1966","series-title":"\u201cAlgebraic Topology,\u201d","author":"Spanier","key":"10.1016\/S1571-0661(05)01148-5_bib25"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011485?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011485?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:24Z","timestamp":1761609984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105011485"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01148-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An Overview of Synchronous Message-Passing and Topology","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01148-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}