{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:31:36Z","timestamp":1736314296715,"version":"3.32.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf02280837","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:11:08Z","timestamp":1138201868000},"page":"75-85","source":"Crossref","is-referenced-by-count":2,"title":["Necessary and sufficient conditions for broadcast consensus protocols"],"prefix":"10.1007","volume":"7","author":[{"given":"Louise E.","family":"Moser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Melliar-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek","family":"Agrawala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02280837_CR1","doi-asserted-by":"crossref","unstructured":"Amir Y, Moser LE, Melliar-Smith PM, Agarwal DA, Ciarfella P: Fast message ordering and membership using a logical tokenpassing ring. Proc 13th Int Conf on Distributed Computing Systems, Pittsburgh 1993, pp 551\u2013560","DOI":"10.1109\/ICDCS.1993.287668"},{"issue":"4","key":"BF02280837_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01872844","volume":"2","author":"\u00d6 Babao\u011dlu","year":"1988","unstructured":"Babao\u011dlu \u00d6, Stephenson P, Drummond R: Reliable broadcasts and communication models: tradeoffs and lower bounds. Distrib Comput 2(4): 177\u2013189 (1988)","journal-title":"Distrib Comput"},{"key":"BF02280837_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or M: Another advantage of free choice: completely asynchronous agreement protocols. Proc 2nd Annual ACM Symposium on Principles of Distributed Computing. Montreal 1983, pp 27\u201330","DOI":"10.1145\/800221.806707"},{"key":"BF02280837_CR4","doi-asserted-by":"crossref","unstructured":"Biran O, Moran S, Zaks S: A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. Proc 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto 1988, pp 263\u2013277","DOI":"10.1145\/62546.62590"},{"issue":"4","key":"BF02280837_CR5","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha G, Toueg S: Asynchronous consensus and broadcast protocols. J ACM: 32(4): 824\u2013840 (1985)","journal-title":"J ACM"},{"key":"BF02280837_CR6","unstructured":"Cristian F, Aghili H, Strong R, Dolev D: Atomic broadcast: from simple message diffusion to Byzantine agreement. Proc 15th IEEE Symposium on Fault Tolerant Computing. Ann Arbor 1985, pp 200\u2013206"},{"issue":"1","key":"BF02280837_CR7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/75372.75384","volume":"17","author":"PB Danzig","year":"1989","unstructured":"Danzig PB: Finite buffers and fast multicast. Proc ACM Conference on Measurement and Modelling of Computing Systems. Performance Eval Rev 17(1): 108\u2013117 (1989)","journal-title":"Performance Eval Rev"},{"issue":"3","key":"BF02280837_CR8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev D, Lynch NA, Reuter SS, Stark EW, Weihl WE: Reaching approximate agreement in the presence of fauls. J ACM: 33(3): 499\u2013516 (1986)","journal-title":"J ACM"},{"issue":"1","key":"BF02280837_CR9","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(1): 77\u201397 (1987)","journal-title":"J ACM"},{"key":"BF02280837_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-50403-6_32","volume-title":"Proceedings of Concurrency 88","author":"D Dolev","year":"1988","unstructured":"Dolev D, Strong HR: On safety and timeliness in distributed data management. Proceedings of Concurrency 88. Lect Notes Comput Sci, vol 335, Springer, Berlin Heidelberg New York 1988, pp 64\u201372"},{"issue":"2","key":"BF02280837_CR11","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork C, Lynch N, Stockmeyer L: Consensus in the presence of partial synchrony. J ACM 35(2): 288\u2013323 (1988)","journal-title":"J ACM"},{"key":"BF02280837_CR12","unstructured":"Ezhilchelvan PD: Early stopping algorithms for distributed agreement under fail-stop, omission and timing faults. Proc IEEE Symposium on Reliability in Distributed Software and Database Systems, Williamsburg, 1987, pp 201\u2013212"},{"issue":"2","key":"BF02280837_CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374\u2013382 (1985)","journal-title":"J ACM"},{"key":"BF02280837_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-08755-9_9","volume-title":"Operating systems: an advanced course","author":"JN Gray","year":"1978","unstructured":"Gray JN: Notes on data base operating systems. In: Bayer R, Graham RM, Seegm\u00fcller G (eds) Operating systems: an advanced course. Lect Notes Comput Sci, vol 60, Springer, Berlin Heidelberg New York 1978, pp 393\u2013481"},{"key":"BF02280837_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy MP: Impossibility and universality results for wait-free synchronization. Proc 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto 1988, pp 276\u2013290","DOI":"10.1145\/62546.62593"},{"issue":"1","key":"BF02280837_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/40.16792","volume":"9","author":"H Kopetz","year":"1989","unstructured":"Kopetz H, Damm A, Koza C, Mulazzani M, Schwabl W, Senft C, Zainlinger R: Distributed fault-tolerant real-time systems: the Mars approach. IEEE Micro 9(1): 25\u201340 (1989)","journal-title":"IEEE Micro"},{"issue":"1","key":"BF02280837_CR17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2455.2457","volume":"32","author":"L Lamport","year":"1985","unstructured":"Lamport L, Melliar-Smith PM: Synchronizing clocks in the presence of faults. J ACM 32(1): 52\u201378 (1985)","journal-title":"J ACM"},{"key":"BF02280837_CR18","first-page":"163","volume":"4","author":"CM Loui","year":"1988","unstructured":"Loui CM, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Adv Comput Res 4: 163\u2013183 (1988)","journal-title":"Adv Comput Res"},{"key":"BF02280837_CR19","doi-asserted-by":"crossref","unstructured":"Mahaney SR, Schneider FB: Inexact agreement: accuracy, precision, and graceful degradation. Proc 4th Annual ACM Symposium on Principles of Distributed Computing, Minaki 1985, pp 237\u2013249","DOI":"10.1145\/323596.323618"},{"issue":"1","key":"BF02280837_CR20","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(1): 17\u201325 (1990)","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"BF02280837_CR21","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L: Reaching agreement in the presence of faults. J ACM 27(2): 228\u2013234 (1980)","journal-title":"J ACM"},{"key":"BF02280837_CR22","doi-asserted-by":"crossref","unstructured":"Rabin M: Randomized Byzantine generals. Proc 24th Symposium of Foundations of Computer Science, Tucson 1983, pp 403\u2013409","DOI":"10.1109\/SFCS.1983.48"},{"key":"BF02280837_CR23","series-title":"Tech Rep","volume-title":"Impossibility results in the presence of multiple faulty processes","author":"G Taubenfeld","year":"1988","unstructured":"Taubenfeld G, Katz S, Moran S: Impossibility results in the presence of multiple faulty processes. Tech Rep 492, Computer Science Department, Technion, Haifa 1988"},{"key":"BF02280837_CR24","doi-asserted-by":"crossref","unstructured":"Ver\u00edssimo P, Marques JA: Reliable broadcast for fault-tolerance on local computer networks. Proc 9th IEEE Symposium on Reliable Distributed Systems, Huntsville 1990, pp 54\u201363","DOI":"10.1109\/RELDIS.1990.93951"},{"issue":"10","key":"BF02280837_CR25","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/PROC.1978.11114","volume":"66","author":"J Wensley","year":"1978","unstructured":"Wensley J, Lamport L, Goldberg J, Green MW, Levitt KN, Melliar-Smith PM, Shostak RE, Weinstock CB: SIFT: design and analysis of a fault-tolerant computer for aircraft control. Proc IEEE 66(10): 1240\u20131255 (1978)","journal-title":"Proc IEEE"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280837.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02280837\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:44:54Z","timestamp":1736250294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02280837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02280837"],"URL":"https:\/\/doi.org\/10.1007\/bf02280837","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}