{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T18:40:05Z","timestamp":1739126405738,"version":"3.37.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s11390-009-9234-3","type":"journal-article","created":{"date-parts":[[2009,5,25]],"date-time":"2009-05-25T18:47:31Z","timestamp":1243277251000},"page":"418-433","source":"Crossref","is-referenced-by-count":2,"title":["Conditions for Set Agreement with an Application to Synchronous Systems"],"prefix":"10.1007","volume":"24","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,26]]},"reference":[{"issue":"2","key":"9234_CR1","doi-asserted-by":"crossref","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. Journal of the ACM, 1985, 32(2): 374\u2013382.","journal-title":"Journal of the ACM"},{"key":"9234_CR2","unstructured":"Loui M C, Abu-Amara H H. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Parallel and Distributed Computing: Vol.4 of Advances in Computing Research, JAI Press, 1987, 4: 163\u2013183."},{"issue":"6","key":"9234_CR3","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1145\/950620.950624","volume":"50","author":"A Mostefaoui","year":"2003","unstructured":"Mostefaoui A, Rajsbaum S, Raynal M. Conditions on input vectors for consensus solvability in asynchronous distributed systems. Journal of the ACM, 2003, 50(6): 922\u2013954.","journal-title":"Journal of the ACM"},{"issue":"7","key":"9234_CR4","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/TC.2007.1043","volume":"56","author":"R Friedman","year":"2007","unstructured":"Friedman R, Most\u00e9faoui A, S Rajsbaum S, Raynal M. Asynchronous agreement and its relation with error-correcting codes. IEEE Trans. Computers, 2007, 56(7): 865\u2013876.","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"9234_CR5","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/TC.2006.99","volume":"55","author":"T Izumi","year":"2006","unstructured":"Izumi T, Masuzawa T. Condition adaptation in synchronous consensus. IEEE Trans. Computers, 2006, 55(7): 843\u2013853.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"9234_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ipl.2006.07.003","volume":"100","author":"T Izumi","year":"2006","unstructured":"Izumi T, Masuzawa T. A weakly adaptive condition-based consensus algorithm in asynchronous distributed systems. Information Processing Letters, 2006, 100(5): 199\u2013205.","journal-title":"Information Processing Letters"},{"issue":"5","key":"9234_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00446-005-0148-1","volume":"18","author":"A Mostefaoui","year":"2006","unstructured":"Mostefaoui A, Rajsbaum S, Raynal M. Synchronous condition-based consensus. Distributed Computing, 2006, 18(5): 325\u2013343.","journal-title":"Distributed Computing"},{"key":"9234_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-003-0093-9","volume":"17","author":"A Mostefaoui","year":"2004","unstructured":"Mostefaoui A, Rajsbaum S, Raynal M, Roy M. Condition-based consensus solvability: A hierarchy of conditions and efficient protocols. Distributed Computing, 2004, 17: 1\u201320.","journal-title":"Distributed Computing"},{"key":"9234_CR9","doi-asserted-by":"crossref","unstructured":"Zibin Y. Condition-based consensus in synchronous systems. In Proc. the 17th Int. Symposium on Distributed Computing, LNCS 2848, Springer-Verlag, Sorrento, Italy, Oct. 1\u20133, 2003, pp.239\u2013248.","DOI":"10.1007\/978-3-540-39989-6_17"},{"key":"9234_CR10","doi-asserted-by":"crossref","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 bivalency proof that t-resilient consensus requires t + 1 rounds. Information Processing Letters, 1999, 71: 155\u2013178.","journal-title":"Information Processing Letters"},{"key":"9234_CR11","first-page":"183","volume":"71","author":"MJ Fischer","year":"1982","unstructured":"Fischer M J, Lynch N. A lower bound for the time to assure interactive consistency. Information Processing Letters, 1982, 71: 183\u2013186.","journal-title":"A lower bound for the time to assure interactive consistency. Information Processing Letters"},{"key":"9234_CR12","doi-asserted-by":"crossref","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, 1993, 105: 132\u2013158.","journal-title":"Information and Computation"},{"key":"9234_CR13","doi-asserted-by":"crossref","unstructured":"Borowsky E, Gafni E. Generalized FLP impossibility results for t-resilient asynchronous computations. In Proc. the 25 th ACM Symposium on the Theory of Computing (STOC'93), San Diego, USA, ACM Press, June 7\u201314, 1993, pp.91\u2013100.","DOI":"10.1145\/167088.167119"},{"issue":"6","key":"9234_CR14","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"MP Herlihy","year":"1999","unstructured":"Herlihy M P, Shavit N. The topological structure of asynchronous computability. Journal of the ACM, 1999, 46(6): 858\u2013923.","journal-title":"Journal of the ACM"},{"issue":"5","key":"9234_CR15","doi-asserted-by":"crossref","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, 2000, 29(5): 1449\u20131483.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"9234_CR16","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri S, Herlihy M, Lynch N, Tuttle M. Tight bounds for k-set agreement. Journal of the ACM, 2000, 47(5): 912\u2013943.","journal-title":"Journal of the ACM"},{"key":"9234_CR17","doi-asserted-by":"crossref","unstructured":"Attiya H, Avidor Z. Wait-free n-set consensus when inputs are restricted. In Proc. the 16th Int. Symposium on Distributed Computing (DISC'02), Toulouse, France, LNCS 2508, Springer Verlag, Oct. 28\u201330, 2002, pp.326\u2013338.","DOI":"10.1007\/3-540-36108-1_22"},{"key":"9234_CR18","doi-asserted-by":"crossref","unstructured":"Mostefaoui A, Rajsbaum S, Raynal M, Roy M. Condition-based protocols for set agreement problems. In Proc. the 16th Int. Symposium on Distributed Computing (DISC'02), Toulouse, France, LNCS 2508, Springer Verlag, Oct. 28\u201330, 2002, pp.46\u201362.","DOI":"10.1007\/3-540-36108-1_4"},{"key":"9234_CR19","doi-asserted-by":"crossref","unstructured":"Mostefaoui A, Rajsbaum S, Raynal M. The combined power of conditions and failure detectors to solve asynchronous set agreement. In Proc. the 24th ACM Symposium on Principles of Distributed Computing (PODC'05), Las Vegas, USA, ACM Press, July 17\u201320, 2005, pp.179\u2013188.","DOI":"10.1145\/1073814.1073848"},{"key":"9234_CR20","unstructured":"Attiya H, Welch J. Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 1998, p.451."},{"key":"9234_CR21","unstructured":"Lynch N A. Distributed Algorithms. San Fransisco: Morgan Kaufmann Pub., USA, 1996, 872 pages."},{"key":"9234_CR22","doi-asserted-by":"crossref","unstructured":"Raynal M. Consensus in synchronous systems: A concise guided tour. In Proc. the 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC'02), Tsukuba, Japan, IEEE Computer Press, Dec. 16\u201318, 2002, pp.221\u2013228.","DOI":"10.1109\/PRDC.2002.1185641"},{"issue":"4","key":"9234_CR23","doi-asserted-by":"crossref","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. Journal of the ACM, 1993, 40(4): 873\u2013890.","journal-title":"Journal of the ACM"},{"issue":"4","key":"9234_CR24","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"Dolev D, Reischuk R, Strong R. Early stopping in Byzantine agreement. Journal of the ACM, April 1990, 37(4): 720\u2013741.","journal-title":"Journal of the ACM"},{"key":"9234_CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I Keidar","year":"2003","unstructured":"Keidar I, Rajsbaum S. A simple proof of the uniform consensus synchronous lower bound. Information Processing Letters, 2003, 85: 47\u201352.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9234_CR26","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y Moses","year":"2002","unstructured":"Moses Y, Rajsbaum S. A layered analysis of consensus. SIAM Journal of Computing, 2002, 31(4): 989\u20131021.","journal-title":"SIAM Journal of Computing"},{"key":"9234_CR27","doi-asserted-by":"crossref","unstructured":"Gafni E, Guerraoui R, Pochon B. From a static impossibility to an adaptive lower bound: The complexity of early deciding set agreement. In Proc. the 37th ACM Symposium on Theory of Computing (STOC'05), Baltimore, USA, May 22\u201324, 2005, pp.714\u2013722.","DOI":"10.1145\/1060590.1060696"},{"key":"9234_CR28","doi-asserted-by":"crossref","unstructured":"Ra\u00efpin Parv\u00e9dy Ph, Raynal M, Travers C. Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures. In Proc. the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), Chester, UK, LNCS 4056, Springer-Verlag, July 3\u20135, 2006, pp.182\u2013196.","DOI":"10.1007\/11780823_15"},{"key":"9234_CR29","doi-asserted-by":"crossref","unstructured":"Raynal M, Travers C. Synchronous set agreement: A concise guided tour (including a new algorithm and a list of open problems). In Proc. the 12th Int. IEEE Pacific Rim Dependable Computing Symposium (PRDC'2006), IEEE Society Computer Press, Riverside, USA, Dec. 18\u201320, 2006, pp.267\u2013274.","DOI":"10.1109\/PRDC.2006.59"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9234-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-009-9234-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9234-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T18:01:10Z","timestamp":1739124070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-009-9234-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9234"],"URL":"https:\/\/doi.org\/10.1007\/s11390-009-9234-3","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}