{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:25:39Z","timestamp":1769912739178,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031442735","type":"print"},{"value":"9783031442742","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_6","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Invited Paper: Time Is Not a\u00a0Healer, but\u00a0It Sure Makes Hindsight 20:20"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2341-7928","authenticated-orcid":false,"given":"Giuliano","family":"Losa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Afek, A., Gafni, E.: A simple characterization of asynchronous computations. Theor. Comput. Sci. 561Part B, 88\u201395 (2015). ISSN 0304\u20133975. https:\/\/doi.org\/10.1016\/j.tcs.2014.07.022. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397514005659","DOI":"10.1016\/j.tcs.2014.07.022"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM (JACM) 42(1), 124\u2013142 (1995). ISSN 0004\u20135411. https:\/\/doi.org\/10.1145\/200836.200869","DOI":"10.1145\/200836.200869"},{"key":"6_CR3","doi-asserted-by":"publisher","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, vol. 19. Wiley, Hoboken (2004)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus. In: FOCS, vol. 89, pp. 410\u2013415 (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-43144-4_7","volume-title":"Interactive Theorem Proving","author":"B Bisping","year":"2016","unstructured":"Bisping, B., et al.: Mechanical verification of a constructive proof for FLP. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 107\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43144-4_7"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 91\u2013100 (1993). ACM. ISBN 978-0-89791-591-5. https:\/\/doi.org\/10.1145\/167088.167119","DOI":"10.1145\/167088.167119"},{"key":"6_CR7","unstructured":"Chandy, M., Misra, J.: On the nonexistence of robust commit protocols (1985)"},{"key":"6_CR8","unstructured":"Constable, R.: Effectively nonblocking consensus procedures can execute forever-a constructive version of FLP (2011)"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. 32(2), 374\u2013382 (1985). ISSN 0004\u20135411. https:\/\/doi.org\/10.1145\/3149.214121","DOI":"10.1145\/3149.214121"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1983, pp. 1\u20137 (1985). Association for Computing Machinery, ISBN 978-0-89791-097-2. https:\/\/doi.org\/10.1145\/588058.588060","DOI":"10.1145\/588058.588060"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991). ISSN 0164\u20130925. https:\/\/doi.org\/10.1145\/114005.102808","DOI":"10.1145\/114005.102808"},{"key":"6_CR12","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2013). ISBN 978-0-12-404578-1"},{"issue":"6","key":"6_CR13","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 (JACM) 46(6), 858\u2013923 (1999)","journal-title":"J. ACM (JACM)"},{"issue":"163","key":"6_CR14","first-page":"31","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4(163), 31 (1987)","journal-title":"Adv. Comput. Res."},{"key":"6_CR15","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Raynal, M., Roy, M.: A note on a simple equivalence between round-based synchronous and asynchronous models. In: 11th Pacific Rim International Symposium on Dependable Computing (PRDC 2005), p. 4 (2005). https:\/\/doi.org\/10.1109\/PRDC.2005.10","DOI":"10.1109\/PRDC.2005.10"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. 29(5):1449\u20131483 (2000). ISSN 0097\u20135397. https:\/\/doi.org\/10.1137\/S0097539796307698. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/S0097539796307698","DOI":"10.1137\/S0097539796307698"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"N Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 1989. LNCS, vol. 349, pp. 304\u2013313. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0028994"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-52921-7_85","volume-title":"Algorithms","author":"N Santoro","year":"1990","unstructured":"Santoro, N., Widmayer, P.: Distributed function evaluation in the presence of transmission faults. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 358\u2013367. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52921-7_85"},{"issue":"5","key":"6_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0020-0190(91)90221-3","volume":"37","author":"G Taubenfeld","year":"1991","unstructured":"Taubenfeld, G.: On the nonexistence of resilient consensus protocols. Inf. Process. Lett. 37(5), 285\u2013289 (1991)","journal-title":"Inf. Process. Lett."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"V\u00f6lzer, H.: A constructive proof for FLP. 92(2), 83\u201387. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019004001887","DOI":"10.1016\/j.ipl.2004.06.008"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:02:39Z","timestamp":1709859759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","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":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}