{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:45:23Z","timestamp":1743119123329,"version":"3.40.3"},"publisher-location":"Cham","reference-count":98,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031814037"},{"type":"electronic","value":"9783031814044"}],"license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81404-4_3","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:39:12Z","timestamp":1735605552000},"page":"24-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Invited Paper: Distributed Computability: A Few Results Masters Students Should Know"],"prefix":"10.1007","author":[{"given":"Michel","family":"Raynal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"issue":"4","key":"3_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 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Ellen, F., Gafni, E.: Deterministic objects: life beyond consensus. In: Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), pp.\u00a097\u2013106. ACM Press (2016)","DOI":"10.1145\/2933057.2933116"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2014.07.022","volume":"561","author":"Y Afek","year":"2015","unstructured":"Afek, Y., Gafni, E.: A simple characterization of asynchronous computations. Theoret. Comput. Sci. 561, 88\u201395 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-009-0090-8","volume":"22","author":"Y Afek","year":"2010","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The $$k$$-simultaneous consensus problem. Distrib. Comput. 22(3), 185\u2013195 (2010)","journal-title":"Distrib. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"MK Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A simple bi-valency proof that $$t$$-resilient consensus requires $$t+1$$ rounds. Inf. Process. Lett. 71, 155\u2013158 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"JH Anderson","year":"1994","unstructured":"Anderson, J.H.: Multi-writer composite registers. Distrib. Comput. 7(4), 175\u2013195 (1994)","journal-title":"Distrib. Comput."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"121","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 42(1), 121\u2013132 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/3376902","volume":"63","author":"H Attiya","year":"2020","unstructured":"Attiya, H., Rajsbaum, S.: Indistinguishability. Commun. ACM 63(5), 90\u201399 (2020)","journal-title":"Commun. ACM"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Attiya H., Welch J.L.: Distributed computing: fundamentals, simulations and advanced topics, 2nd edn, 414p. Wiley-Interscience (2004). ISBN 0-471-45324-2","DOI":"10.1002\/0471478210"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC 1983), pp.\u00a027\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC 1994), pp.\u00a0183\u2013192. ACM Press (1994)","DOI":"10.1145\/197917.198088"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351. ACM Press (1993)","DOI":"10.1145\/164051.164056"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Most\u00e9faoui, Raynal, M.: Minimal synchrony for Byzantine consensus. In: Proceeding of the 34th ACM Symposium on Principles of Distributed Computing (PODC 2015), pp.\u00a0461\u2013470. ACM Press (2015)","DOI":"10.1145\/2767386.2767418"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"3_CR17","unstructured":"Cachin, Ch., Guerraoui, R., Rodrigues, L.: Reliable and Secure Distributed Programming, 367p. Springer (2011). ISBN 978-3-642-15259-7"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Casta\u00f1eda","year":"2011","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Elsevier Comput. Sci. Rev. 5, 229\u2013251 (2011)","journal-title":"Elsevier Comput. Sci. Rev."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Unifying concurrent objects and distributed tasks: interval-linearizability. J. ACM 65(6), 45 (2018). 42 pages","DOI":"10.1145\/3266457"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/3546826","volume":"66","author":"A Casta\u00f1eda","year":"2023","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: A linearizability-based hierarchy for concurrent specifications. Commun. ACM 66(1), 86\u201397 (2023)","journal-title":"Commun. ACM"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00446-022-00440-y","volume":"36","author":"A Casta\u00f1eda","year":"2023","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Sets, fetch &increment, stacks and queues with multiplicity: a relaxation that allows set-linearizable implementations from read\/write operations. Distrib. Comput. 36(2), 89\u2013106 (2023)","journal-title":"Distrib. Comput."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Petrank, E., Timnat, S.: Help! In: Proceedings of the 34th Symposium on Principles of Distributed Computing (PODC 2015), pp. 241\u2013250. ACM Press (2015)","DOI":"10.1145\/2767386.2767415"},{"issue":"4","key":"3_CR23","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":"3_CR24","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":"1","key":"3_CR25","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. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Correia, M., Ferreira Neves, N., Ver\u00edssimo, P.: How to tolerate half less one Byzantine nodes in practical distributed systems. In: Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), pp.\u00a0174\u2013183. IEEE Press (2004)","DOI":"10.1109\/RELDIS.2004.1353018"},{"issue":"6","key":"3_CR27","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1093\/comjnl\/bxs148","volume":"56","author":"M Correia","year":"2013","unstructured":"Correia, M., Ferreira, N.N., Ver\u00edssimo, P.: BFT-TO: intrusion tolerance with less replicas. Comput. J. 56(6), 693\u2013715 (2013)","journal-title":"Comput. J."},{"key":"3_CR28","unstructured":"Daian, E., Losa, G., Afek, Y., Gafni, E.: A wealth of sub-consensus deterministic objects. In: Proceedings of the 32nd International Symposium on Distributed Computing (DISC 2018), LIPICS 121, 17p (2018)"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.H., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of failures. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Dolev, D., Reischuk, R.S., H.R.,: Early stopping in Byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","DOI":"10.1145\/96559.96565"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"issue":"8","key":"3_CR32","doi-asserted-by":"publisher","first-page":"3752","DOI":"10.1137\/090757010","volume":"39","author":"P Dutta","year":"2010","unstructured":"Dutta, P., Guerraoui, R., Levy, R., Vukolic, M.: Fast access to distributed atomic memory. SIAM Journal of Computing 39(8), 3752\u20133783 (2010)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"3_CR33","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 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00446-015-0261-8","volume":"29","author":"F Ellen","year":"2016","unstructured":"Ellen, F., Fatourou, P., Kosmas, E., Milani, A., Travers, C.: Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distrib. Comput. 29, 251\u2013277 (2016)","journal-title":"Distrib. Comput."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Ellen, F., Gelashvili, G., Shavit, N., Zhu, L.: A complexity-based hierarchy for multiprocessor synchronization. In: Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), pp.\u00a0289\u2013298. ACM Press (2016)","DOI":"10.1145\/2933057.2933113"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00224-013-9491-y","volume":"55","author":"P Fatourou","year":"2014","unstructured":"Fatourou, P., Kallimanis, N.D.: Highly-efficient wait-free synchronization. Theory Comput. Syst. 55, 475\u2013520 (2014)","journal-title":"Theory Comput. Syst."},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to ensure interactive consistency. Inf. Process. Lett. 14, 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR38","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":"3_CR39","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R.: Generalizing universality. In: Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR 2011), LNCS, vol. 6901, pp.\u00a017\u201327. Springer (2011)","DOI":"10.1007\/978-3-642-23217-6_2"},{"key":"3_CR40","unstructured":"Garg, V.K.: Elements of Distributed Computing, 423p. Wiley-Interscience (2002)"},{"key":"3_CR41","unstructured":"Guerraoui, G., Komatovic, J., Kuznetsov, P., Pignolet, P.A., Seredinschi, D.-A., Tonkikh, A.: Dynamic Byzantine reliable broadcast. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020), Lipics, vol.\u00a0184, Article 23, 18 pages (2020)"},{"key":"3_CR42","unstructured":"Guerraoui, G., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.-A.: Scalable Byzantine reliable broadcast. In: Proceedings of the 33rd International Symposium on Distributed Computing (DISC 2019), LIPIcs, vol.\u00a0146, Article 22, 16 pages (2019)"},{"issue":"1","key":"3_CR43","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"MP Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR44","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings of the 23th International IEEE Conference on Distributed Computing Systems (ICDCS 2003), pp.\u00a0522\u2013529. IEEE Press (2003)"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2013.03.002","volume":"509","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M.: Power and limits of distributed computing shared memory models. Theoret. Comput. Sci. 509, 3\u201324 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.04.007","volume":"683","author":"M Herlihy","year":"2017","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theoret. Comput. Sci. 683, 1\u201321 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR47","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, 508p. Morgan Kaufmann (2008). ISBN 978-0-12-370591-4"},{"issue":"3","key":"3_CR48","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Imbs, S., Rajsbaum, S., Raynal, M., Stainer, J.: Read\/Write shared memory abstraction on top of an asynchronous Byzantine message-passing system. J. Parallel Distrib. Comput. 93\u201394, 1\u20139 (2016)","DOI":"10.1016\/j.jpdc.2016.03.012"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M.: The multiplicative power of consensus numbers. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC 2010), pp.\u00a026\u201335. ACM Press (2010)","DOI":"10.1145\/1835698.1835705"},{"key":"3_CR51","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1002\/cpe.1741","volume":"23","author":"D Imbs","year":"2011","unstructured":"Imbs, D., Raynal, M.: A liveness condition for concurrent objects: $$x$$-wait-freedom. Concurr. Comput.: Pract. Exp. 23, 2154\u20132166 (2011)","journal-title":"Concurr. Comput.: Pract. Exp."},{"issue":"1","key":"3_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2011.08.005","volume":"72","author":"D Imbs","year":"2012","unstructured":"Imbs, D., Raynal, M.: Help when needed, but no more: efficient read\/write partial snapshot. J. Parall. Distrib. Comput. 72(1), 1\u201313 (2012)","journal-title":"J. Parall. Distrib. Comput."},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M.: Trading $$t$$-resilience for efficiency in asynchronous Byzantine reliable broadcast. Parall. Process. Lett. 26(4), 8 (2016)","DOI":"10.1142\/S0129626416500171"},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M., Taubenfeld, G.: On asymmetric progress conditions. Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC 2010), pp.\u00a055\u201364. ACM Press (2010)","DOI":"10.1145\/1835698.1835709"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms and Systems, 736p. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511805318"},{"issue":"7","key":"3_CR56","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"3_CR57","unstructured":"Lamport, L., Message-Id: $$<$$8705281923.AA09105@jumbo.dec.com$$>$$, Thu, 28 May 1987 12:23:29"},{"key":"3_CR58","unstructured":"Lamport, L.: Specifying Systems, 364p. Addison-Wesley, Pearson Education (2003)"},{"issue":"1","key":"3_CR59","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1515698.1515713","volume":"40","author":"L Lamport","year":"2009","unstructured":"Lamport, L.: Teaching concurrency. ACM Sigact NEWS 40(1), 58\u201362 (2009)","journal-title":"Teaching concurrency. ACM Sigact NEWS"},{"key":"3_CR60","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","DOI":"10.1145\/357172.357176"},{"key":"3_CR61","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987). JAI Press"},{"key":"3_CR62","unstructured":"Lynch, N.A.: Distributed Algorithms, 872p. Morgan Kaufmann Publication, San Francisco (1996). ISBN 1-55860-384-4"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary Byzantine consensus with $$t<n\/3$$, $$O(n^2)$$ messages, and $$O(1)$$ expected time. J. ACM 62(4), 31 (2015). 21 pages","DOI":"10.1145\/2785953"},{"key":"3_CR64","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: Proceedings of the International IEEE Conference on Dependable Systems and Networks (DSN 2003), pp.\u00a0351\u2013360. IEEE Computer Society Press (2003)","DOI":"10.1109\/DSN.2003.1209946"},{"key":"3_CR65","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Perrin, M., Raynal, M.: A simple object that spans the whole consensus hierarchy. Parall. Process. Lett. 28(2), 1850006:1\u20131850006:9 (2018)","DOI":"10.1142\/S0129626418500068"},{"key":"3_CR66","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Petrolia, M., Raynal, M., Jard, C.: Atomic read\/write memory in signature-free Byzantine asynchronous message-passing systems. Theory Comput. Syst. 60(4), 677\u2013694 (2017). Springer","DOI":"10.1007\/s00224-016-9699-8"},{"issue":"6","key":"3_CR67","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1145\/950620.950624","volume":"50","author":"A Most\u00e9faoui","year":"2003","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM 50(6), 922\u2013954 (2003)","journal-title":"J. ACM"},{"issue":"4","key":"3_CR68","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1109\/TPDS.2015.2427797","volume":"27","author":"A Most\u00e9faoui","year":"2016","unstructured":"Most\u00e9faoui, A., Raynal, M.: Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine processes. IEEE Trans. Parallel Distrib. Syst. 27(4), 1085\u20131098 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: Two-bit messages are sufficient to implement atomic read\/write registers in crash-prone systems. In: Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), pp.\u00a0381\u2013390. ACM Press (2016)","DOI":"10.1145\/2933057.2933095"},{"key":"3_CR70","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00236-016-0269-y","volume":"54","author":"A Most\u00e9faoui","year":"2017","unstructured":"Most\u00e9faoui, A., Raynal, M.: Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t < n\/3$$, $$O(n^2)$$ messages, and constant time. Acta Informatica 54, 501\u2013520 (2017)","journal-title":"Acta Informatica"},{"key":"3_CR71","first-page":"3","volume":"101","author":"A Most\u00e9faoui","year":"2018","unstructured":"Most\u00e9faoui, A., Raynal, M., Roy, M.: Time-efficient read\/write register in crash-prone asynchronous message-passing systems. Springer Comput. 101, 3\u201317 (2018)","journal-title":"Springer Comput."},{"key":"3_CR72","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for Byzantine broadcast and agreement. In: Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020), LIPIcs, vol.\u00a0179, 16p, Article 28 (2020)"},{"key":"3_CR73","doi-asserted-by":"crossref","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","DOI":"10.1145\/322186.322188"},{"key":"3_CR74","doi-asserted-by":"crossref","unstructured":"Perrin, M., Most\u00e9faoui, A., Bonin, G.: Extending the wait-free hierarchy to multi-threaded systems. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC 2020), pp.\u00a021\u201330. ACM Press (2020)","DOI":"10.1145\/3382734.3405723"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Randomized Byzantine generals. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pp. 116\u2013124. IEEE Computer Society Press (1983)","DOI":"10.1109\/SFCS.1983.48"},{"issue":"1","key":"3_CR76","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/3363823","volume":"63","author":"S Rajsbaum","year":"2020","unstructured":"Rajsbaum, S., Raynal, M.: Mastering concurrent computing through sequential thinking: a half-century evolution. Commun. ACM 63(1), 78\u201387 (2020)","journal-title":"Commun. ACM"},{"key":"3_CR77","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, 515p. Springer (2013). ISBN 978-3-642-32026-2"},{"key":"3_CR78","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Distributed Algorithms for Message-Passing Systems, 515p. Springer (2013). ISBN: 978-3-642-38122-5","DOI":"10.1007\/978-3-642-38123-2_1"},{"key":"3_CR79","first-page":"65","volume":"121","author":"M Raynal","year":"2017","unstructured":"Raynal, M.: Distributed universal constructions: a guided tour. Electron. Bullet. EATCS (Eur. Assoc. Theor. Comput. Sci.) 121, 65\u201396 (2017)","journal-title":"Electron. Bullet. EATCS (Eur. Assoc. Theor. Comput. Sci.)"},{"key":"3_CR80","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach, 550p. Springer (2018). ISBN: 978-3-319-94140-0","DOI":"10.1007\/978-3-319-94141-7_1"},{"key":"3_CR81","doi-asserted-by":"crossref","unstructured":"Raynal, M.: The notion of universality in crash-prone asynchronous message-passing systems: a tutorial. In: Proceedings of the 38th International Symposium on Reliable Distributed Systems (SRDS 2019), 17p. IEEE Press (2019)","DOI":"10.1109\/SRDS47363.2019.00046"},{"key":"3_CR82","first-page":"168","volume":"129","author":"M Raynal","year":"2019","unstructured":"Raynal, M.: An Informal visit to the wonderful land of consensus numbers and beyond. Bullet. Eur. Assoc. Theor. Comput. Sci. 129, 168\u2013192 (2019)","journal-title":"Bullet. Eur. Assoc. Theor. Comput. Sci."},{"key":"3_CR83","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions, 139p. Morgan & Claypool Publishers (2022). https:\/\/doi.org\/10.2200\/S01165ED1V01Y202202DCT018. ISBN 9781636393315","DOI":"10.2200\/S01165ED1V01Y202202DCT018"},{"key":"3_CR84","unstructured":"Raynal, M.: About informatics, distributed computing and our job: a personal view. (Invited Talk). In: Proceedings of the 30th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2023), LNCS, vol. 13892, pp. 44\u201356. Springer (2023)"},{"key":"3_CR85","doi-asserted-by":"crossref","unstructured":"Raynal, M.: On distributed computing: a view, from physical objects to logical objects, and a look at fully anonymous. Keynote Talk. In: Proceedings of the 26th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2024), LNCS. Springer (2024)","DOI":"10.1007\/978-3-031-74498-3_1"},{"key":"3_CR86","doi-asserted-by":"crossref","unstructured":"Raynal, M., Stainer, J.: Round-based synchrony weakened by message adversaries vs asynchrony enriched with failure detectors. In: 32th ACM Symposium on Principles of Distributed Computing (PODC 2013), pp.\u00a0166\u2013175. ACM Press (2013)","DOI":"10.1145\/2484239.2484249"},{"issue":"2","key":"3_CR87","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s00453-015-0053-3","volume":"76","author":"M Raynal","year":"2016","unstructured":"Raynal, M., Stainer, J., Taubenfeld, G.: Distributed universality. Algorithmica 76(2), 502\u2013535 (2016)","journal-title":"Algorithmica"},{"key":"3_CR88","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms, 589p. Wiley-Interscience (2007). ISBN 0-471-71997-8"},{"issue":"1","key":"3_CR89","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"VG Santos","year":"2013","unstructured":"Santos, V.G., Correia, M., Bessani, A., Lung, C.L., Ver\u00edssimo, P.: Efficient Byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"3_CR90","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."},{"key":"3_CR91","unstructured":"Schneider, F.B.: What good are models, and what models are good? In: Distributed Systems, 2nd edn, pp.\u00a017\u201326. Adddison-Wesley\/ACM Press (1993)"},{"key":"3_CR92","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Pregui\u00e7a, N.M., Baquero, C., Zawirski, M.: Conflict-free replicated data YYPES. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), LNCS, vol. 6976, pp.\u00a0386\u2013400. Springer (2011)","DOI":"10.1007\/978-3-642-24550-3_29"},{"key":"3_CR93","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, 423p. Pearson Education\/Prentice Hall (2006). ISBN 0-131-97259-6"},{"issue":"2","key":"3_CR94","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00446-019-00356-0","volume":"33","author":"G Taubenfeld","year":"2020","unstructured":"Taubenfeld, G.: The computational structure of progress conditions and shared objects. Distrib. Comput. 33(2), 103\u2013123 (2020)","journal-title":"Distrib. Comput."},{"key":"3_CR95","doi-asserted-by":"crossref","unstructured":"Toueg, S.: Randomized Byzantine agreement. Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC 1984), pp.\u00a0163\u2013178. ACM Press (1984)","DOI":"10.1145\/800222.806744"},{"key":"3_CR96","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"key":"3_CR97","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Inf. Process. Lett. 18, 73\u201376 (1984)","journal-title":"Inf. Process. Lett."},{"key":"3_CR98","unstructured":"Parallel Computing. https:\/\/en.wikipedia.org\/wiki\/Parallel_computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81404-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T01:02:41Z","timestamp":1735606961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81404-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"ISBN":["9783031814037","9783031814044"],"references-count":98,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81404-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"31 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}