{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:11:29Z","timestamp":1768871489954,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643478","type":"print"},{"value":"9783030643485","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64348-5_12","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"151-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Affine Tasks for k-Test-and-Set"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibault","family":"Rieutord","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., et al.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004460050039","volume":"11","author":"JH Anderson","year":"1997","unstructured":"Anderson, J.H., Moir, M.: Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distrib. Comput. 11(1), 1\u201320 (1997)","journal-title":"Distrib. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation. In: PODC, pp.189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Gafni, E., Kuznetsov, P.: Strong equivalence relations for iterated models. In: OPODIS, pp. 139\u2013154 (2014)","DOI":"10.1007\/978-3-319-14472-6_10"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: PODC, pp. 311\u2013324 (1990)","DOI":"10.1145\/93385.93431"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Delporte, C., Fauconnier, H., Rajsbaum, S., Raynal, M.: t-resilient immediate snapshot is impossible. In SIROCCO, pp. 177\u2013191 (2016)","DOI":"10.1007\/978-3-319-48314-6_12"},{"issue":"3\u20134","key":"12_CR8","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. Distrib. Comput. 24(3\u20134), 137\u2013147 (2011)","journal-title":"Distrib. Comput."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","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":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony. In: PODC, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"12_CR11","unstructured":"Gafni, E., He, Y., Kuznetsov, P., Rieutord, T.: Read-write memory and k-Set consensus as an affine task. In: OPODIS, pp. 6:1\u20136:17 (2017)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P., Manolescu, C.: A generalized asynchronous computability theorem. In: PODC, pp. 222\u2013231 (2014)","DOI":"10.1145\/2611462.2611477"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: OPODIS, pp. 205\u2013218 (2010)","DOI":"10.1007\/978-3-642-17653-1_17"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gafni, E., Raynal, M., Travers, C.: Test & set, adaptive renaming and set agreement: a guided visit to asynchronous computability. In: SRDS, pp. 93\u2013102 (2007)","DOI":"10.1109\/SRDS.2007.4365687"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR16","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":"12_CR17","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":"2","key":"12_CR18","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 46(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4310\/HHA.2012.v14.n1.a1","volume":"14","author":"DN Kozlov","year":"2012","unstructured":"Kozlov, D.N.: Chromatic subdivision of a simplicial complex. Homol. Homotopy Appl. 14(1), 1\u201313 (2012)","journal-title":"Homol. Homotopy Appl."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Rieutord, T.: Agreement functions for distributed computing models. In: NETYS, pp. 175\u2013190 (2017)","DOI":"10.1007\/978-3-319-59647-1_14"},{"key":"12_CR21","unstructured":"Kuznetsov, P., Rieutord, T.: Affine Tasks for k-Test-and-Set. working paper or preprint, June 2018"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Rieutord, T.: Brief announcement: on decidability of 2-process affine models. In: DISC, pp. 54:1\u201354:3 (2020)","DOI":"10.33920\/MED-12-2001-07"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Rieutord, T., He, Y.: An asynchronous computability theorem for fair adversaries. In: PODC, pp. 387\u2013396 (2018)","DOI":"10.1145\/3212734.3212765"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11864219_1","volume-title":"Distributed Computing","author":"A Mostefaoui","year":"2006","unstructured":"Mostefaoui, A., Raynal, M., Travers, C.: Exploring Gafni\u2019s reduction land: from $$\\Omega ^k$$ to wait-free adaptive $$(2p-\\lceil \\frac{p}{k}\\rceil )$$-renaming via k-set agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 1\u201315. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_1"},{"key":"12_CR25","unstructured":"Rieutord, T.: Combinatorial characterization of asynchronous distributed computability. Ph.D. thesis, Universit\u00e9 Paris Saclay (COmUE), October 2018"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-662-53426-7_31","volume-title":"Distributed Computing","author":"V Saraph","year":"2016","unstructured":"Saraph, V., Herlihy, M., Gafni, E.: Asynchronous computability theorems for t-resilient systems. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 428\u2013441. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_31"},{"key":"12_CR27","volume-title":"Algebraic Topology","author":"EH Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. McGraw-Hill Book Co., New York (1966)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64348-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T23:01:37Z","timestamp":1723935697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64348-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643478","9783030643485"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64348-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.msu.edu\/~sandeep\/SSS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}