{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:37Z","timestamp":1761610117633,"version":"build-2065373602"},"reference-count":49,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3984,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s1571-0661(04)80419-5","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"116-144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Abstractions for Fault-Tolerant Global Computing"],"prefix":"10.1016","volume":"66","author":[{"given":"Dominic","family":"Duggan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Amadio R. and S. Prasad, Localities and failures, in: P. S. Thiagarajan, editor, Proceedings of 14th Conference on Foundations of Software Technology and Theoretical Computer Science, number 880 in Lecture Notes in Computer Science (1995), pp. 205\u2013216.","DOI":"10.1007\/3-540-58715-2_126"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Amadio, R. M., An asynchronous model of locality, failure and process mobility, in: COORDINATION'97, Lecture Notes in Computer Science 1282 (1997).","DOI":"10.1007\/3-540-63383-9_92"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","article-title":"On bisimulations for the asynchronous pi-calculus","volume":"195","author":"Amadio","year":"1998","journal-title":"Theoretical Computer Science"},{"year":"1999","series-title":"\u201cThe Jini Specification\u201d","author":"Arnold","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB4"},{"year":"1987","series-title":"\u201cConcurrency Control and Recovery in Database Systems\u201d","author":"Bernstein","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB5"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Birrell A., G. Nelson, S. Owicki and E. Wobber, Network objects, in: Symposium on Operating Systems Principles (1993), pp. 217\u2013230.","DOI":"10.1145\/168619.168637"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Bruni R., C. Laneve and U. Montanari, Orchestrating transactions in the Join calculus, in: CONCUR 2002, 13th International Conference on Concurrency Theory, Lecture Notes in Computer Science (2002).","DOI":"10.1007\/3-540-45694-5_22"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0167-6423(97)00007-5","article-title":"Partial order and contextual net semantics for atomic and locally atomic cc programs","volume":"30","author":"Bueno","year":"1998","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Busi N., R. Gorrieri and G. Zavattaro, On the serializability of transactions in JavaSpaces, in: ConCoord 2001, International Workshop on Concurrency and Coordination, ENTCS 54, 2001.","DOI":"10.1016\/S1571-0661(04)00238-5"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB10","series-title":"Secure Internet Programming: Security Issues for Distributed and Mobile Objects","article-title":"Abstractions for mobile computation","volume":"1603","author":"Cardelli","year":"1999"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB11","first-page":"140","article-title":"Mobile ambients","volume":"1378","author":"Cardelli","year":"1998"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB12","series-title":"Internet Programming Languages","article-title":"A calculus of secure mobile computations","author":"Castagna","year":"1999"},{"year":"1997","series-title":"COM+: The next generation","author":"Chappell","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB13"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Cheriton D. and D. Skeen, Understanding the limitations of causally and totally ordered communication, in: Symposium on Operating Systems Principles, 1993.","DOI":"10.1145\/168619.168623"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB15","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1145\/1270.1499","article-title":"Optimism and consistency in partitioned database systems","volume":"9","author":"Davidson","year":"1984","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB16","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/265943.265954","article-title":"Proving concurrent constraint programs correct","volume":"19","author":"de Boer","year":"1998","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/2.16189","article-title":"Inheritance of synchronization and recovery properties in avalon\/c++","author":"Detlefs","year":"1988","journal-title":"IEEE Computer"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Duggan D., Atomic failure in wide-area computation, in: Formal Methods in Open Object-Based Distributed Systems (FMOODS) (2000).","DOI":"10.1007\/978-0-387-35520-7_4"},{"year":"1992","series-title":"\u201cDatabase Transaction Models for Advanced Applications\u201d","author":"Elmagarmid","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB19"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB20","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB21","doi-asserted-by":"crossref","unstructured":"Fournet C. and G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (1996), pp. 372\u2013385.","DOI":"10.1145\/237721.237805"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB22","first-page":"844","article-title":"A hierarchy of equivalences for asynchronous calculi (extended abstract)","volume":"1443","author":"Fournet","year":"1998","journal-title":"ICALP"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB23","doi-asserted-by":"crossref","unstructured":"Fournet C., G. Gonthier, J.-J. L\u00e9vy, L. Maranget, and D. R\u00e9my, A calculus of mobile agents, in: 7th International Conference on Concurrency Theory (CONCUR'96) (1996), pp. 406\u2013421, INCS 1119.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB24","first-page":"14","article-title":"Modeling long-running activities as nested sagas","volume":"14","author":"Garcia-Molina","year":"1991","journal-title":"Bulletin of the IEEE Technical Committee on Data Engineering"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB25","doi-asserted-by":"crossref","unstructured":"Garcia-Molina H. and K. Salem, Sagas, in: ACM SIGMOD International Conference on Management of Data, 1987, pp. 249\u2013259.","DOI":"10.1145\/38713.38742"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB26","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/2363.2433","article-title":"Generative communication in Linda","volume":"7","author":"Gelernter","year":"1985","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB27","series-title":"Fault-Tolerant Distributed Computing","first-page":"201","article-title":"On the relationship between the atomic commitment and consensus problems","volume":"448","author":"Hadzilacos","year":"1990"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB28","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1145\/197320.197346","article-title":"Composing first-class transactions","volume":"16","author":"Haines","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB29","series-title":"Secure Internet Programming: Security Issues for Distributed and Mobile Objects","article-title":"Type-safe execution of mobile agents in anonymous networks","author":"Hennessy","year":"1999"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB30","doi-asserted-by":"crossref","unstructured":"Herescu, O. M. and C. Palamidessi, Probabilistic asynchronous \u03c0-calculus, in: J. Tiuryn, editor, Proceedings of FOSSACS 2000 (Part of ETAPS 2000), Lecture Notes in Computer Science (2000), pp. 146\u2013160.","DOI":"10.1007\/3-540-46432-8_10"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB31","doi-asserted-by":"crossref","unstructured":"Honda K. and M. Tokoro, An object calculus for asynchronous communication, in: European Conference on Object-Oriented Programming, Lecture Notes in Computer Science (1991), pp. 133\u2013147.","DOI":"10.1007\/BFb0057019"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB32","unstructured":"Korth H., E. Levy and A. Silberschatz, Compensating transactions: A new recovery paradigm, in: VLDB Conference, 1990, pp. 95\u2013106."},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB33","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":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB34","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/42392.42399","article-title":"Distributed programming in Argus","volume":"31","author":"Liskov","year":"1988","journal-title":"Communications of the ACM"},{"year":"1994","series-title":"\u201cAtomic Transactions\u201d","author":"Lynch","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB35"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB36","series-title":"Logic and Algebra of Specification","first-page":"203","article-title":"The polyadic \u03c0-calculus: A tutorial","volume":"94","author":"Milner","year":"1993"},{"year":"1985","series-title":"\u201cNested Transactions: An Approach to Reliable Distributed Computing\u201d","author":"Moss","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB37"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB38","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/32.685256","article-title":"KLAIM: A kernel language for agents interaction and mobility","volume":"24","author":"Nicola","year":"1998","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB39","doi-asserted-by":"crossref","unstructured":"Palamidessi C., Comparing the expressive power of the synchronous and the asynchronous pi-calculus, in: Proceedings of ACM Symposium on Principles of Programming Languages (1997).","DOI":"10.1145\/263699.263731"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB40","unstructured":"Pu C., G. Kaiser and N. Hutchinson, Split-transactions for open-ended activities, in: VLDB Conference, 1988, pp. 26\u201337."},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB41","doi-asserted-by":"crossref","unstructured":"Riely J. and M. Hennessy, Distributed processes and location failures, in: Proceedings of the International Conference on Automata, Languages and Programming, 1997.","DOI":"10.1007\/3-540-63165-8_203"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB42","doi-asserted-by":"crossref","unstructured":"Riely J. and M. Hennessy, Trust and partial typing in open systems of mobile agents, in: Proceedings of ACM Symposium on Principles of Programming Languages, 1999.","DOI":"10.1145\/292540.292551"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB43","article-title":"Asynchronous process calculi: The first-order and higher-order paradigms","author":"Sangiorgi","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB44","doi-asserted-by":"crossref","unstructured":"Saraswat V. and M. Rinard, Concurrent constraint programming, in: Proceedings of ACM Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96733"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB45","doi-asserted-by":"crossref","unstructured":"Saraswat V., M. Rinard and P. Panangaden, Semantic foundations of concurrent constraint programming, in: Proceedings of ACM Symposium on Principles of Programming Languages, 1991.","DOI":"10.1145\/99583.99627"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB46","unstructured":"Schwarz R. and F. Mattern, Detecting causal relationships in distributed computations: In search of the Holy Grail, Technical Report SFB124\u201315\/92, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany (1992)."},{"year":"1996","series-title":"\u201cCORBA Fundamentals and Programming\u201d","author":"Siegel","key":"10.1016\/S1571-0661(04)80419-5_NEWBIB47"},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB48","unstructured":"Stamos J. and F. Cristian, A low-cost atomic commit protocol, in: IEEE Symposium on Reliable Distributed Systems, 1990."},{"key":"10.1016\/S1571-0661(04)80419-5_NEWBIB49","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/155848.155857","article-title":"Causal controversy at Le Mont St.-Michel","volume":"27","author":"Renesse","year":"1993","journal-title":"Operating Systems Review"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:24Z","timestamp":1761609924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S1571066104804195"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80419-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Abstractions for Fault-Tolerant Global Computing","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80419-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}