{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:32Z","timestamp":1761611072184},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"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,6]]},"DOI":"10.1016\/s0304-3975(99)00227-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:42:30Z","timestamp":1027651350000},"page":"49-90","source":"Crossref","is-referenced-by-count":22,"title":["Comparing three semantics for Linda-like languages"],"prefix":"10.1016","volume":"240","author":[{"given":"Nadia","family":"Busi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(99)00227-3_BIB1","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(99)00227-3_BIB2","series-title":"Asynchrony and the \u03c0-calculus, Technical Report 1702","author":"Boudol","year":"1992"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB3","series-title":"Proc. CONCUR\u201995, vol. 962 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","article-title":"A petri net semantics for \u03c0-calculus","author":"Busi","year":"1995"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB4","unstructured":"N. Busi, R. Gorrieri, G. Zavattaro, A truly concurrent view of Linda interprocess communication, Technical Report UBLCS-97-02, Department of Computer Science, University of Bologna, 1997."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB5","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, G. Zavattaro, Three semantics of the output operation for generative communication, in: Proc. Coordination\u201997, vol. 1282 of Lecture Notes in Computer Science, 1997, pp. 205\u2013219.","DOI":"10.1007\/3-540-63383-9_82"},{"issue":"2","key":"10.1016\/S0304-3975(99)00227-3_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0304-3975(97)00149-7","article-title":"A process algebraic view of Linda coordination primitives","volume":"192","author":"Busi","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB7","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, G. Zavattaro, On the expressiveness of Linda coordination primitives, Inform. Comput. to appear.","DOI":"10.1006\/inco.1999.2823"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB8","series-title":"Proc. ICTCS\u201995","first-page":"311","article-title":"A Causal Semantics for Contextual P\/T nets","author":"Busi","year":"1995"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB9","series-title":"Proc. 1st IFIP Conf. on FMOODS\u201996","first-page":"283","article-title":"Towards a calculus for generative communication","author":"Ciancarini","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(99)00227-3_BIB10","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 and Systems"},{"issue":"2","key":"10.1016\/S0304-3975(99)00227-3_BIB11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/129630.129635","article-title":"Coordination Languages and their Significance","volume":"35","author":"Gelernter","year":"1992","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","article-title":"Transition system specifications with negative premises","volume":"118","author":"Groote","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB13","doi-asserted-by":"crossref","unstructured":"M. Hansen, J. Kleist, H. H\u00fcttel, Bisimulations for Asynchronous Mobile Processes, Technical Report, Basic Research in Computer Science, BRICS RS-96-8, 1996.","DOI":"10.7146\/brics.v3i8.19971"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB14","series-title":"Proc. ECOOP \u201991, vol. 512 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BFb0057019","article-title":"An object calculus for asynchronous communication","author":"Honda","year":"1991"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB15","unstructured":"Sun Microsystem, Inc. JavaSpaces Specification, Available at http:\/\/java.sun.com\/products\/javaspaces\/, July 1998."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB16","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB17","series-title":"Proc. ICALP\u201992, vol. 623 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","article-title":"Barbed bisimulation","author":"Milner","year":"1992"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB18","series-title":"Computation","author":"Minsky","year":"1967"},{"issue":"6","key":"10.1016\/S0304-3975(99)00227-3_BIB19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","article-title":"Contextual nets","volume":"32","author":"Montanari","year":"1995","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB20","unstructured":"J.E. Narem, An Informal Operational Semantics of C-Linda V2.3.5, Technical Report YALEU\/DCS\/TR-839, Department of Computer Science, Yale University, 1990."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB21","unstructured":"Scientific Computing Associates, Linda: User's guide and reference manual, Scientific Computing Associates, 1995."},{"key":"10.1016\/S0304-3975(99)00227-3_BIB22","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00227-3_BIB23","doi-asserted-by":"crossref","unstructured":"P. Wyckoff, S.W. McLaughry, T.J. Lehman, D.A. Ford, T. Spaces, IBM Systems Journal 37(3) (1998), Available at http:\/\/www.almaden.ibm.com\/cs\/TSpaces\/, IBM Corp. Almaden Research Center, IBM Corp.","DOI":"10.1147\/sj.373.0454"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T09:21:36Z","timestamp":1555233696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002273"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00227-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}