{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:47:55Z","timestamp":1725853675803},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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-1-4939-2864-4_611","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:09:45Z","timestamp":1553098185000},"page":"199-203","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BG Distributed Simulation Algorithm"],"prefix":"10.1007","author":[{"given":"Matthieu","family":"Roy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"4","key":"781_CR2109","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 (1993) Atomic snapshots of shared memory. J ACM 40(4):873\u2013890","journal-title":"J ACM"},{"key":"781_CR2110","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/11780823_2","volume-title":"Proceedings of the 13th international conference on structural information and communication complexity, SIROCCO\u201906","author":"H Attiya","year":"2006","unstructured":"Attiya H (2006) Adapting to point contention with long-lived safe agreement. In: Proceedings of the 13th international conference on structural information and communication complexity, SIROCCO\u201906, Chester. Springer, Berlin\/Heidelberg, pp\u00a010\u201323"},{"key":"781_CR2111","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/167088.167119","volume-title":"STOC \u201993: proceedings of the twenty-fifth annual ACM symposium on theory of computing","author":"E Borowsky","year":"1993","unstructured":"Borowsky E, Gafni E (1993) Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC \u201993: proceedings of the twenty-fifth annual ACM symposium on theory of computing, San Diego. ACM, New York, pp\u00a091\u2013100"},{"issue":"3","key":"781_CR2112","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky E, Gafni E, Lynch N, Rajsbaum S (2001) The BG distributed simulation algorithm. Distrib Comput 14(3):127\u2013146","journal-title":"Distrib Comput"},{"key":"781_CR2113","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/197917.198121","volume-title":"PODC \u201994: proceedings of the thirteenth annual ACM symposium on principles of distributed computing","author":"T Chandra","year":"1994","unstructured":"Chandra T, Hadzilacos V, Jayanti P, Toueg S (1994) Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract). In: PODC \u201994: proceedings of the thirteenth annual ACM symposium on principles of distributed computing, Los Angeles. ACM, New York, pp\u00a0334\u2013343"},{"issue":"1","key":"781_CR2114","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri S (1993) More choices allow more faults: set consensus problems in totally asynchronous systems. Inf Comput 105(1):132\u2013158","journal-title":"Inf Comput"},{"key":"781_CR2115","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-61769-8_23","volume-title":"Proceedings of the 10th international workshop on distributed algorithms","author":"S Chaudhuri","year":"1996","unstructured":"Chaudhuri S, Reiners P (1996) Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract). In: Proceedings of the 10th international workshop on distributed algorithms, Bologna. Springer, London, pp\u00a0362\u2013379"},{"key":"781_CR2116","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1536414.1536428","volume-title":"Proceedings of the 41st annual ACM symposium on theory of computing, STOC \u201909","author":"E Gafni","year":"2009","unstructured":"Gafni E (2009) The extended BG-simulation and the characterization of t-resiliency. In: Proceedings of the 41st annual ACM symposium on theory of computing, STOC \u201909, Bethesda. ACM, New York, pp\u00a085\u201392"},{"issue":"3\u20134","key":"781_CR2117","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00446-011-0142-8","volume":"23","author":"E Gafni","year":"2011","unstructured":"Gafni E, Kuznetsov P (2011) On set consensus numbers. Distrib Comput 23(3\u20134):149\u2013163","journal-title":"Distrib Comput"},{"issue":"1","key":"781_CR2118","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy M (1991) Wait-free synchronization. ACM Trans Program Lang Syst 13(1):124\u2013149","journal-title":"ACM Trans Program Lang Syst"},{"key":"781_CR2119","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy M, Kozlov D, Rajsbaum S (2013) Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Amsterdam"},{"key":"781_CR2120","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/258533.258652","volume-title":"Proceedings of the twenty-ninth annual ACM symposium on theory of computing, STOC \u201997","author":"M Herlihy","year":"1997","unstructured":"Herlihy M, Rajsbaum S (1997) The decidability of distributed decision tasks (extended abstract). In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, STOC \u201997, El Paso. ACM, New York, pp\u00a0589\u2013598"},{"issue":"6","key":"781_CR2121","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy M, Shavit N (1999) The topological structure of asynchronous computability. J ACM 46(6):858\u2013923","journal-title":"J ACM"},{"key":"781_CR2122","first-page":"369","volume-title":"Visiting gafni\u2019s reduction land: from the BG simulation to the extended BG simulation","author":"D Imbs","year":"2009","unstructured":"Imbs D, Raynal M (2009) Visiting gafni\u2019s reduction land: from the BG simulation to the extended BG simulation. In: SSS, pp\u00a0369\u2013383"},{"key":"781_CR2123","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1835698.1835705","volume-title":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC \u201910","author":"D Imbs","year":"2010","unstructured":"Imbs D, Raynal M (2010) The multiplicative power of consensus numbers. In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC \u201910, Zurich. ACM, New York, pp\u00a026\u201335"},{"key":"781_CR2124","first-page":"17","volume-title":"Universal model simulation: BG and extended BG as examples","author":"P Kuznetsov","year":"2013","unstructured":"Kuznetsov P (2013) Universal model simulation: BG and extended BG as examples. In: SSS, pp\u00a017\u201331"},{"key":"781_CR2125","volume-title":"Distributed algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"781_CR2126","first-page":"4","volume-title":"Proceedings of the fourth Israel symposium on theory of computing and systems, ISTCS \u201996","author":"N Lynch","year":"1996","unstructured":"Lynch N, Rajsbaum S (1996) On the Borowsky-Gafni simulation algorithm. In: Proceedings of the fourth Israel symposium on theory of computing and systems, ISTCS \u201996, Jerusalem. IEEE Computer Society, pp\u00a04\u201315"},{"issue":"5","key":"781_CR2127","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M Saks","year":"2000","unstructured":"Saks M, Zaharoglou F (2000) Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J Comput 29(5):1449\u20131483","journal-title":"SIAM J Comput"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:49:38Z","timestamp":1553100578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_611","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}