{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:11:12Z","timestamp":1787501472578,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11795490_6","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"47-60","source":"Crossref","is-referenced-by-count":15,"title":["Randomized Wait-Free Consensus Using an Atomicity Assumption"],"prefix":"10.1007","author":[{"given":"Ling","family":"Cheung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050070","volume":"13","author":"M.K. Aguilera","year":"2000","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Failure detection and consensus in the crach recovery model. Distributed Computing\u00a013(2), 99\u2013125 (2000)","journal-title":"Distributed Computing"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. Journal of Algorithms\u00a011(3), 441\u2013461 (1990)","journal-title":"Journal of Algorithms"},{"key":"6_CR3","unstructured":"Aumann, Y., Kapah-Levy, A.: Cooperative sharing and asynchronous consensus using single-read single-writer registers. In: Proceedings of the 10th ACM-SIAM Anuual Symposium on Discrete Algorithms (SODA), pp. 61\u201370 (1999)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/278298.278304","volume":"45","author":"J. Aspnes","year":"1998","unstructured":"Aspnes, J.: Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM\u00a045(3), 415\u2013450 (1998)","journal-title":"Journal of the ACM"},{"issue":"2-3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J.: Randomized protocols for asynchronous consensus. Distributed Computing\u00a016(2-3), 165\u2013175 (2003)","journal-title":"Distributed Computing"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Aumann, Y.: Efficient asynchronous consensus with the weak adversary scheduler. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 209\u2013218 (1997)","DOI":"10.1145\/259380.259441"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1137\/S0097539792240881","volume":"25","author":"J. Aspnes","year":"1996","unstructured":"Aspnes, J., Waarts, O.: Randomized consensus in expected O(n log2 n) operations per process. SIAM Journal on Computing\u00a025(5), 1024\u20131044 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004460050046","volume":"11","author":"C. Baier","year":"1998","unstructured":"Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing\u00a011(3), 125\u2013155 (1998)","journal-title":"Distributed Computing"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-40026-5_9","volume-title":"Distributed Computing","author":"H. Buhrman","year":"2000","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vit\u00e1nyi, P.M.B.: On the importance of having an identity or is consensus really universal? In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 134\u2013148. Springer, Heidelberg (2000)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0022443","volume-title":"Distributed Algorithms","author":"G. Bracha","year":"1992","unstructured":"Bracha, G., Rachman, O.: Randomized consensus in expected O(n 2 logn) operations. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol.\u00a0579, pp. 143\u2013150. Springer, Heidelberg (1992)"},{"key":"6_CR12","unstructured":"Cheung, L., Hendriks, M.: Causal dependencies in parallel composition of stochastic processes. Technical Report ICIS-R05020, Institute for Computing and Information Sciences, University of Nijmegen (2005)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Chandra, T.D.: Polylog randomized wait-free consensus. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 166\u2013175 (1996)","DOI":"10.1145\/248052.248083"},{"key":"6_CR14","unstructured":"Cheung, L.: Collection of PRISM models of the modified CIL algorithm (2005), available at http:\/\/www.niii.ru.nl\/~lcheung\/mcil\/"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Cheung, L.: Randomized wait-free consensus using an atomicity assumption. Technical Report ICIS-R05035, Institute for Computing and Information Sciences, University of Nijmegen (2005), available at http:\/\/www.niii.ru.nl\/~lcheung\/cilTR.pdf","DOI":"10.1007\/11795490_6"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Chor, B., Israeli, A., Li, M.: On processor coordination using asynchronous hardware. In: Proceedings PODC 1987, pp. 86\u201397 (1987)","DOI":"10.1145\/41840.41848"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/S0097539790192635","volume":"23","author":"B. Chor","year":"1994","unstructured":"Chor, B., Israeli, A., Li, M.: Wait-free consensus using asynchronous hardware. SIAM Journal on Computing\u00a023(4), 701\u2013712 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","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. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. Journal of the ACM\u00a045(5), 843\u2013862 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","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. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Israeli, A., Shaham, A.: Optimal multi-writer multi-reader atomic register. In: Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pp. 71\u201382 (1992)","DOI":"10.1145\/135419.135435"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-36135-9_13","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G.: Verifying randomized Byzantine agreement. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529, pp. 194\u2013209. Springer, Heidelberg (2002)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-44585-4_17","volume-title":"Computer Aided Verification","author":"M. Kwiatkowska","year":"2001","unstructured":"Kwiatkowska, M., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 194\u2013206. Springer, Heidelberg (2001)"},{"key":"6_CR24","unstructured":"PRISM web site, http:\/\/www.cs.bham.ac.uk\/~dxp\/prism"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T09:45:14Z","timestamp":1683711914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11795490_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}