{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:56:10Z","timestamp":1742381770240},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0020-0190(94)00129-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"105-108","source":"Crossref","is-referenced-by-count":12,"title":["Distributed termination detection with roughly synchronized clocks"],"prefix":"10.1016","volume":"52","author":[{"given":"Jean","family":"Mayo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phil","family":"Kearns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00129-4_BIB1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of a termination detection algorithm for distributed computations","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0020-0190(94)00129-4_BIB2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Programming Language Systems"},{"issue":"3","key":"10.1016\/0020-0190(94)00129-4_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","article-title":"Achieving distributed termination without freezing","volume":"8","author":"Francez","year":"1982","journal-title":"IEEE Trans. Software Engineering"},{"issue":"8","key":"10.1016\/0020-0190(94)00129-4_BIB4","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)00129-4_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(83)90089-3","article-title":"A distributed solution of the distributed termination problem","volume":"17","author":"Rana","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00129-4_BIB6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","article-title":"Termination detection of distributed computations","volume":"18","author":"Topor","year":"1984","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:52:10Z","timestamp":1555145530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0020019094001294"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00129-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}