{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:41Z","timestamp":1760202521298},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032056","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"526-539","source":"Crossref","is-referenced-by-count":41,"title":["Compositionality through an operational semantics of contexts"],"prefix":"10.1007","author":[{"given":"Kim G.","family":"Larsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Xinxin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20, 1983.","DOI":"10.1007\/BF01257083"},{"key":"40_CR2","volume-title":"Fra Hennessy-Milner Logik til CCS-processer","author":"J.C. Godskesen","year":"1987","unstructured":"J.C. Godskesen, A. Ingolfsdottir, and M. Zeeberg. Fra Hennessy-Milner Logik til CCS-processer. PhD thesis, Aalborg University Center, Denmark, 1987."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137\u2013161, 1985.","DOI":"10.1145\/2455.2460"},{"key":"40_CR4","unstructured":"S. Holmstr\u00f6m. Reasoning about CCS agents using Hennessy-Milner logic extended with fixed points. BCS\u2014FACS Workshop on Specification and Verification of Concurrent Systems, 1987."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"D. Kozen. Results on the propositional mu-calculus. Lecture Notes in Computer Science, 140, 1982. in Proc. of ICALP'82.","DOI":"10.1007\/BFb0012782"},{"key":"40_CR6","volume-title":"Context-Dependent Bisimulation Between Processes","author":"K.G. Larsen","year":"1986","unstructured":"K.G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Mayfield Road, Edinburgh, Scotland, 1986."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"K.G. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lecture Notes in Computer Science, 299, 1988. in Proc. of CAAP'88. Full version to appear in Theoretical Computer Science.","DOI":"10.1007\/BFb0026106"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"K.G. Larsen and R. Milner. Verifying a protocol using relativized bisimulation. Lecture Notes in Computer Science, 267, 1987. in Proc. of ICALP'87.","DOI":"10.1007\/3-540-18088-5_11"},{"key":"40_CR9","unstructured":"K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Technical Report R 89-13, Aalborg University, Department of Mathematics and Computer Science, 1989."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 104, 1981. in Proc. of 5th GI Conf.","DOI":"10.1007\/BFb0017309"},{"key":"40_CR13","volume-title":"A structural approach to operational semantics","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. FN 19, DAIMI, Aarhus University, Denmark, 1981."},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Lecture Notes in Computer Science, 194, 1985. in Proc. of ICALP'87.","DOI":"10.1007\/BFb0015727"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"C. Stirling. A compositional modal proof system for a subset of ccs. Lecture Notes in Computer Science, 194, 1986.","DOI":"10.1007\/3-540-15198-2_16"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Lecture Notes in Computer Science, 352, 1989. In Proc. of Tapsoft'89.","DOI":"10.1007\/3-540-50939-9_144"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"G. Winskel. On the composition and decomposition of assertions. Lecture Notes in Computer Science, 197, 1984.","DOI":"10.1007\/3-540-15670-4_3"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"G. Winskel. Model checking the modal nu-calculus. Lecture Notes in Computer Science, 372, 1989. In Proc. of ICALP'89.","DOI":"10.1007\/BFb0035797"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:23Z","timestamp":1586612723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0032056","relation":{},"subject":[]}}