{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T11:53:37Z","timestamp":1764935617517},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(01)00329-2","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T17:15:47Z","timestamp":1035825347000},"page":"221-239","source":"Crossref","is-referenced-by-count":12,"title":["Bounded time-stamping in message-passing systems"],"prefix":"10.1016","volume":"290","author":[{"given":"Madhavan","family":"Mukund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Narayan Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Sohoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00329-2_BIB1","series-title":"Proc. CONCUR\u201999","first-page":"114","article-title":"Model checking of message sequence charts","volume":"Vol. 1664","author":"Alur","year":"1999"},{"issue":"1","key":"10.1016\/S0304-3975(01)00329-2_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB3","series-title":"Proc. ICALP \u201988","first-page":"147","article-title":"Approximations of a trace, asynchronous automata and the ordering of events in a distributed system","volume":"Vol. 317","author":"Cori","year":"1988"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1052","article-title":"Asynchronous mappings and asynchronous cellular automata","volume":"106","author":"Cori","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00329-2_BIB5","doi-asserted-by":"crossref","unstructured":"D. Dolev, N. Shavit, Bounded concurrent time-stamps are constructible, Proc. ACM STOC, 1989, pp. 454\u2013466.","DOI":"10.1145\/73007.73051"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB6","doi-asserted-by":"crossref","unstructured":"C. Dwork, O. Waarts, Simple and efficient bounded concurrent time-stamping or bounded concurrent time-stamps are comprehensible, Proc. 24th ACM STOC, 1992, pp. 655\u2013666.","DOI":"10.1145\/129712.129776"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB7","doi-asserted-by":"crossref","unstructured":"J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan, Towards a theory of regular MSC languages, Report RS-99-52, BRICS, Computer Science Department, Aarhus University, Denmark, 1999.","DOI":"10.7146\/brics.v6i52.20122"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB8","doi-asserted-by":"crossref","unstructured":"A. Israeli, M. Li, Bounded time-stamps, Proc. 28th IEEE FOCS, 1987, pp. 371\u2013382.","DOI":"10.1109\/SFCS.1987.10"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB9","unstructured":"S. Krishnamurthy, M. Mukund, Implementing causal ordering with bounded time-stamps, Report TCS-95-7, Chennai Mathematical Institute, Chennai, India, 1995."},{"issue":"8","key":"10.1016\/S0304-3975(01)00329-2_BIB10","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":"17","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB11","first-page":"1157","article-title":"Distributed computing: Models and methods","volume":"Vol. B","author":"Lamport","year":"1990"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB12","series-title":"Proc. ICALP \u201998","first-page":"188","article-title":"Robust asynchronous protocols are finite-state","volume":"Vol. 1443","author":"Mukund","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(01)00329-2_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s004460050031","article-title":"Keeping track of the latest gossip in a distributed system","volume":"10","author":"Mukund","year":"1997","journal-title":"Distributed Computing"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB14","doi-asserted-by":"crossref","unstructured":"M. Mukund, P.S. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, in: W. Penczek, A. Szalas (Eds.), Proc. MFCS \u201996, Springer Lecture Notes in Computer Science, Vol. 1113, Springer, Berlin, 1996, pp. 32\u201362.","DOI":"10.1007\/3-540-61550-4_140"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB15","doi-asserted-by":"crossref","unstructured":"A. Muscholl, D. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: M. Kutylowski, L. Pacholski, T. Wierzbicki (Eds.), Proc. MFCS\u201999, Springer Lecture Notes in Computer Science, Vol. 1672, Springer, Berlin, 1999, pp. 81\u201391.","DOI":"10.1007\/3-540-48340-3_8"},{"issue":"12","key":"10.1016\/S0304-3975(01)00329-2_BIB16","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1016\/0169-7552(95)00122-0","article-title":"Tutorial on message sequence charts","volume":"28","author":"Rudolph","year":"1996","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","article-title":"The causal ordering abstraction and a simple way to implement it","volume":"39","author":"Raynal","year":"1991","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0304-3975(01)00329-2_BIB18","doi-asserted-by":"crossref","unstructured":"A. Schiper, J. Eggli, A. Sandoz, A new algorithm to implement causal ordering, in: J.-C. Bermond, M. Raynal (Eds.), Proc. 3rd Int. Workshop on Distributed Algorithms, Nice, Springer Lecture Notes in Computer Science, Vol. 392, Springer, Berlin, 1989, pp. 219\u2013232.","DOI":"10.1007\/3-540-51687-5_45"},{"key":"10.1016\/S0304-3975(01)00329-2_BIB19","unstructured":"S. Yadulla, Global states of distributed systems, M. Tech Thesis, Department of Computer Science and Engineering, Indian Institute of Technology Bombay, 1999."},{"key":"10.1016\/S0304-3975(01)00329-2_BIB20","first-page":"99","article-title":"Notes on finite asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"R.A.I.R.O. \u2014 Inf. Th\u00e9or. et Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:51:36Z","timestamp":1583887896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397501003292"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00329-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}