{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:32:29Z","timestamp":1763415149666},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":[[1991,9]]},"DOI":"10.1016\/0020-0190(91)90008-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"343-350","source":"Crossref","is-referenced-by-count":157,"title":["The causal ordering abstraction and a simple way to implement it"],"prefix":"10.1016","volume":"39","author":[{"given":"Michel","family":"Raynal","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Schiper","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0190(91)90008-6_BIB1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of networks synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/0020-0190(91)90008-6_BIB2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/362946.362970","article-title":"A note on reliable full duplex transmission over half duplex links","volume":"12","author":"Barlett","year":"1969","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0190(91)90008-6_BIB3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/7351.7478","article-title":"Reliable communications in presence of failures","volume":"5","author":"Birman","year":"1987","journal-title":"ACM Trans. Comput. Sci."},{"key":"10.1016\/0020-0190(91)90008-6_BIB4","series-title":"Distributed Systems","article-title":"Exploiting replication in distributed systems","author":"Birman","year":"1990"},{"key":"10.1016\/0020-0190(91)90008-6_BIB5","series-title":"Proc. 11th Australian Computer Science Conf.","article-title":"Timestamps in message-passing systems that preserve the partial ordering","author":"Fidge","year":"1988"},{"key":"10.1016\/0020-0190(91)90008-6_BIB6","first-page":"125","article-title":"Detection of stable properties in distributed applications","author":"Helary","year":"1987","journal-title":"Proc. 6th ACM Symp. on PODC"},{"key":"10.1016\/0020-0190(91)90008-6_BIB7","series-title":"Synchronization and Control of Distributed Systems and Programs","first-page":"200","author":"Helary","year":"1990"},{"issue":"1","key":"10.1016\/0020-0190(91)90008-6_BIB8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/6306.6309","article-title":"Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems","volume":"4","author":"Joseph","year":"1986","journal-title":"ACM Trans. Comput. Sci."},{"issue":"7","key":"10.1016\/0020-0190(91)90008-6_BIB9","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"},{"issue":"3","key":"10.1016\/0020-0190(91)90008-6_BIB10","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(91)90008-6_BIB11","series-title":"Proc. Internat. Workshop on Parallel and Distributed Algorithms","first-page":"215","article-title":"Time and global states of distributed systems","author":"Mattern","year":"1988"},{"key":"10.1016\/0020-0190(91)90008-6_BIB12","first-page":"281","article-title":"Substituting for real-time and common knowledge in distributed systems","author":"Neiger","year":"1987","journal-title":"Proc. 6ht ACM Symp. on PODC"},{"key":"10.1016\/0020-0190(91)90008-6_BIB13","series-title":"Algorithm for Mutual Exclusion","first-page":"107","author":"Raynal","year":"1986"},{"key":"10.1016\/0020-0190(91)90008-6_BIB14","series-title":"Distributed Computation and Networks: Concepts, Tools and Algorithms","first-page":"166","author":"Raynal","year":"1988"},{"key":"10.1016\/0020-0190(91)90008-6_BIB15","first-page":"219","article-title":"A new algorithm to implement causal ordering","volume":"392","author":"Schiper","year":"1989"},{"key":"10.1016\/0020-0190(91)90008-6_BIB16","first-page":"99","article-title":"A data transfer protocol","volume":"1","author":"Stenning","year":"1976","journal-title":"Computer Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091900086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091900086?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:25:10Z","timestamp":1555143910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091900086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["0020019091900086"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90008-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}