{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:13Z","timestamp":1725663253425},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156703"},{"type":"electronic","value":"9783540395935"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15670-4_10","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:22:50Z","timestamp":1330194170000},"page":"197-220","source":"Crossref","is-referenced-by-count":28,"title":["Lectures on a calculus for communicating systems"],"prefix":"10.1007","author":[{"given":"Robin","family":"Milner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Costa, G. and Stirling, C. (1983). A Fair Calculus of Communicating Systems. Vol. 154, Lecture Notes in Computer Science, Springer-Verlag, pp. 97\u2013108.","DOI":"10.1007\/3-540-12689-9_96"},{"key":"10_CR2","unstructured":"Hennessy, M. and Milner R. (1983). Algebraice Laws for Nondeterminism and Concurrency. Technical Report CSR-133-83, Computer Science Dept, University of Edinburgh."},{"key":"10_CR3","unstructured":"Hennessy, M. and Stirling, C. (1983). The Power of the Future Perfect in Program Logics. Technical Report CSR-156-83, Computer Science Dept, University of Edinburgh."},{"key":"10_CR4","unstructured":"Hoare, C.A.R., Brookes, S.D. and Roscoe, A.D. (1981). A Theory of Communicating Sequential Processes, Technical Monograph PRG-16, Computing Laboratory, University of Oxford."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Milner, R. (1980). A Calculus of Communicating Systems. Vol. 92, Lecture Notes in Computer Science, Springer-Verlag.","DOI":"10.1007\/3-540-10235-3"},{"key":"10_CR6","unstructured":"Milner, R. (1982a). A Complete Inference System for a Class of Regular Behaviours. Technical Report CSR-111-82, Computer Science Dept, University of Edinburgh. (To appear in Journal of Computer and Systems Sciences.)"},{"key":"10_CR7","unstructured":"Milner, R. (1982b). A Finite Delay Operator in Synchronous CCS. Technical Report CSR-116-82, Computer Science Dept, University of Edinburgh."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R. (1983). Calculi for Synchrony and Asynchrony. J. Theoretical Computer Science, Vol. 25, pp. 267\u2013310.","journal-title":"J. Theoretical Computer Science"},{"key":"10_CR9","unstructured":"de Nicola, R. and Hennessy, M. (1982). Testing Equivalences for Processes. Technical Report CSR-123-82, Computer Science Dept, University of Edinburgh."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Park, D. (1981). Concurrency and Automata on Infinite Sequences. In Vol. 104, Lecture Notes in Computer Science, Springer-Verlag.","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Seminar on Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15670-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:05Z","timestamp":1619557205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15670-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156703","9783540395935"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-15670-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}