{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:36:58Z","timestamp":1763415418803},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T00:00:00Z","timestamp":1494806400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00224-017-9779-4","type":"journal-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T07:03:17Z","timestamp":1494831797000},"page":"1085-1108","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Closer Look at Fault Tolerance"],"prefix":"10.1007","volume":"62","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,15]]},"reference":[{"key":"9779_CR1","first-page":"91","volume-title":"Proceedings 18th ACM Symp. on Principles of Distributed Computing","author":"Y Afek","year":"1999","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive Proceedings 18th ACM Symp. on Principles of Distributed Computing, pp 91\u2013103 (1999)"},{"key":"9779_CR2","first-page":"218","volume-title":"Proceedings 25th ACM Symp. on Principles of Distributed Computing","author":"Y Afek","year":"2006","unstructured":"Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency Proceedings 25th ACM Symp. on Principles of Distributed Computing, pp 218\u2013227 (2006)"},{"key":"9779_CR3","first-page":"159","volume-title":"Proceedings 12th ACM Symp. on Principles of Distributed Computing","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects Proceedings 12th ACM Symp. on Principles of Distributed Computing, pp 159\u2013170 (1993)"},{"key":"9779_CR4","first-page":"141","volume-title":"Proceedings 14th ACM Symp. on Principles of Distributed Computing","author":"JH Anderson","year":"1994","unstructured":"Anderson, J.H., Moir, M.: Using k-exclusion to implement resilient, scalable shared objects Proceedings 14th ACM Symp. on Principles of Distributed Computing, pp 141\u2013150 (1994)"},{"key":"9779_CR5","first-page":"337","volume-title":"Proceedings 28th IEEE Symp. on Foundations of Computer Science","author":"H Attiya","year":"1987","unstructured":"Attiya, H., Bar-noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Achievable cases in an asynchronous environment Proceedings 28th IEEE Symp. on Foundations of Computer Science, pp 337\u2013346 (1987)"},{"issue":"3","key":"9779_CR6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. Assoc. Comput. Mach. 37(3), 524\u2013548 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9779_CR7","first-page":"149","volume-title":"Proceedings 14th International Symp. on Distributed Computing: Lecture Notes in Computer Science, vol. 1914","author":"H Attiya","year":"2000","unstructured":"Attiya, H., Fouren, A.: Polynomial and adaptive long-lived (2k \u2212 1)-renaming Proceedings 14th International Symp. on Distributed Computing: Lecture Notes in Computer Science, vol. 1914, pp 149\u2013163 (2000)"},{"issue":"4","key":"9779_CR8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/792538.792541","volume":"50","author":"H Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 144\u2013468 (2003)","journal-title":"J. ACM"},{"key":"9779_CR9","first-page":"307","volume-title":"Proceedings 8th ACM Symp. on Principles of Distributed Computing","author":"A Bar-Noy","year":"1989","unstructured":"Bar-Noy, A., Dolev, D.: Shared memory versus message-passing in an asynchronous distributed environment Proceedings 8th ACM Symp. on Principles of Distributed Computing, pp 307\u2013318 (1989)"},{"key":"9779_CR10","first-page":"91","volume-title":"Proceedings 25th ACM Symp. on Theory of Computing","author":"E Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalizecl FLP impossibility result for t-resilient asynchronous computations Proceedings 25th ACM Symp. on Theory of Computing, pp 91\u2013100 (1993)"},{"issue":"3","key":"9779_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"9779_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00446-011-0137-5","volume":"24","author":"A Brodsky","year":"2011","unstructured":"Brodsky, A., Ellen, F., Woelfel, P.: Fully-adaptive algorithms for long-lived renaming. Distrib. Comput. 24(2), 119\u2013134 (2011)","journal-title":"Distrib. Comput."},{"key":"9779_CR13","first-page":"79","volume-title":"Proceedings of the International Conf. on Parallel Processing","author":"JE Burns","year":"1978","unstructured":"Burns, J.E., Fischer, M.J., Jackson, P., Lynch, N.A., Peterson, G.L.: Shared data requirements for implementation of mutual exclusion using a test-and-set primitive Proceedings of the International Conf. on Parallel Processing, pp 79\u201387 (1978)"},{"issue":"1","key":"9779_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322290.322302","volume":"29","author":"JE Burns","year":"1982","unstructured":"Burns, J.E., Jackson, P., Lynch, N.A., Fischer, M.J., Peterson, G.L.: Data requirements for implementation of N-process mutual exclusion using a single shared variable. J. Assoc. Comput. Mach. 29(1), 183\u2013205 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9779_CR15","first-page":"833","volume-title":"18th annual allerton conference on communication, control and computing","author":"JE Burns","year":"1980","unstructured":"Burns, J.E., Lynch, A.N.: Mutual exclusion using indivisible reads and writes 18th annual allerton conference on communication, control and computing, pp 833\u2013842 (1980)"},{"key":"9779_CR16","first-page":"145","volume-title":"Proceedings 8th ACM Symp. on Principles of Distributed Computing","author":"JE Burns","year":"1989","unstructured":"Burns, J.E., Peterson, G.L.: The ambiguity of choosing Proceedings 8th ACM Symp. on Principles of Distributed Computing, pp 145\u2013158 (1989)"},{"issue":"2","key":"9779_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"JN Burns","year":"1993","unstructured":"Burns, J.N., Lynch, N.A.: Bounds on shared-memory for mutual exclusion. Inf. Comput. 107(2), 171\u2013184 (1993)","journal-title":"Inf. Comput."},{"issue":"3","key":"9779_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Castaneda","year":"2011","unstructured":"Castaneda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Computer Science Review 5(3), 229\u2013251 (2011)","journal-title":"Computer Science Review"},{"key":"9779_CR19","first-page":"288","volume-title":"Proceedings 28th ACM Symp. on Principles of Distributed Computing","author":"C Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmanns, A.: The disagreement power of an adversary Proceedings 28th ACM Symp. on Principles of Distributed Computing, pp 288\u2013289 (2009)"},{"issue":"9","key":"9779_CR20","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"issue":"2","key":"9779_CR21","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., 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"},{"key":"9779_CR22","first-page":"161","volume-title":"Proceedings 20th ACM Symp. on Principles of Distributed Computing","author":"E Gafni","year":"2001","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency Proceedings 20th ACM Symp. on Principles of Distributed Computing, pp 161\u2013169 (2001)"},{"issue":"1","key":"9779_CR23","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"MP Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"9779_CR24","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"MP Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"9779_CR25","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9779_CR26","first-page":"55","volume-title":"Proceedings 29th ACM Symp. on Principles of Distributed Computing","author":"D Imbs","year":"2010","unstructured":"Imbs, D., Raynal, M., Taubenfeld, G.: On asymmetric progress conditions Proceedings 29th ACM Symp. on Principles of Distributed Computing, pp 55\u201364 (2010)"},{"key":"9779_CR27","doi-asserted-by":"crossref","unstructured":"Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2)-renaming with O(k 2) steps 15th international symposium on distributed computing (2001)","DOI":"10.1007\/3-540-45414-4_9"},{"key":"9779_CR28","first-page":"275","volume-title":"Proceedings 11th ACM Symp. on Principles of Distributed Computing","author":"E Kushilevitz","year":"1992","unstructured":"Kushilevitz, E., Rabin, M.O.: Randomized mutual exclusion algorithms revisited Proceedings 11th ACM Symp. on Principles of Distributed Computing, pp 275\u2013283 (1992)"},{"key":"9779_CR29","first-page":"54","volume":"106","author":"P Kuznetsov","year":"2012","unstructured":"Kuznetsov, P.: Understanding non-uniform failure models. Distributed computing column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS) 106, 54\u201377 (2012)","journal-title":"Distributed computing column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS)"},{"issue":"2","key":"9779_CR30","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9779_CR31","first-page":"163","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Compet. Res. 4, 163\u2013183 (1987)","journal-title":"Adv. Compet. Res."},{"issue":"1","key":"9779_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M Moir","year":"1995","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1), 1\u201339 (1995)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"9779_CR33","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S Moran","year":"1987","unstructured":"Moran, S., Wolfstahl, Y.: Extended impossibility results for asynchronous complete networks. Inf. Process. Lett. 26(3), 145\u2013151 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9779_CR34","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":"9779_CR35","unstructured":"Peterson, G.L.: New Bounds on Mutual Exclusion Problems. Technical Report TR68, University of Rochester, February 1980 (1994)"},{"key":"9779_CR36","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion The MIT Press, 1986. Translation of Algorithmique du parall\u00e9lisme (1984)"},{"key":"9779_CR37","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput. 29 (2000)","DOI":"10.1137\/S0097539796307698"},{"key":"9779_CR38","first-page":"177","volume-title":"Proceedings 8th ACM Symp. on Principles of Distributed Computing","author":"E Styer","year":"1989","unstructured":"Styer, E., Peterson, G.L.: Tight bounds for shared memory symmetric mutual exclusion problems Proceedings 8th ACM Symp. on Principles of Distributed Computing, pp 177\u2013191 (1989)"},{"key":"9779_CR39","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall, 2006. ISBN 0-131-97259-6, 423 pages"},{"key":"9779_CR40","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: The computational structure of progress conditions 24th international symposium on distributed computing (DISC 2010), September 2010. LNCS 6343, vol. 2010, pp 221\u2013235. Springer Verlag","DOI":"10.1007\/978-3-642-15763-9_23"},{"key":"9779_CR41","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/2933057.2933058","volume-title":"Proceedings 35Th ACM Symp. on Principles of Distributed Computing (PODC \u201916)","author":"G Taubenfeld","year":"2016","unstructured":"Taubenfeld, G.: Brief Announcement: Computing in the Presence of Weak Crash Failures Proceedings 35Th ACM Symp. on Principles of Distributed Computing (PODC \u201916), pp 349\u2013351 (2016)"},{"issue":"1","key":"9779_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s002360050034","volume":"33","author":"G Taubenfeld","year":"1996","unstructured":"Taubenfeld, G., Moran, S.: Possibility and impossibility results in a shared memory environment. Acta Informatica 33(1), 1\u201320 (1996)","journal-title":"Acta Informatica"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9779-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9779-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9779-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T17:01:43Z","timestamp":1569344503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9779-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,15]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9779"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9779-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,15]]}}}