{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:35:47Z","timestamp":1763415347449},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_10","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"139-154","source":"Crossref","is-referenced-by-count":5,"title":["Strong Equivalence Relations for Iterated Models"],"prefix":"10.1007","author":[{"given":"Zohir","family":"Bouzid","sequence":"first","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press (May 1993)","DOI":"10.1145\/167088.167119"},{"key":"10_CR3","first-page":"41","volume-title":"PODC","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351. ACM Press, New York (1993)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: PODC, pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"issue":"3-4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00446-010-0122-4","volume":"24","author":"C. Delporte-Gallet","year":"2011","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. Distributed Computing\u00a024(3-4), 137\u2013147 (2011)","journal-title":"Distributed Computing"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"10_CR7","unstructured":"Gafni, E.: On the wait-free power of iterated-immediate-snapshots (1998), \n                    \n                      http:\/\/www.cs.ucla.edu\/~eli\/eli\/wfiis.ps\n                    \n                    \n                   (unpublished manuscript)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): Unifying synchrony and asynchrony. In: PODC, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-92221-6_17","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2008","unstructured":"Gafni, E.: The 0\u20131-exclusion families of tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 246\u2013258. Springer, Heidelberg (2008)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-17653-1_28","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2010","unstructured":"Gafni, E., Kuznetsov, P.: Turning adversaries into friends: Simplified, made constructive, and extended. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 380\u2013394. Springer, Heidelberg (2010)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-17679-1_17","volume-title":"Distributed Computing and Networking","author":"E. Gafni","year":"2011","unstructured":"Gafni, E., Kuznetsov, P.: Relating \n                    \n                      \n                    \n                    $\\mathcal{L}$\n                  -resilience and wait-freedom via hitting sets. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 191\u2013202. Springer, Heidelberg (2011)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P., Manolescu, C.: A generalized asynchronous computability theorem. In: PODC (2014)","DOI":"10.1145\/2611462.2611477"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-17653-1_17","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2010","unstructured":"Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 205\u2013218. Springer, Heidelberg (2010)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.P.: Subconsensus tasks: Renaming is weaker than set agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann (2014)","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: PODC, pp. 253\u2013260 (2012)","DOI":"10.1145\/2332432.2332483"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00446-013-0189-9","volume":"26","author":"M. Herlihy","year":"2013","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of distributed adversaries. Distributed Computing\u00a026(3), 173\u2013192 (2013)","journal-title":"Distributed Computing"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: STOC, pp. 111\u2013120 (May 1993)","DOI":"10.1145\/167088.167125"},{"issue":"2","key":"10_CR19","first-page":"858","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J.\u00a0ACM\u00a046(2), 858\u2013923 (1999)","journal-title":"J.\u00a0ACM"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-25873-2_22","volume-title":"Principles of Distributed Systems","author":"M. Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 313\u2013328. Springer, Heidelberg (2011)"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4310\/HHA.2012.v14.n1.a1","volume":"14","author":"D.N. Kozlov","year":"2012","unstructured":"Kozlov, D.N.: Chromatic subdivision of a simplicial complex. Homology, Homotopy and Applications\u00a014(1), 1\u201313 (2012)","journal-title":"Homology, Homotopy and Applications"},{"key":"10_CR22","first-page":"53","volume":"106","author":"P. Kuznetsov","year":"2012","unstructured":"Kuznetsov, P.: Understanding non-uniform failure models. Bulletin of the EATCS\u00a0106, 53\u201377 (2012)","journal-title":"Bulletin of the EATCS"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-03089-0_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"P. Kuznetsov","year":"2013","unstructured":"Kuznetsov, P.: Universal model simulation: BG and extended BG as examples. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol.\u00a08255, pp. 17\u201331. Springer, Heidelberg (2013)"},{"key":"10_CR24","unstructured":"Linial, N.: Doing the IIS (2010) (unpublished manuscript)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-12200-2_36","volume-title":"LATIN 2010: Theoretical Informatics","author":"S. Rajsbaum","year":"2010","unstructured":"Rajsbaum, S.: Iterated shared memory models. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 407\u2013416. Springer, Heidelberg (2010)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-69733-6_48","volume-title":"Computing and Combinatorics","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The iterated restricted immediate snapshot model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 487\u2013497. Springer, Heidelberg (2008)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-31104-8_20","volume-title":"Structural Information and Communication Complexity","author":"M. Raynal","year":"2012","unstructured":"Raynal, M., Stainer, J.: Increasing the power of the iterated immediate snapshot model with failure detectors. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 231\u2013242. Springer, Heidelberg (2012)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Raynal, M., Stainer, J.: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. In: PODC (2013)","DOI":"10.1145\/2484239.2484249"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:55:09Z","timestamp":1559087709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}