{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T11:51:14Z","timestamp":1660305074439},"reference-count":18,"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(99)00117-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:01:16Z","timestamp":1027612876000},"page":"35-61","source":"Crossref","is-referenced-by-count":2,"title":["A fully abstract denotational model for observational precongruence"],"prefix":"10.1016","volume":"254","author":[{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Schalk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00117-6_BIB1","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. Comput."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB2","series-title":"Domain theory, Handbook of Logic in Computer Science","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/147508.147527","article-title":"Termination, deadlock and divergence","volume":"39(1)","author":"Aceto","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB4","doi-asserted-by":"crossref","unstructured":"I. Guessarian, Algebraic Semantics, vol. 99, Lecture Notes in Computer Science, Springer, Berlin, 1981.","DOI":"10.1007\/3-540-10284-1"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB5","first-page":"58","article-title":"A term model for synchronous processes","volume":"51(1)","author":"Hennessy","year":"1981","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB6","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"32(4)","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB7","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB8","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1137\/0217063","article-title":"Axiomatising finite concurrent processes","volume":"17(5)","author":"Hennessy","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19(7)","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB10","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, vol. 92, Lecture Notes in Computer Science, Springer, Berlin, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB11","doi-asserted-by":"crossref","unstructured":"R. Milner, Modal characterisation of observable machine behaviour, in: G. Astesiano, C. Bohm (Eds), Proce. CAAP 81, vol. 112, Lecture Notes in Computer Science, Springer, Berlin, 1981, pp. 25\u201334.","DOI":"10.1007\/3-540-10828-9_52"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB12","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."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB13","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB14","doi-asserted-by":"crossref","unstructured":"D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), 5th GI Conf., vol. 104, Lecture Notes in Computer Science, Springer, Berlin, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB15","unstructured":"G.D. Plotkin, Lecture Notes in Domain Theory, University of Edinburgh, 1981."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB16","unstructured":"D.S. Scott, C. Strachey, Towards a mathematical semantics for computer languages, Proc. Symp. on Computers and Automata, vol. 21, Microwave Research Institute Symposia Series, 1971."},{"key":"10.1016\/S0304-3975(99)00117-6_BIB17","first-page":"1987","volume":"Theoret. Comput. Sci.","author":"Stirling","journal-title":"Modal logics for communicating systems"},{"key":"10.1016\/S0304-3975(99)00117-6_BIB18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","article-title":"Bisimulation and divergence","volume":"85(2)","author":"Walker","year":"1990","journal-title":"Inform. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T21:00:00Z","timestamp":1555880400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001176"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00117-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}