{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:05Z","timestamp":1745986745764,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_1","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"1-15","source":"Crossref","is-referenced-by-count":1,"title":["Compositional Reasoning for Multi-modal Logics"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Prisacariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Ingolfsdottir, A., Prisacariu, C., Sack, J.: Compositional reasoning for multi-modal logics. Technical Report 419, Department of Informatics, University of Oslo, Oslo, Norway (September 2012)","DOI":"10.1007\/978-3-642-35722-0_1"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, H.R.: Partial model checking (extended abstract). In: 10th IEEE Symposium on Logic in Computer Science (LICS 1995), pp. 398\u2013407. IEEE Computer Society (1995)","DOI":"10.1109\/LICS.1995.523274"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science 50. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195003"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/B:SYNT.0000024912.56773.5e","volume":"139","author":"A. Baltag","year":"2004","unstructured":"Baltag, A., Moss, L.S.: Logics for epistemic programs. Synthese\u00a0139(2), 165\u2013224 (2004)","journal-title":"Synthese"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/963927.963929","volume":"5","author":"B. Bloom","year":"2004","unstructured":"Bloom, B., Fokkink, W., van Glabbeek, R.J.: Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic\u00a05(1), 26\u201378 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"8","key":"1_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-46691-6_17","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I. Castellani","year":"1999","unstructured":"Castellani, I., Mukund, M., Thiagarajan, P.S.: Synthesizing Distributed Transition Systems from Global Specifications. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 219\u2013231. Springer, Heidelberg (1999)"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.tcs.2005.11.035","volume":"354","author":"W. Fokkink","year":"2006","unstructured":"Fokkink, W., van Glabbeek, R.J., de Wind, P.: Compositionality of Hennessy-Milner logic by structural operational semantics. Theoretical Computer Science\u00a0354(3), 421\u2013440 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of ACM"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Complexity of finitely presented algebras. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp. 164\u2013177. ACM (1977)","DOI":"10.1145\/800105.803406"},{"key":"1_CR13","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":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-60218-6_3","volume-title":"CONCUR \u201995 Concurrency Theory","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G.: Compositional Model Checking of Real Time Systems. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 27\u201341. Springer, Heidelberg (1995)"},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1093\/logcom\/1.6.761","volume":"1","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Xinxin, L.: Compositionality through an operational semantics of contexts. Journal of Logic and Computation\u00a01(6), 761\u2013795 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Lomuscio, A., Raimondi, F.: The complexity of model checking concurrent programs against CTLK specifications. In: Nakashima, H., Wellman, M.P., Weiss, G., Stone, P. (eds.) 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), pp. 548\u2013550. ACM (2006)","DOI":"10.1145\/1160633.1160733"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.2307\/2272123","volume":"42","author":"G.F. McNulty","year":"1977","unstructured":"McNulty, G.F.: Fragments of first order logic, I: Universal Horn logic. The Journal of Symbolic Logic\u00a042(2), 221\u2013237 (1977)","journal-title":"The Journal of Symbolic Logic"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theorethical Computer Science\u00a025, 267\u2013310 (1983)","journal-title":"Theorethical Computer Science"},{"key":"1_CR19","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/CSD.1998.657556","volume-title":"Proceedings of the 1998 International Conference on Application of Concurrency to System Design, ACSD 1998","author":"S. Mohalik","year":"1998","unstructured":"Mohalik, S., Ramanujam, R.: A presentation of regular languages in the assumption - commitment framework. In: Proceedings of the 1998 International Conference on Application of Concurrency to System Design, ACSD 1998, pp. 250\u2013260. IEEE Computer Society, Washington, DC (1998)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer (2007)","DOI":"10.1007\/978-1-4020-5839-4"},{"issue":"3-4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"397","DOI":"10.3166\/jancl.21.397-425","volume":"21","author":"J. Eijck van","year":"2011","unstructured":"van Eijck, J., Sietsma, F., Wang, Y.: Composing models. Journal of Applied Non-Classical Logics\u00a021(3-4), 397\u2013425 (2011)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-16042-6_22","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"G. Winskel","year":"1985","unstructured":"Winskel, G.: A Complete System for SCCS with Modal Assertions. In: Maheshwari, S.N. (ed.) FSTTCS 1985. LNCS, vol.\u00a0206, pp. 392\u2013410. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:34Z","timestamp":1745942434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}