{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:24:53Z","timestamp":1761596693799},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":4337,"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":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00326-1","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:53:12Z","timestamp":1036101192000},"page":"693-735","source":"Crossref","is-referenced-by-count":22,"title":["Distributed processes and location failures"],"prefix":"10.1016","volume":"266","author":[{"given":"James","family":"Riely","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00326-1_BIB1","unstructured":"S. Abramsky, The lazy lambda calculus, in: D. Turner (Ed.), Research Topics in Functional Programming, UT Year of Programming Series, Addison-Wesley, Reading, MA, 1990,, pp. 65\u2013117."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01221099","article-title":"A static view of localities","volume":"6","author":"Aceto","year":"1994","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB3","series-title":"An asynchronous model of locality, failure, and process mobility, COORDINATION \u201997","volume":"vol. 1282","author":"Amadio","year":"1997"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","article-title":"On bisimulations for the asynchronous \u03c0-calculus","volume":"195","author":"Amadio","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB5","unstructured":"R. Amadio, S. Prasad, in: Localities and failures, Proc. 14th Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB6","series-title":"Process Algebra","volume":"vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB7","first-page":"51","article-title":"A lambda calculus for (strict) parallel functions","volume":"108","author":"Boudol","year":"1994","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01221098","article-title":"A theory of processes with localities","volume":"6","author":"Boudol","year":"1994","journal-title":"Formal Aspects Comput."},{"issue":"6","key":"10.1016\/S0304-3975(00)00326-1_BIB9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1142\/S0129054195000196","article-title":"Observing distribution in processes: static and dynamic localities","volume":"6","author":"Castellani","year":"1995","journal-title":"Internat. J. Foundations Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(00)00326-1_BIB10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","article-title":"The concurrency workbench: A semantics-based tool for the verification of finite-state systems","volume":"15","author":"Cleaveland","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB11","unstructured":"F. Corradini, Space, Time and nondeterminism in process algebras, Ph.D. Thesis, Universit\u00e0 Degli Studi di Roma \u201cLa Sapienza\u201d, 1996."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB12","doi-asserted-by":"crossref","unstructured":"P. Darondeau, P. Degano, Causal trees, in: G. Ausiello, M. Dezani-Ciancaglini, S. Ronchi della Rocca (Eds.), Proc. Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Stresa, Italy, Springer, Berlin, July 1989, pp. 234\u2013248.","DOI":"10.1007\/BFb0035764"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB13","doi-asserted-by":"crossref","unstructured":"P. Degano, R. De Nicola, U. Montanari, Partial orderings descriptions and observations of nondeterministic concurrent processes, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, vol. 354, Springer, Berlin, June 1988, pp. 438\u2013466. School\/Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, Netherlands, 1988.","DOI":"10.1007\/BFb0013030"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB14","doi-asserted-by":"crossref","unstructured":"P. Degano, C. Priami, Causal trees, in: W. Kuich (Ed.), Proc. Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Wien, Austria, Springer, Berlin, July 1992, pp. 629\u2013640.","DOI":"10.1007\/3-540-55719-9_110"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB15","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, Conf. Record of the ACM Symp. on Principles of Programming Languages, Paris, ACM Press, New York, January 1996.","DOI":"10.1145\/237721.237805"},{"issue":"2","key":"10.1016\/S0304-3975(00)00326-1_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01491213","article-title":"A symmetric integration of concurrent and functional programming","volume":"18","author":"Giacalone","year":"1989","journal-title":"Internat J Parallel Programming"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB17","doi-asserted-by":"crossref","unstructured":"A.D. Gordon, Bisimilarity as a theory of functional programming, in: S. Brookes, M. Main, A. Merton and M. Misrove (Eds.), Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, vol. 1, (http:\/\/www.elsevier.nl\/locate\/entcs). Elsevier, Amsterdam, 1995.","DOI":"10.1016\/S1571-0661(04)80013-6"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","article-title":"Symbolic bisimulations","volume":"138","author":"Hennessy","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB19","doi-asserted-by":"crossref","unstructured":"M. Hennessy, J. Riely, Resource access control in systems of mobile agents (Extended Abstract), 3rd Internat. Workshop on High-Level Concurrent Languages (HLCL\u201998), Electronic Notes in Theoretical Computer Science, vol. 16(3), Available from http:\/\/www.elsevier.nl\/locate\/entcs, 1998. Full version Inform. and Comput., to appear.","DOI":"10.1016\/S1571-0661(04)00141-0"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB20","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"issue":"8","key":"10.1016\/S0304-3975(00)00326-1_BIB21","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF01178730","article-title":"Comparing locality and causality based equivalences","volume":"31","author":"Kiehn","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB22","doi-asserted-by":"crossref","unstructured":"W. Kuich (Ed.), Proc. Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Wien, Austria, Springer, Berlin, July 1992.","DOI":"10.1007\/3-540-55719-9"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB23","doi-asserted-by":"crossref","unstructured":"Z. Manna et al. STeP: The stanford temporal prover, Tech. Rep., Stanford University, Computer Science Laboratory, June 1994.","DOI":"10.21236\/ADA324036"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB24","series-title":"The Temporal Logic of Reactive and Concurrent System: Specification","author":"Manna","year":"1992"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB25","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, Parts I and II","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB27","doi-asserted-by":"crossref","unstructured":"U. Montanari, D. Yankelovich, Partial order localities, in: W. Kuich (Ed.), Proc. Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Wien, Austria, Springer, Berlin, July 1992, pp. 617\u2013628.","DOI":"10.1007\/3-540-55719-9_109"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB28","series-title":"Executing Temporal Logic Programs","author":"Moszkowski","year":"1986"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB29","doi-asserted-by":"crossref","unstructured":"D. Murphy, in: Observing located concurrency, Proc. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993.","DOI":"10.1007\/3-540-57182-5_48"},{"key":"10.1016\/S0304-3975(00)00326-1_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(95)00254-5","article-title":"Interval logics and their decision procedures: Part i: An interval logic","volume":"166","author":"Ramakrishna","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB31","unstructured":"D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. thesis, University of Edinburgh, 1992."},{"key":"10.1016\/S0304-3975(00)00326-1_BIB32","doi-asserted-by":"crossref","unstructured":"C. Stirling, Modal and temporal logics, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Background: Computational Structures, Oxford University Press, Oxford, 1992, pp. 477\u2013563.","DOI":"10.1093\/oso\/9780198537618.003.0005"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003261?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003261?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T15:59:43Z","timestamp":1704038383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500003261"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00326-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}