{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:33Z","timestamp":1725550653671},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_9","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:04:06Z","timestamp":1129802646000},"page":"136-150","source":"Crossref","is-referenced-by-count":2,"title":["Compositionality of Fixpoint Logic with Chop"],"prefix":"10.1007","author":[{"given":"Naijun","family":"Zhan","sequence":"first","affiliation":[]},{"given":"Jinzhao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L. Aceto","year":"1992","unstructured":"Aceto, L., Hennessy, M.: Termination, deadlock, and divergence. Journal of ACM\u00a039(1), 147\u2013187 (1992)","journal-title":"Journal of ACM"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, H.R., Stirling, C., Winskel, G.: A compositional proof system for the modal mu-Calculus. In: LICS 1994, pp. 144\u2013153 (1994)","DOI":"10.7146\/brics.v1i34.21609"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barringer, H., Kuiper, R., Pnueli, A.: Now you compose temporal logic specifications. In: Proc. 16 th STOC, may 1984, pp. 51\u201363 (1984)","DOI":"10.1145\/800057.808665"},{"key":"9_CR4","unstructured":"Barringer, H., Kuiper, R., Pnueli, A.: A compositional temporal approach to a CSP-like language. In: Proc. IFIP conference, The Role of Abstract Models in Information Processing, pp. 207\u2013227 (1985)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communication processes with abstraction. Theoretical Computer Science\u00a037, 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A., Halpern, J., Meyer, A., Parikh, R.: Equations between regular terms and an application to process logic. In: Proc. 13 th STOC, pp. 384\u2013390 (1981)","DOI":"10.1145\/800076.802493"},{"key":"9_CR7","unstructured":"Dutertre, B.: On first order interval logic. In: LICS 1995, pp. 36\u201343 (1995)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus, and determinacy. In: Proc. 33 rd FOCS, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(86)80031-6","volume":"68","author":"S. Graf","year":"1986","unstructured":"Graf, S., Sifakis, J.: A modal characterization of observational congruence on finite terms of CCS. Information and Control\u00a068, 125\u2013145 (1986)","journal-title":"Information and Control"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/S0019-9958(86)80038-9","volume":"68","author":"S. Graf","year":"1986","unstructured":"Graf, S., Sifakis, J.: A logic for the description of non-deterministic programs and their properties. Information and Control\u00a068, 254\u2013270 (1986)","journal-title":"Information and Control"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0036915","volume-title":"Automata, Languages and Programming","author":"J. Halpern","year":"1983","unstructured":"Halpern, J., Moskowski, B., Manna, Z.: A hardware semantics based on temporal intervals. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 278\u2013291. Springer, Heidelberg (1983)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Parikh, R.: Process Logic: Expressiveness, decidability, completeness. In: IEEE FOCS 1980, pp. 129\u2013142 (1980)","DOI":"10.1109\/SFCS.1980.35"},{"key":"9_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional \u03bc-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45931-6_18","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Lange","year":"2002","unstructured":"Lange, M., Stirling, C.: Model checking fixed point logic with chop. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 250\u2013263. Springer, Heidelberg (2002)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-45694-5_17","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M. Lange","year":"2002","unstructured":"Lange, M.: Local model checking games for fixed point logic with chop. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 240\u2013254. Springer, Heidelberg (2002)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: The proc. of LICS 1988, pp. 203\u2013210 (1988)","DOI":"10.1109\/LICS.1988.5119"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/BFb0032056","volume-title":"Automata, Languages and Programming","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G., Liu, X.X.: Compositionality through an operational semantics of contexts. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 526\u2013539. Springer, Heidelberg (1990)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Liu, X.X.: Equation solving using modal transition systems. In: LICS 1990, pp. 108\u2013107 (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-49116-3_48","volume-title":"STACS 99","author":"M. M\u00fcller-Olm","year":"1999","unstructured":"M\u00fcller-Olm, M.: A modal fixpoint logic with chop. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 510\u2013520. Springer, Heidelberg (1999)"},{"key":"9_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18 th STOC, pp. 232\u2013239 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR24","unstructured":"Rosner, R., Pnueli, A.: A choppy logic. In: The proc. of LICS 1986, pp. 306\u2013313 (1986)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B. Steffen","year":"1994","unstructured":"Steffen, B., Ing\u00f3lfsd\u00f3ttir, A.: Characteristic formulae for processes with divergence. Information and Computation\u00a0110, 149\u2013163 (1994)","journal-title":"Information and Computation"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/3-540-48224-5_68","volume-title":"Automata, Languages and Programming","author":"M. Viswanathan","year":"2001","unstructured":"Viswanathan, M., Viswanathan, R.: Foundations for circular compositional reasoning. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 835\u2013847. Springer, Heidelberg (2001)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Zhan, N.: Compositional properties of sequential processes. In: The proc. of SVV 2003. ENTCS, vol.\u00a0118, pp. 111\u2013128 (2005)","DOI":"10.1016\/j.entcs.2004.12.018"},{"issue":"5","key":"9_CR28","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"C.C. Zhou","year":"1991","unstructured":"Zhou, C.C., Hoare, C.A.R., Ravn, A.: A calculus of durations. Information Processing Letters\u00a040(5), 269\u2013276 (1991)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T07:08:07Z","timestamp":1586502487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11560647_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}