{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:13:18Z","timestamp":1759133598283},"reference-count":45,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":5586,"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":[[1998,4]]},"DOI":"10.1016\/s0304-3975(97)00195-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"45-70","source":"Crossref","is-referenced-by-count":21,"title":["A framework for viewing atomic events in distributed computations"],"prefix":"10.1016","volume":"196","author":[{"given":"Ajay D.","family":"Kshemkalyani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00195-3_BIB1","series-title":"Proc. 10th IEEE Int. Conf. Distrib. Comput. Systems","first-page":"12","article-title":"A basic unit of computation in distributed systems","author":"Ahuja","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(97)00195-3_BIB2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/142111.142121","article-title":"A survey of asynchronous remote procedure calls","volume":"26","author":"Ananda","year":"1992","journal-title":"ACM Operating Systems Rev."},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1145\/2402.322387","article-title":"Efficiency of synchronous versus asynchronous distributed systems","volume":"30","author":"Arjomandi","year":"1983","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1147\/sj.343.0501","article-title":"CPI-C: An API for distributed applications","volume":"34","author":"Arnette","year":"1995","journal-title":"IBM Systems J."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB5","series-title":"Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency","first-page":"50","article-title":"Process theory based on bisimulation semantics","volume":"vol. 354","author":"Bergstra","year":"1988"},{"year":"1987","series-title":"Concurrency Control and Recovery in Database Systems","author":"Bernstein","key":"10.1016\/S0304-3975(97)00195-3_BIB6"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(87)90005-3","article-title":"Repeated snapshots in distributed systems with synchronous communication and their implementation in CSP","volume":"49","author":"Boug\u00e9","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(97)00195-3_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: global states of a distributed system","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB9","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","article-title":"How processes learn","volume":"1","author":"Chandy","year":"1986","journal-title":"Distributed Comput."},{"year":"1988","series-title":"Parallel Program Design: A Foundation","author":"Chandy","key":"10.1016\/S0304-3975(97)00195-3_BIB10"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB11","series-title":"Proc. Internat. Workshop on Distributed Algorithms","first-page":"45","article-title":"Combinatorics and geometry of consistent cuts: application to concurrency theory","volume":"vol. 392","author":"CharrondashBost","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(97)00195-3_BIB12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0304-3975(93)90012-I","article-title":"Coupling coefficients of a distributed execution","volume":"110","author":"CharrondashBost","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(97)00195-3_BIB13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004460050018","article-title":"Synchronous, asynchronous and causally ordered communication","volume":"9","author":"CharrondashBost","year":"1996","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB14","series-title":"Proc. 13th ACM Symp. on Principles of Distributed Computing","first-page":"22","article-title":"Repeatable and portable message-passing programs","author":"Cypher","year":"1994"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB15","series-title":"Proc. IEEE Int. Conf. Parallel Processing","first-page":"729","article-title":"Semantics of blocking and nonblocking send and receive primitives","author":"Cypher","year":"1994"},{"issue":"12","key":"10.1016\/S0304-3975(97)00195-3_BIB16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/174267.166789","article-title":"Nondeterminacy: testing and debugging in message-passing parallel programs","volume":"28","author":"DamodarandashKamal","year":"1993","journal-title":"ACM SIGPLAN Notices"},{"year":"1968","series-title":"Lattice Theory","author":"Donnellan","key":"10.1016\/S0304-3975(97)00195-3_BIB17"},{"issue":"1","key":"10.1016\/S0304-3975(97)00195-3_BIB18","first-page":"56","article-title":"Timestamps in message-passing systems that preserve partial ordering","volume":"10","author":"Fidge","year":"1988","journal-title":"Australian Comput. Sci. Comm."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB19","series-title":"The Transputer in Australasia","first-page":"92","article-title":"A simple rundashtime concurrency measure","author":"Fidge","year":"1990"},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TSE.1982.235418","article-title":"Global states in a distributed system","volume":"8","author":"Fischer","year":"1982","journal-title":"IEEE Trans. Software Eng."},{"article-title":"Layered design of parallel systems","year":"1994","author":"Janssen","key":"10.1016\/S0304-3975(97)00195-3_BIB21"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB22","doi-asserted-by":"crossref","DOI":"10.1006\/jcss.1996.0022","article-title":"Temporal interactions of intervals in distributed systems","author":"Kshemkalyani","year":"1994"},{"article-title":"A unifying framework for viewing atomic actions in parallel and distributed systems","year":"1995","author":"Kshemkalyani","key":"10.1016\/S0304-3975(97)00195-3_BIB23"},{"issue":"2","key":"10.1016\/S0304-3975(97)00195-3_BIB24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jcss.1996.0022","article-title":"Temporal interactions of intervals in distributed systems","volume":"52","author":"Kshemkalyani","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB25","series-title":"Proc. 5th IEEE Workshop on Parallel and Distributed Real-time Systems","first-page":"81","article-title":"Synchronization for distributed real-time applications","author":"Kshemkalyani","year":"1997"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB26","series-title":"Proc. 8th IASTED Conf. on Parallel and Distributed Computing and Systems","first-page":"324","article-title":"Relative timing constraints between complex events","author":"Kshemkalyani","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(97)00195-3_BIB27","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jpdc.1994.1069","article-title":"On characterization and correctness of distributed deadlock detection","volume":"22","author":"Kshemkalyani","year":"1994","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB28","series-title":"Distributed Computing","article-title":"Necessary and sufficient conditions on the information for causal message ordering and their optimal implementation","author":"Kshemkalyani","year":"1995"},{"issue":"7","key":"10.1016\/S0304-3975(97)00195-3_BIB29","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication, Part I. basic formalism, Part II: algorithms","volume":"1","author":"Lamport","year":"1986","journal-title":"Distributed Comput."},{"article-title":"An introduction to input\/output automata","year":"1988","author":"Lynch","key":"10.1016\/S0304-3975(97)00195-3_BIB31"},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB32","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\/S0304-3975(97)00195-3_BIB33","series-title":"Proc. Workshop on Parallel and Distributed Algorithms, North-Holland","first-page":"215","article-title":"Virtual time and global states of distributed systems","author":"Mattern","year":"1989"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB34","series-title":"Theory and Practice in Distributed Systems","first-page":"197","article-title":"A nonblocking lightweight implementation of causal order message delivery","volume":"vol. 938","author":"Mattern","year":"1995"},{"key":"10.1016\/S0304-3975(97)00195-3_BIB35","series-title":"Proc. Supercomputing","first-page":"502","article-title":"Optimal tracing and replay for debugging message-passing parallel programs","author":"Netzer","year":"1992"},{"issue":"2","key":"10.1016\/S0304-3975(97)00195-3_BIB36","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TSE.1975.6312842","article-title":"System structure for software fault tolerance","volume":"1","author":"Randell","year":"1975","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(97)00195-3_BIB37","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. Processing Lett."},{"issue":"2","key":"10.1016\/S0304-3975(97)00195-3_BIB38","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02280831","article-title":"Strong stable properties in distributed systems","volume":"8","author":"Schiper","year":"1994","journal-title":"Distributed Comput."},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB39","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02277859","article-title":"Detecting causal relationships in distributed computations: in search of the holy grail","volume":"7","author":"Schwarz","year":"1994","journal-title":"Distributed Comput."},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB40","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/211414.211427","article-title":"Transaction chopping: algorithms and performance studies","volume":"22","author":"Shasa","year":"1995","journal-title":"ACM Trans. Database Systems"},{"issue":"1","key":"10.1016\/S0304-3975(97)00195-3_BIB41","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jpdc.1993.1048","article-title":"A taxonomy of distributed mutual exclusion","volume":"18","author":"Singhal","year":"1993","journal-title":"J. Parallel Distributed Comput."},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB42","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/0020-0190(95)00094-S","article-title":"An optimality proof of asynchronous recovery algorithms in distributed systems","volume":"55","author":"Singhal","year":"1995","journal-title":"Inform. Processing Lett."},{"year":"1996","series-title":"MPI: The Complete Reference","author":"Snir","key":"10.1016\/S0304-3975(97)00195-3_BIB43"},{"issue":"3","key":"10.1016\/S0304-3975(97)00195-3_BIB44","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"},{"issue":"1","key":"10.1016\/S0304-3975(97)00195-3_BIB45","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","article-title":"Termination detection for distributed computations","volume":"18","author":"Topor","year":"1984","journal-title":"Inform. Processing Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001953?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001953?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T14:12:01Z","timestamp":1620915121000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0304397597001953"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00195-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}