{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:40Z","timestamp":1725664720735},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613770"},{"type":"electronic","value":"9783540685074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:46Z","timestamp":1330292146000},"page":"335-361","source":"Crossref","is-referenced-by-count":0,"title":["A fully abstract denotational model for observational precongruence"],"prefix":"10.1007","author":[{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schalk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161\u2013218, 1991.","journal-title":"Information and Computation"},{"issue":"1","key":"20_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L. Aceto","year":"1992","unstructured":"L. Aceto and M. Hennessy. Termination, deadlock and divergence. Journal of the ACM, 39(1):147\u2013187, January 1992.","journal-title":"Journal of the ACM"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science. Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"I. Guessarian. Algebraic Semantics, volume 99 of Lecture Notes in Computer Science. Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10284-1"},{"issue":"1","key":"20_CR5","first-page":"58","volume":"51","author":"M. Hennessy","year":"1981","unstructured":"M. Hennessy. A term model for synchronous processes. Information and Computation, 51(1):58\u201375, 1981.","journal-title":"Information and Computation"},{"issue":"4","key":"20_CR6","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy. Acceptance trees. Journal of the ACM, 32(4):896\u2013928, 1985.","journal-title":"Journal of the ACM"},{"key":"20_CR7","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Massachusetts, 1988."},{"issue":"5","key":"20_CR8","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1137\/0217063","volume":"17","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal on Computing, 17(5):997\u20131017, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"20_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"R.M. Keller. Formal verification of parallel programs. Communications of the ACM, 19(7):371\u2013384, 1976.","journal-title":"Communications of the ACM"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. Modal characterisation of observable machine behaviour. In G. Astesiano and C. Bohm, editors, Proceedings CAAP 81, volume 112 of Lecture Notes in Computer Science, pages 25\u201334. Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10828-9_52"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"20_CR13","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"D.M.R, Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"20_CR15","unstructured":"G.D. Plotkin. Lecture notes in domain theory, 1981. University of Edinburgh."},{"key":"20_CR16","unstructured":"D.S. Scott and C. Strachey. Towards a mathematical semantics for computer languages. In Proceedings of the Symposium on Computers and Automata, volume 21 of Microwave Research Institute Symposia Series, 1971."},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311\u2013347, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"20_CR18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","volume":"85","author":"D.J. Walker","year":"1990","unstructured":"D.J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202\u2013241, 1990.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:27:22Z","timestamp":1713634042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}