{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T05:05:15Z","timestamp":1733461515348,"version":"3.30.1"},"reference-count":47,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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,3]]},"DOI":"10.1016\/s0304-3975(00)00281-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:16Z","timestamp":1027627276000},"page":"557-589","source":"Crossref","is-referenced-by-count":1,"title":["A fully abstract denotational semantics for the calculus of higher-order communicating systems"],"prefix":"10.1016","volume":"254","author":[{"given":"B.","family":"Thomsen","sequence":"first","affiliation":[]},{"given":"S.","family":"Abramsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00281-4_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"10.1016\/S0304-3975(00)00281-4_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A domain equation for bisimulation","volume":"92","author":"Abramsky","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","article-title":"Proofs as processes","volume":"135","author":"Abramsky","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB5","unstructured":"S. Abramsky, A game semantics for Idealized Algol, unpublished lecture, 1995."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB6","series-title":"A Classical Mind","first-page":"1","article-title":"Interaction categories and communicating sequential processes","author":"Abramsky","year":"1995"},{"year":"1996","series-title":"Semantics of interaction","author":"Abramsky","key":"10.1016\/S0304-3975(00)00281-4_BIB7"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB8","doi-asserted-by":"crossref","unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF, Inform. Comput. (2000) to appear.","DOI":"10.1006\/inco.2000.2930"},{"year":"1984","series-title":"The Lambda Calculus \u2014 Its Syntax and Semantics","author":"Barendregt","key":"10.1016\/S0304-3975(00)00281-4_BIB9"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB10","first-page":"149","volume":"vol. 351","author":"Boudol","year":"1989"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB11","unstructured":"P. Christensen, The domain of CSP processes, incomplete draft, The Technical University of Denmark, 1988."},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0019-9958(81)90082-6","article-title":"A term model for synchronous processes","volume":"51","author":"Hennessy","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB13","doi-asserted-by":"crossref","unstructured":"M. Hennessy, A fully abstract denotational model for higher-order processes (extended abstract), Proc., 8th Annu. IEEE Symp. on Logic in Computer Science, Montreal, Canada, 19\u201323, June 1993, pp. 397\u2013408.","DOI":"10.1109\/LICS.1993.287568"},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/inco.1994.1052","article-title":"A fully abstract denotational model for higher-order processes","volume":"112","author":"Hennessy","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB15","first-page":"286","volume":"vol. 820","author":"Hennessy","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB17","first-page":"261","volume":"vol. 88","author":"Hennessy","year":"1980"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB18","doi-asserted-by":"crossref","unstructured":"M. Hyland, C.H.L. Ong, On full abstraction for PCF, Inform. and Comput. (2000) to appear.","DOI":"10.1006\/inco.2000.2917"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB19","unstructured":"A. Ing\u00f3lfsd\u00f3ttir, B. Thomsen, Semantic models for CCS with values, Proc. Chalmers Workshop on Concurrency, May 1991."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB20","doi-asserted-by":"crossref","unstructured":"R. Jagadeesan, P. Panangaden, A domain-theoretic model for a higher-order process calculus, Proc. ICALP 90, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 181\u2013194.","DOI":"10.1007\/BFb0032031"},{"year":"1988","series-title":"A denotational semantics for first class processes","author":"Kennaway","key":"10.1016\/S0304-3975(00)00281-4_BIB21"},{"issue":"2","key":"10.1016\/S0304-3975(00)00281-4_BIB22","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/322123.322134","article-title":"Concurrent processes and their syntax","volume":"26","author":"Milne","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB23","series-title":"Processes","first-page":"157","author":"Milner","year":"1975"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB24","article-title":"A Calculus of Communicating Systems","volume":"vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB25","first-page":"25","volume":"vol. 112","author":"Milner","year":"1981"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S0304-3975(00)00281-4_BIB27"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB28","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)00281-4_BIB29","article-title":"Concurrency and Automata on Infinite Sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB30","first-page":"122","volume":"Vol. 711","author":"Pitts","year":"1993"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB31","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB32","unstructured":"G. Plotkin, A structural approach to operational semantics, Technical Rep. DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB33","unstructured":"G. Plotkin, Post-graduate notes in advanced domain theory (incorporating the \u201cPisa Notes\u201d), Department of Computer Science, University of Edinburgh, 1981."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB34","first-page":"360","volume":"vol. 140","author":"Plotkin","year":"1982"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB35","first-page":"151","volume":"vol. 668","author":"Sangiorgi","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB36","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. Systems Sci."},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB37","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01806033","article-title":"categorical models for local names","volume":"9","author":"Stark","year":"1996","journal-title":"Lisp Symbolic Comput."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB38","series-title":"A fully abstract domain model for the Pi-calculus, Proc. 11th Annu. IEEE Symp. on Logic in Computer Science","first-page":"36","author":"Stark","year":"1996"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB39","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","article-title":"Modal logics for communicating systems","volume":"49","author":"Stirling","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB40","doi-asserted-by":"crossref","unstructured":"A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285\u2013309.","DOI":"10.2140\/pjm.1955.5.285"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB41","doi-asserted-by":"crossref","unstructured":"B. Thomsen, A calculus of higher-order communicating systems, Proc. POPL 89, The Association for Computing Machinery, New York, 1989, pp. 143\u2013154.","DOI":"10.1145\/75277.75290"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB42","unstructured":"B. Thomsen, Calculi for higher-order communicating systems, Ph.D. Thesis, Imperial College, London University, 1990."},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","article-title":"Plain CHOCS. A second generation higher-order calculus for higher-order processes","volume":"30","author":"Thomsen","year":"1993","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/S0304-3975(00)00281-4_BIB44","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1004","article-title":"A theory of higher-order communicating systems","volume":"116","author":"Thomsen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00281-4_BIB45","series-title":"Bisimulation and divergence, Proc. LICS 88","first-page":"186","author":"Walker","year":"1988"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB46","first-page":"392","volume":"vol. 206","author":"Winskel","year":"1985"},{"key":"10.1016\/S0304-3975(00)00281-4_BIB47","article-title":"A linear metalanguage for concurrency","volume":"vol. 1548","author":"Winskel","year":"1999"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002814?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002814?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:50:27Z","timestamp":1733377827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397500002814"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00281-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}