{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:04:04Z","timestamp":1725494644676},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671022"},{"type":"electronic","value":"9783540465621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46562-6_22","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T00:12:56Z","timestamp":1194999176000},"page":"247-256","source":"Crossref","is-referenced-by-count":7,"title":["Compositional Verification of CCS Processes"],"prefix":"10.1007","author":[{"given":"Mads","family":"Dam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilian","family":"Gurov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,1,28]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-59293-8_196","volume-title":"Proc. CAAP\u201995","author":"R. Amadio","year":"1995","unstructured":"R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP\u201995, Lecture Notes in Computer Science, 915:202\u2013217, 1995."},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-61648-9_50","volume-title":"Proc. FTRTFT\u201996","author":"R. Amadio","year":"1996","unstructured":"R. Amadio and M. Dam. A modal theory of types for the \u03c0-calculus. In Proc. FTRTFT\u201996, Lecture Notes in Computer Science, 1135:347\u2013365, 1996."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/inco.1997.2680","volume":"140","author":"M. Dam","year":"1998","unstructured":"M. Dam. Proving properties of dynamic process networks. Information and Computation, 140:95\u2013114, 1998.","journal-title":"Information and Computation"},{"key":"22_CR4","unstructured":"M. Dam, L.-\u00e5. Fredlund, and D. Gurov. Toward parametric verification of open distributed systems. In Compositionality: the Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Lecture Notes Notes in Computer Science, Springer-Verlag, 1536:150\u2013185, 1998."},{"key":"22_CR5","unstructured":"M. Dam and D. Gurov. \u00b5-calculus with explicit points and approximations. In preparation, 1999."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137\u2013162, 1985.","journal-title":"Journal of the ACM"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u00b5-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International, 1989."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"A. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 420\u2013430, San Diego, California, 26\u201329 1995. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1995.523276"},{"key":"22_CR10","doi-asserted-by":"publisher","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"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","volume":"89","author":"C. Stirling","year":"1991","unstructured":"C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161\u2013177, 1991.","journal-title":"Theoretical Computer Science"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72\u201399, 1983.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46562-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:29:13Z","timestamp":1551094153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46562-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671022","9783540465621"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46562-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}