{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:17:25Z","timestamp":1775053045763,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":[[1992,8]]},"DOI":"10.1016\/0020-0190(92)90028-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"47-52","source":"Crossref","is-referenced-by-count":114,"title":["An efficient implementation of vector clocks"],"prefix":"10.1016","volume":"43","author":[{"given":"Mukesh","family":"Singhal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90028-T_BIB1","first-page":"274","article-title":"Implementing and programming causal distributed memory","author":"Ahamad","year":"1991","journal-title":"Proc. 11th Internat. Conf. on Distributed Computing Systems"},{"key":"10.1016\/0020-0190(92)90028-T_BIB2","article-title":"Fast causal multicast","author":"Birman","year":"1990"},{"issue":"1","key":"10.1016\/0020-0190(92)90028-T_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","article-title":"Concerning the size of clocks","volume":"39","author":"Charron-Bost","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90028-T_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/68210.69233","article-title":"Partial order for parallel debugging","author":"Fidge","year":"1988","journal-title":"Proc. ACM SIGPLAN \/ SIGOPS Worshop on Parallel and Distributed Debugging"},{"key":"10.1016\/0020-0190(92)90028-T_BIB5","first-page":"56","article-title":"Timestamps in message-passing systems that preserve partial ordering","volume":"10","author":"Fidge","year":"1988","journal-title":"Austral. Comput. Sci. Comm."},{"key":"10.1016\/0020-0190(92)90028-T_BIB6","unstructured":"A.D. Kshemkalyani and M. Singhal, On characterization and correctness of distributed deadlock detection, OSU- CISRC-10\/90-TR15 (under review for publication)."},{"key":"10.1016\/0020-0190(92)90028-T_BIB7","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(92)90028-T_BIB8","first-page":"552","article-title":"Using tracing to direct our reasoning about distributed programs","author":"Lloyd","year":"1991","journal-title":"Proc. 11th Internat. Conf. on Distributed Computing Systems"},{"key":"10.1016\/0020-0190(92)90028-T_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01782776","article-title":"Algorithms for distributed termination detection","volume":"2","author":"Mattern","year":"1987","journal-title":"Distributed Comput."},{"key":"10.1016\/0020-0190(92)90028-T_BIB10","first-page":"215","article-title":"Virtual time and global states of distributed systems","author":"Mattern","year":"1989"},{"key":"10.1016\/0020-0190(92)90028-T_BIB11","author":"Mattern","year":"1989"},{"key":"10.1016\/0020-0190(92)90028-T_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/112600.112620","article-title":"Exploiting locality in maintaining potential causality","author":"Meldal","year":"1991"},{"key":"10.1016\/0020-0190(92)90028-T_BIB13","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TSE.1983.236733","article-title":"Detection of mutual inconsistency in distributed systems","volume":"9","author":"Parker","year":"1983","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0020-0190(92)90028-T_BIB14","first-page":"219","article-title":"A new algorithm to implement causal ordering","volume":"392","author":"Schiper","year":"1989"},{"issue":"5","key":"10.1016\/0020-0190(92)90028-T_BIB15","doi-asserted-by":"crossref","DOI":"10.1109\/12.24268","article-title":"A heuristically-aided algorithm for mutual exclusion in distributed systems","volume":"38","author":"Singhal","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90028-T_BIB16","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1145\/3959.3962","article-title":"Optimistic recovery in distributed systems","volume":"3","author":"Strom","year":"1985","journal-title":"ACM Trans. Comput. Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290028T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290028T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:23Z","timestamp":1555132883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290028T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["002001909290028T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90028-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}