{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:08Z","timestamp":1761611228537,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_48","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"487-497","source":"Crossref","is-referenced-by-count":24,"title":["The Iterated Restricted Immediate Snapshot Model"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Rajsbaum","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"48_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"},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM\u00a032, 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"48_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, Chichester (2004)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proc. of PODC 1993, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM STOC, pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-free Computations. In: Proc. 16th ACM PODC, pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"issue":"2","key":"48_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. J. ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"48_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. J. ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"key":"48_CR10","doi-asserted-by":"publisher","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. Information and Computation\u00a0105, 132\u2013158 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"48_CR11","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. J. ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony. In: Proc. 17th ACM Symp. on Principles of Distributed Computing, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"48_CR13","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.: Subconsensus Tasks: Renaming is Weaker than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"issue":"2","key":"48_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00446-005-0141-8","volume":"18","author":"M. Herlihy","year":"2005","unstructured":"Herlihy, M., Penso, L.D.: Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Distributed Computing\u00a018(2), 157\u2013166 (2005)","journal-title":"Distributed Computing"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, M.P., Rajsbaum, S., Tuttle, M.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proc. 17th ACM PODC, pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"issue":"6","key":"48_CR16","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. J. ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Keidar, I., Shraer, A.: Timeliness, Failure-detectors, and Consensus Performance. In: Proc. 25th ACM PODC, pp. 169\u2013178 (2006)","DOI":"10.1145\/1146381.1146408"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes. In: Proc. PODC 2006, pp. 153\u2013162 (2006)","DOI":"10.1145\/1146381.1146406"},{"key":"48_CR19","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: Failure Detectors as Schedulers. Tech Report # 1838, IRISA, Universit\u00e9 de Rennes, France (2007)"},{"key":"48_CR20","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The Iterated Restricted Immediate Snapshot Model. Tech Report # 1874, IRISA, Universit\u00e9 de Rennes, France (2007)"},{"issue":"5","key":"48_CR21","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/11561927_5","volume-title":"Distributed Computing","author":"H. V\u00f6lzer","year":"2005","unstructured":"V\u00f6lzer, H.: On Conspiracies and Hyperfairness in Distributed Computing. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 33\u201347. Springer, Heidelberg (2005)"},{"key":"48_CR23","doi-asserted-by":"crossref","unstructured":"Yang, J., Neiger, G., Gafni, E.: Structured Derivations of Consensus Algorithms for Failure Detectors. In: Proc. 17th ACM PODC, pp. 297\u2013308 (1998)","DOI":"10.1145\/277697.277755"},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Zieli\u0144ski, P.: Anti-Omega: the Weakest Failure Detector for Set Agreement. Tech Rep # 694, University of Cambridge (2007)","DOI":"10.1145\/1400751.1400761"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:03:56Z","timestamp":1738325036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}