{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:58Z","timestamp":1759709098435,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,7,12]],"date-time":"2001-07-12T00:00:00Z","timestamp":994896000000},"content-version":"vor","delay-in-days":772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(98)00235-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"3-30","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":66,"title":["Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks"],"prefix":"10.1016","volume":"220","author":[{"given":"Marcos Kawazoe","family":"Aguilera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00235-7_BIB1_1","series-title":"Proc. 11th Internat. Workshop on Distributed Algorithms","first-page":"126","article-title":"Heartbeat: a timeout-free failure detector for quiescent reliable communication","author":"Aguilera","year":"1997"},{"year":"1997","author":"Aguilera","key":"10.1016\/S0304-3975(98)00235-7_BIB1_2"},{"article-title":"On the weakest failure detector for quiescent reliable communication","year":"1997","author":"Aguilera","key":"10.1016\/S0304-3975(98)00235-7_BIB2"},{"article-title":"Partitionable group membership: specification and algorithms","year":"1997","author":"Babao\u011flu","key":"10.1016\/S0304-3975(98)00235-7_BIB3"},{"key":"10.1016\/S0304-3975(98)00235-7_BIB4","series-title":"Proc. 10th Internat. Workshop on Distributed Algorithms","first-page":"105","article-title":"Simulating reliable links with unreliable links in the presence of process crashes","author":"Basu","year":"1996"},{"key":"10.1016\/S0304-3975(98)00235-7_BIB5","series-title":"Proc. 6th Internat. Workshop on Distributed Algorithms","first-page":"166","article-title":"Simulating crash failures with many faulty processors","author":"Bazzi","year":"1992"},{"key":"10.1016\/S0304-3975(98)00235-7_BIB6","unstructured":"T.D. Chandra, Private communication, April 1997."},{"key":"10.1016\/S0304-3975(98)00235-7_BIB7","unstructured":"T.D. Chandra, V. Hadzilacos, S. Toueg, Private communication to Friedman et al. [12], March 1996."},{"issue":"2","key":"10.1016\/S0304-3975(98)00235-7_BIB8","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":"4","key":"10.1016\/S0304-3975(98)00235-7_BIB9","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"},{"article-title":"Failure detectors in omission failure environments","year":"1996","author":"Dolev","key":"10.1016\/S0304-3975(98)00235-7_BIB10"},{"issue":"2","key":"10.1016\/S0304-3975(98)00235-7_BIB11","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"},{"article-title":"Deciding in partitionable networks","year":"1995","author":"Friedman","key":"10.1016\/S0304-3975(98)00235-7_BIB12"},{"article-title":"Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination","year":"1992","author":"Gopal","key":"10.1016\/S0304-3975(98)00235-7_BIB13"},{"key":"10.1016\/S0304-3975(98)00235-7_BIB14","series-title":"Proc. 10th Internat. Workshop on Distributed Algorithms","first-page":"269","article-title":"Gamma-accurate failure detectors","author":"Guerraoui","year":"1996"},{"article-title":"A modular approach to fault-tolerant broadcasts and related problems","year":"1994","author":"Hadzilacos","key":"10.1016\/S0304-3975(98)00235-7_BIB15"},{"key":"10.1016\/S0304-3975(98)00235-7_BIB16","doi-asserted-by":"crossref","unstructured":"R. van Renesse, Private communication, April 1997.","DOI":"10.1049\/cp:19970425"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:46Z","timestamp":1759625506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397598002357"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00235-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1999,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00235-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}