{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:23Z","timestamp":1761611063613},"reference-count":46,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0304-3975(99)00339-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:58:42Z","timestamp":1027612722000},"page":"389-437","source":"Crossref","is-referenced-by-count":11,"title":["Linda-based applicative and imperative process algebras"],"prefix":"10.1016","volume":"238","author":[{"given":"Rocco De","family":"Nicola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Pugliese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00339-4_BIB1","first-page":"78","article-title":"A theory of testing for ACP","volume":"Vol. 527","author":"Aceto","year":"1991"},{"issue":"2","key":"10.1016\/S0304-3975(99)00339-4_BIB2","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."},{"issue":"1","key":"10.1016\/S0304-3975(99)00339-4_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/114005.102807","article-title":"The concurrent language shared prolog","volume":"13","author":"Brogi","year":"1991","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"2","key":"10.1016\/S0304-3975(99)00339-4_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/inco.1995.1114","article-title":"Testing equivalence for mobile processes","volume":"120","author":"Boreale","year":"1995","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/S0304-3975(99)00339-4_BIB5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB6","unstructured":"L. Borrmann, M. Herdieckerhoff, A. Klein, Tuple space integrated into modula-2: implementation of the Linda concept on a hierarchical multiprocessor, in: R. Jesshope (Ed.), CONPAR\u201988, Proc. Cambridge University Press, Cambridge, 1988."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB8","first-page":"76","article-title":"Process algebra with asynchronous communication mechanisms","volume":"Vol. 197","author":"Bergstra","year":"1985"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB9","doi-asserted-by":"crossref","unstructured":"F.S. de Boer, J.W. Klop, C. Palamidessi, Asynchronous communication in process algebra, Proc. LICS, IEEE Computer Society Press, silver Spring, MD, 1992, pp. 137\u2013147.","DOI":"10.1109\/LICS.1992.185528"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB10","first-page":"99","article-title":"On the asynchronous nature of communication in concurrent logic languages","volume":"Vol. 458","author":"de Boer","year":"1990"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB11","unstructured":"G. Boudol, Asynchrony in the \u03c0-calculus, Research Report 1702, INRIA Sophia-Antipolis, 1992."},{"issue":"4","key":"10.1016\/S0304-3975(99)00339-4_BIB12","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in context","volume":"32","author":"Carriero","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB13","doi-asserted-by":"crossref","unstructured":"N. Carriero, D. Gelernter, J. Leichter, Distributed data structures in Linda, Proc. ACM Symp. on Principles of Programming Languages, ACM, New York, 1986, pp. 236\u2013242.","DOI":"10.1145\/512644.512666"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB14","series-title":"Parallel Program Design: A Foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB15","doi-asserted-by":"crossref","unstructured":"P. Ciancarini, R. Gorrieri, G. Zavattaro, Towards a calculus for generative communication, Proc. 1st IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems, FMOODS\u201996, Chapman & Hall, London, 1996, pp. 283\u2013297.","DOI":"10.1007\/978-0-387-35082-0_21"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01211314","article-title":"Testing equivalence as a bisimulation equivalence","volume":"5","author":"Cleaveland","year":"1993","journal-title":"J. Formal Aspects Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB17","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, D. Yankelevich, An operational framework for value-passing processes, Proc. ACM Symp. on Principles of Programming Languages, ACM, New York, 1994, pp. 326\u2013338.","DOI":"10.1145\/174675.177941"},{"issue":"5","key":"10.1016\/S0304-3975(99)00339-4_BIB18","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/32.685256","article-title":"KLAIM","volume":"24","author":"De Nicola","year":"1998","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalence for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB20","first-page":"138","article-title":"CCS without \u03c4's","volume":"Vol. 249","author":"De Nicola","year":"1987"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB21","series-title":"STRICT\u201995, Proc. Series Workshops in Computing","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-1-4471-3078-9_9","article-title":"An observational semantics for Linda","author":"De Nicola","year":"1995"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB22","first-page":"160","article-title":"A process algebra based on Linda","volume":"Vol. 1061","author":"De Nicola","year":"1996"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB23","first-page":"320","article-title":"Testing semantics of asynchronous distributed programs","volume":"Vol. 1192","author":"De Nicola","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(99)00339-4_BIB24","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 Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB25","doi-asserted-by":"crossref","unstructured":"I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science, Vol. 99, Springer, Berlin, 1981.","DOI":"10.1007\/3-540-10284-1"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB26","doi-asserted-by":"crossref","unstructured":"M. Hansen, H. Huttel, J. Kleist, Bisimulations for asynchronous mobile processes. Proc. Tbilisi Symp. on Languages, Logic and Computation 1995, also appeared as Research Paper HCRC\/RP-72, Univ. of Edinburgh.","DOI":"10.7146\/brics.v3i8.19971"},{"issue":"4","key":"10.1016\/S0304-3975(99)00339-4_BIB27","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB28","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"issue":"2","key":"10.1016\/S0304-3975(99)00339-4_BIB29","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1993.1067","article-title":"A theory of communicating processes with value-passing","volume":"107","author":"Hennessy","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB30","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/BF01642508","article-title":"Communicating processes with value-passing and assignment","volume":"3","author":"Hennessy","year":"1993","journal-title":"J. Formal Aspects of Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB31","first-page":"261","article-title":"A term model for CCS","volume":"Vol. 88","author":"Hennessy","year":"1980"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB32","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB33","first-page":"133","article-title":"An object calculus for asynchronous communication","volume":"Vol. 512","author":"Honda","year":"1991"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB34","first-page":"21","article-title":"On asynchronous communication semantics","volume":"Vol. 612","author":"Honda","year":"1991"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB35","unstructured":"A. Ingolfsdottir, Semantic models for communicating processes with value-passing, Ph.D. Thesis, University of Sussex, Department of Cognitive and Computing Science, 1994."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB36","series-title":"IFIP Working Conf. on Programming Concepts and Methods, Proceedings","first-page":"459","article-title":"A theory of synchrony and asynchrony","author":"Jifeng","year":"1990"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB37","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Part I and II, Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB39","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1980"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB40","unstructured":"J. Pinakis, C. McDonald, The inclusion of the Linda Tuple space operations in a Pascal-based concurrent language, Computer Science Dept., Univ. of Western Australia, 1991."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB41","unstructured":"G.D. Plotkin. A structural approach to operational semantics, Technical Report DAIMI FN-19, Aarhus University, Dept. of Computer Science, Denmark, 1981."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB42","series-title":"Proc. 5th Italian Conf. on Theoretical Computer Science \u201995","article-title":"A process calculus with asynchronous communications","author":"Pugliese","year":"1995"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB43","unstructured":"R. Pugliese, Semantic theories for asynchronous languages, Ph.D. Thesis, University of Rome \u201cLa Sapienza\u201d, Dipartimento di Scienze dell'Informazione, 1996."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB44","unstructured":"C-Linda User's Guide & Reference Manual, Scientific Research Associates, 1992."},{"key":"10.1016\/S0304-3975(99)00339-4_BIB45","series-title":"Concurrent Prolog","author":"Shapiro","year":"1987"},{"key":"10.1016\/S0304-3975(99)00339-4_BIB46","unstructured":"G. Sutcliffe, J. Pinakis, N. Lewins, Prolog-Linda: an embedding of Linda in muProlog. Tech. Report 89\/14, Dept. of Computer Science, Univ. of Western Australia, 1989."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:05:01Z","timestamp":1578693901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397599003394"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00339-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}