{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:19:27Z","timestamp":1742941167760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319492582"},{"type":"electronic","value":"9783319492599"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_13","type":"book-chapter","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T21:11:34Z","timestamp":1478034694000},"page":"154-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Perfect Failure Detection with Very Few Bits"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Thibault","family":"Rieutord","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Byron Cook, A.R., Podelski, A.: Proving program termination. Commun. ACM 54(5), 88\u201398 (2011)","DOI":"10.1145\/1941487.1941509"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-011-0146-4","volume":"24","author":"C Delporte-Gallet","year":"2011","unstructured":"Delporte-Gallet, C., Fauconnier, H., Toueg, S.: The minimum information about failures for solving non-local tasks in message-passing systems. Distrib. Comput. 24(5), 255\u2013269 (2011)","journal-title":"Distrib. Comput."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dubois, S., Guerraoui, R., Kuznetsov, P., Petit, F., Sens, P.: The weakest failure detector for eventual consistency. In: ACM Symposium on Principles of Distributed Computing (PODC), pp. 375\u2013384 (2015)","DOI":"10.1145\/2767386.2767404"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49529-2_37","volume-title":"LATIN 2016: Theoretical Informatics","author":"P Fraigniaud","year":"2016","unstructured":"Fraigniaud, P., Rajsbaum, S., Travers, C.: Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 497\u2013508. Springer, Heidelberg (2016). doi:\n 10.1007\/978-3-662-49529-2_37"},{"key":"13_CR7","unstructured":"Fraigniaud, P., Rajsbaum, S., Travers, C., Kuznetsov, P., Rieutord, T.: Perfect failure detection with very few bits. Technical report Hal-01365304, LaBRI (2016). \n https:\/\/hal.inria.fr\/hal-01365304"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1883612.1883616","volume":"43","author":"FC Freiling","year":"2011","unstructured":"Freiling, F.C., Guerraoui, R., Kuznetsov, P.: The failure detector abstraction. ACM Comput. Surv. 43(2), 9 (2011)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s446-002-8027-4","volume":"15","author":"R Guerraoui","year":"2002","unstructured":"Guerraoui, R.: Non-blocking atomic commit in asynchronous distributed systems with failure detectors. Distrib. Comput. 15(1), 17\u201325 (2002)","journal-title":"Distrib. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Haase, C., Schmitz, S., Schnoebelen, P.: The power of priority channel systems. Logical Meth. Comput. Sci. 10(4) (2014)","DOI":"10.2168\/LMCS-10(4:4)2014"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proceedings of the London Mathematical Society, vol. 3(2), pp. 326\u2013336 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: 27th ACM Symposium on Principles of Distributed Computing (PODC), pp. 75\u201384 (2008)","DOI":"10.1145\/1400751.1400763"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"JB Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory Ser. A 13(3), 297\u2013305 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01967649","volume":"13","author":"MH L\u00f6b","year":"1970","unstructured":"L\u00f6b, M.H., Wainer, S.S.: Hierarchies of number theoretic functions. I Arch. Math. Logic 13, 39\u201351 (1970)","journal-title":"I Arch. Math. Logic"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Milner, E.: Basic WQO- and BQO-theory. In: Graphs and Order, The Role of Graphs in the Theory of Ordered Sets and Its Applications. NATO ASI Series, pp. 487\u2013502 (1985)","DOI":"10.1007\/978-94-009-5315-4_14"},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/050645580","volume":"38","author":"A Most\u00e9faoui","year":"2008","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M., Travers, C.: The combined power of conditions and information on failures to solve asynchronous set agreement. SIAM J. Comput. 38(4), 1574\u20131601 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00446-008-0064-2","volume":"21","author":"A Most\u00e9faoui","year":"2008","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M., Travers, C.: On the computability power and the robustness of set agreement-oriented failure detector classes. Distrib. Comput. 21(3), 201\u2013222 (2008)","journal-title":"Distrib. Comput."},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A Most\u00e9faoui","year":"2001","unstructured":"Most\u00e9faoui, A., Raynal, M.: Leader-based consensus. Parallel Process. Lett. 11(1), 95\u2013107 (2001)","journal-title":"Parallel Process. Lett."},{"key":"13_CR19","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of WQO theory. Technical report Hal-00727025, HAL (2013). \n https:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-recursive upper bounds with Higman\u2019s lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 441\u2013452. Springer, Heidelberg (2011). doi:\n 10.1007\/978-3-642-22012-8_35"},{"key":"13_CR21","unstructured":"Turing, A.: Checking a large routine. In: Conference on High Speed Automatic Calculating Machines, pp. 67\u201369 (1949)"}],"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-319-49259-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:21:11Z","timestamp":1558315271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 November 2016","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 Stabilization, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/avalon.ens-lyon.fr\/SSS16\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}