{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:15Z","timestamp":1725456975351},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032033","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"209-219","source":"Crossref","is-referenced-by-count":5,"title":["A theory of communicating processes with value-passing"],"prefix":"10.1007","author":[{"given":"M.","family":"Hennessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"73","volume-title":"A Tutorial on LOTOS","author":"E. Brinksma","year":"1986","unstructured":"Brinksma, E. \u201cA Tutorial on LOTOS.\u201d Proceedings of IFIP Workshop on Protocol Specification, Testing and Verification V, M. Diaz, ed., pp. 73\u201384. North-Holland, Amsterdam, 1986."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"24","author":"R. DeNicola","year":"1984","unstructured":"DeNicola, R. and M. Hennessy. \u201cTesting Equivalences for Processes.\u201d Theoretical Computer Science, 24, 1984, pp. 83\u2013113.","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Guessarian, I., \u201cAlgebraic Semantics\u201d, Springer-Verlag Lecture Notes in Computer Science, vol.99, 1981.","DOI":"10.1007\/3-540-10284-1"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Hennessy, M. and Plotkin, G., \u201cA Term Model for CCS\u201d, Springer-Verlag Lecture Notes in Computer Science, vol.88, 1980.","DOI":"10.1007\/BFb0022510"},{"issue":"4","key":"17_CR5","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M. \u201cAcceptance Trees.\u201d Journal of the ACM, v. 32, n. 4, October 1985, pp. 896\u2013928.","journal-title":"Journal of the ACM"},{"key":"17_CR6","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M. Algebraic Theory of Processes. MIT Press, Cambridge, 1988."},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-52048-1_54","volume":"405","author":"M. Hennessy","year":"1989","unstructured":"Hennessy, M., \u201cA Proof System for Communicating Processes With Value \u2014 Passing\u201d. Proceedings of Foundation of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, Springer-Verlag, Lecture Notes in Computer Science, vol 405, pp 325\u2013339, 1989.","journal-title":"Lecture Notes in Computer Science"},{"key":"17_CR8","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall International, London, 1985."},{"key":"17_CR9","unstructured":"Hoare, C.A.R. and Roscoe, A.W., \u201cThe Laws of Occam\u201d PRG Monograph, Oxford University, 1986."},{"key":"17_CR10","volume-title":"The Occam Programming Manual","author":"Inmos Ltd.","year":"1984","unstructured":"Inmos Ltd., The Occam Programming Manual, Prentice-Hall, London, 1984."},{"key":"17_CR11","unstructured":"Milne, R., \u201cConcurrency Models and Axioms\u201d, RAISE\/STC\/REM\/6\/V2, STC Technology Ltd., 1988."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R. A Calculus of Communicating Systems, Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980."},{"key":"17_CR13","volume-title":"Calculus for Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R., Calculus for Communication and Concurrency, Prentice-Hall, London 1989."},{"key":"17_CR14","unstructured":"Plotkin, G., \u201cLecture Notes in Domain Theory\u201d, University of Edinburgh, 1981."},{"key":"17_CR15","unstructured":"Roscoe, A.W., \u201cDenotational Semantics for Occam\u201d, PRG Monograph, Oxford University, 1988."},{"key":"17_CR16","unstructured":"Schmidt, D., Denotational Semantics, Allen and Bacon, 1986."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Smyth, M. and Plotkin, G., \u201dThe Category-Theoretic Solution of Recursive Domain Equations\u201d, SIAM Journal on Computing, vol.11, No.4, 1982.","DOI":"10.1137\/0211062"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032033.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:33Z","timestamp":1607551533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0032033","relation":{},"subject":[]}}