{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T22:40:22Z","timestamp":1760049622088,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1016\/j.jpdc.2006.06.002","type":"journal-article","created":{"date-parts":[[2006,7,19]],"date-time":"2006-07-19T10:30:22Z","timestamp":1153305022000},"page":"125-129","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["From <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo>\u22c4<\/mml:mo><mml:mi mathvariant=\"script\">W<\/mml:mi><\/mml:math> to <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">\u03a9<\/mml:mi><\/mml:math>: A simple bounded quiescent reliable broadcast-based transformation"],"prefix":"10.1016","volume":"67","author":[{"given":"Achour","family":"Mostefaoui","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jpdc.2006.06.002_bib1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of network synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.jpdc.2006.06.002_bib2","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","article-title":"The weakest failure detector for solving consensus","volume":"43","author":"Chandra","year":"1996","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.jpdc.2006.06.002_bib3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","article-title":"Unreliable failure detectors for reliable distributed systems","volume":"43","author":"Chandra","year":"1996","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.jpdc.2006.06.002_bib4","first-page":"293","article-title":"Reducing \u03a9 to \u22c4W","volume":"76","author":"Chu","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.jpdc.2006.06.002_bib5","doi-asserted-by":"crossref","unstructured":"C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov, S. Toueg, The weakest failure detectors to solve certain fundamental problems in distributed computing, Proceedings of the 23th ACM Symposium on Principles of Distributed Computing (PODC\u201904), 2004, pp. 338\u2013346.","DOI":"10.1145\/1011767.1011818"},{"issue":"2","key":"10.1016\/j.jpdc.2006.06.002_bib6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/j.jpdc.2006.06.002_bib7","series-title":"Distributed Systems","first-page":"97","article-title":"Reliable broadcast and related problems","author":"Hadzilacos","year":"1993"},{"key":"10.1016\/j.jpdc.2006.06.002_bib8","unstructured":"A. Most\u00e9faoui, S. Rajsbaum, M. Raynal, C. Travers, From \u22c4W to \u03a9: a simple bounded quiescent reliable broadcast-based transformation, Technical Report #1759, IRISA, Universit\u00e9 de Rennes 1 (France), 2005, \u3008ftp:\/\/ftp.irisa.fr\/techreports\/2005\/PI-1759.pdf\u3009."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731506001274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731506001274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:58:13Z","timestamp":1760047093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731506001274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["S0743731506001274"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2006.06.002","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2007,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"From  to : A simple bounded quiescent reliable broadcast-based transformation","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2006.06.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2006 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}