{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:27:07Z","timestamp":1673166427098},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00446-012-0158-8","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T23:25:42Z","timestamp":1329261942000},"page":"249-260","source":"Crossref","is-referenced-by-count":7,"title":["Partial synchrony based on set timeliness"],"prefix":"10.1007","volume":"25","author":[{"given":"Marcos K.","family":"Aguilera","sequence":"first","affiliation":[]},{"given":"Carole","family":"Delporte-Gallet","sequence":"additional","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"key":"158_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: ACM Symposium on Principles of Distributed Computing, pp. 328\u2013337, July 2004","DOI":"10.1145\/1011767.1011816"},{"issue":"4","key":"158_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00446-008-0068-y","volume":"21","author":"M.K. Aguilera","year":"2008","unstructured":"Aguilera M.K., Delporte-Gallet C., Fauconnier H., Toueg S.: On implementing Omega in systems with weak reliability and synchrony assumptions. Distrib. Comput. 21(4), 285\u2013314 (2008)","journal-title":"Distrib. Comput."},{"key":"158_CR3","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Partial synchrony based on set timeliness. In: ACM Symposium on Principles of Distributed Computing, pp. 102\u2013110, August 2009","DOI":"10.1145\/1582716.1582737"},{"issue":"5\u20136","key":"158_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00446-010-0106-4","volume":"22","author":"M.K. Aguilera","year":"2010","unstructured":"Aguilera M.K., Toueg S.: Adaptive progress: a gracefully-degrading liveness property. Distrib. Comput. 22(5\u20136), 303\u2013334 (2010)","journal-title":"Distrib. Comput."},{"key":"158_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: ACM Symposium on Theory of Computing, pp. 91\u2013100, May 1993","DOI":"10.1145\/167088.167119"},{"key":"158_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: ACM Symposium on Principles of Distributed Computing, pp. 189\u2013198, August 1997","DOI":"10.1145\/259380.259439"},{"issue":"3","key":"158_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky E., Gafni E., Lynch N.A., Rajsbaum S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"4","key":"158_CR8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. 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":"158_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. 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":"158_CR10","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. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"158_CR11","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Rajsbaum, S., Raynal, M., Travers, C.: Brief announcement: failure detectors are schedulers. In: ACM Symposium on Principles of Distributed Computing, pp. 308\u2013309, August 2007","DOI":"10.1145\/1281100.1281146"},{"issue":"2","key":"158_CR12","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N.A., Stockmeyer L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"issue":"9","key":"158_CR13","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.1109\/TPDS.2009.163","volume":"21","author":"A. Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez A., Raynal M.: From an asynchronous intermittent rotating star to an eventual leader. IEEE Trans. Parallel Distrib. Syst. 21(9), 1290\u20131303 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3\u20134","key":"158_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00446-011-0142-8","volume":"24","author":"E. Gafni","year":"2011","unstructured":"Gafni E., Kuznetsov P.: On set consensus numbers. Distrib. Comput. 24(3\u20134), 149\u2013163 (2011)","journal-title":"Distrib. Comput."},{"issue":"6","key":"158_CR15","doi-asserted-by":"crossref","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(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"4","key":"158_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TDSC.2008.24","volume":"6","author":"M. Hutle","year":"2009","unstructured":"Hutle M., Malkhi D., Schmid U., Zhou L.: Chasing the weakest system model for implementing \u03a9 and consensus. IEEE Trans. Dependable Secur. Comput. 6(4), 269\u2013281 (2009)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"2","key":"158_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E. Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez E., Ar\u00e9valo S., Fern\u00e1ndez A.: Implementing unreliable failure detectors with unknown membership. Inf. Process. Lett. 100(2), 60\u201363 (2006)","journal-title":"Inf. Process. Lett."},{"key":"158_CR18","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: Omega meets Paxos: leader election and stability without eventual timely links. In: International Conference on Distributed Computing. LNCS, vol. 3724, pp. 199\u2013213. Springer, September 2005","DOI":"10.1007\/11561927_16"},{"key":"158_CR19","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: k-set agreement with limited accuracy failure detectors. In: ACM Symposium on Principles of Distributed Computing, pp. 143\u2013152, July 2000","DOI":"10.1145\/343477.343536"},{"issue":"7","key":"158_CR20","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TPDS.2006.95","volume":"17","author":"A. Mostefaoui","year":"2006","unstructured":"Mostefaoui A., Raynal M., Travers C.: Time-free and timer-based assumptions can be combined to obtain eventual leadership. IEEE Trans. Parallel Distrib. Syst. 17(7), 656\u2013666 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"158_CR21","doi-asserted-by":"crossref","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy. In: ACM Symposium on Principles of Distributed Computing, pp. 100\u2013109, August 1995","DOI":"10.1145\/224964.224976"},{"key":"158_CR22","doi-asserted-by":"crossref","unstructured":"Pike, S.M., Sastry, S., Welch, J.L.: Failure detectors encapsulate fairness. In: International Conference on Principles of Distributed Systems. LNCS, vol. 6490, pp. 173\u2013188. Springer, December 2010","DOI":"10.1007\/978-3-642-17653-1_15"},{"key":"158_CR23","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: Failure detectors as schedulers (an algorithmically-reasoned characterization). Technical Report 1838, IRISA, Universit\u00e9 de Rennes, France, March 2007"},{"key":"158_CR24","doi-asserted-by":"crossref","unstructured":"Rajsbaum S., Raynal M., Travers C.: The iterated restricted immediate snapshot model. In: International Computing and Combinatorics Conference. LNCS, vol. 5092, pp. 487\u2013497. Springer, June 2008","DOI":"10.1007\/978-3-540-69733-6_48"},{"issue":"5","key":"158_CR25","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M.E. Saks","year":"2000","unstructured":"Saks M.E., Zaharoglou F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5\u20136","key":"158_CR26","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00446-010-0101-9","volume":"22","author":"P. Zielinski","year":"2010","unstructured":"Zielinski P.: Anti-\u03a9: the weakest failure detector for set agreement. Distrib. Comput. 22(5\u20136), 335\u2013348 (2010)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0158-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0158-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0158-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T14:35:11Z","timestamp":1561300511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0158-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["158"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0158-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,16]]}}}