{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:41:11Z","timestamp":1765294871213},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_16","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"206-221","source":"Crossref","is-referenced-by-count":7,"title":["Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour"],"prefix":"10.1007","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"MK Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A simple bi-valency proof that $$t$$ -resilient consensus requires $$t+1$$ rounds. Inf. Process. Lett. 71, 155\u2013158 (1999)","journal-title":"Inf. Process. Lett."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-56188-9_15","volume-title":"Distributed Algorithms","author":"P Berman","year":"1992","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Optimal early stopping in distributed consensus. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 221\u2013237. Springer, Heidelberg (1992). doi: 10.1007\/3-540-56188-9_15"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-662-45174-8_7","volume-title":"Distributed Computing","author":"A Casta\u00f1eda","year":"2014","unstructured":"Casta\u00f1eda, A., Gonczarowski, Y.A., Moses, Y.: Unbeatable consensus. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 91\u2013106. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45174-8_7"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda A., Gonczarowski Y.A., Moses, Y.: Unbeatable set consensus via topological and combinatorial reasoning. In: Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), pp. 107\u2013116. ACM Press (2016)","DOI":"10.1145\/2933057.2933120"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105, 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"issue":"4","key":"16_CR6","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in Byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"issue":"2","key":"16_CR7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C Dwork","year":"1990","unstructured":"Dwork, C., Moses, Y.: Knowledge and common knowledge in a Byzantine environment: crash failure. Inf. Comput. 88(2), 156\u2013186 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"16_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.ipl.2004.04.006","volume":"91","author":"P Dutta","year":"2004","unstructured":"Dutta, P., Guerraoui, R., Pochon, B.: Fast non-blocking atomic commit: an inherent tradeoff. Inf. Process. Lett. 91(4), 195\u2013200 (2004)","journal-title":"Inf. Process. Lett."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (2003)","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M Fischer","year":"1982","unstructured":"Fischer, M., Lynch, N.: A lower bound for the time to ensure interactive consistency. Inf. Process. Lett. 14, 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"16_CR11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"16_CR12","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/S0097539798340217","volume":"31","author":"JY Halpern","year":"2001","unstructured":"Halpern, J.Y., Moses, Y., Waarts, O.: A characterization of eventual Byzantine agreement. SIAM J. Comput. 31(3), 838\u2013865 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A simple proof of the uniform consensus synchronous lower bound. Inf. Process. Lett. 85(1), 47\u201352 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Trans. Prog. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01762112","volume":"3","author":"Y Moses","year":"1988","unstructured":"Moses, Y., Tuttle, M.R.: Programming simultaneous actions using common knowledge. Algorithmica 3, 121\u2013169 (1988)","journal-title":"Algorithmica"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R.R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"16_CR17","unstructured":"Lynch, N.A.: Distributed algorithms, 872 p. Morgan Kaufmann Publishers, San Francisco (1996). ISBN 1-55860-384-4"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Ra\u00efpin Parv\u00e9dy, Ph., Raynal, M.: Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2004), pp. 302\u2013310. ACM Press (2004)","DOI":"10.1145\/1007912.1007963"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-tolerant agreement in synchronous message-passing systems, 189 p. Morgan & Claypool Publishers (2010). ISBN 978-1-60845-525-6","DOI":"10.2200\/S00294ED1V01Y201009DCT003"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, 515 p. Springer, Heidelberg (2013). ISBN 978-3-642-32026-2","DOI":"10.1007\/978-3-642-32027-9"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Set Agreement, 2nd edn. Encyclopedia of Algorithms, pp. 1956\u20131959. Springer, New York (2016)","DOI":"10.1007\/978-1-4939-2864-4_367"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ipl.2005.08.002","volume":"96","author":"X Wang","year":"2005","unstructured":"Wang, X., Teo, Y.M., Cao, J.: A bivalency proof of the lower bound for uniform consensus. Inf. Process. Lett. 96, 167\u2013174 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:58:01Z","timestamp":1569326281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}