{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:01:27Z","timestamp":1759147287123},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229407"},{"type":"electronic","value":"9783540286448"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_17","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"258-275","source":"Crossref","is-referenced-by-count":17,"title":["Modular Construction of Modal Logics"],"prefix":"10.1007","author":[{"given":"Corina","family":"C\u00eerstea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389. Springer, Heidelberg (1989)"},{"key":"17_CR2","unstructured":"Bartels, F.: On generalised coinduction and probabilistic specification formats. PhD thesis, CWI, Amsterdam (2004)"},{"key":"17_CR3","series-title":"ENTCS","volume-title":"Proc. CMCS 2003","author":"F. Bartels","year":"2003","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. In: Gumm, H.P. (ed.) Proc. CMCS 2003. ENTCS, vol.\u00a082. Elsevier, Amsterdam (2003)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-59851-7_11","volume-title":"Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Reports","author":"M. Bidoit","year":"1999","unstructured":"Bidoit, M., Cengarle, M.V., Hennicker, R.: Proof systems for structured specifications and their refinements. In: Kreowski, H.J., Astesiano, E., Krieg-Br\u00fcckner, B. (eds.) Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Reports, pp. 385\u2013434. Springer, Heidelberg (1999)"},{"key":"17_CR5","volume-title":"Modal Logic","author":"P. Blackburn","year":"2000","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2000)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(01)00317-6","volume":"286","author":"T. Borzyszkowski","year":"2002","unstructured":"Borzyszkowski, T.: Logical systems for structured specifications. Theoret. Comput. Sci.\u00a0286(2), 197\u2013245 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR7","unstructured":"Caleiro, C.: Combining Logics. PhD thesis (2002)"},{"key":"17_CR8","series-title":"ENTCS","volume-title":"Proc. CMCS 2003","author":"C. C\u00eerstea","year":"2003","unstructured":"C\u00eerstea, C.: On expressivity and compositionality in logics for coalgebras. In: Gumm, H.P. (ed.) Proc. CMCS 2003. ENTCS, vol.\u00a082. Elsevier, Amsterdam (2003)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E. Clarke","year":"1982","unstructured":"Clarke, E., Emerson, E.: Synthesis of synchronisation skeletons for branching temporal logics. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131. Springer, Heidelberg (1982)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E. Vink de","year":"1999","unstructured":"de Vink, E., Rutten, J.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci.\u00a0221, 271\u2013293 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198503811.001.0001","volume-title":"Fibring Logics","author":"D. Gabbay","year":"1998","unstructured":"Gabbay, D.: Fibring Logics. Oxford University Press, Oxford (1998)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1006\/game.1999.0788","volume":"35","author":"A. Heifetz","year":"2001","unstructured":"Heifetz, A., Mongin, P.: Probability logic for type spaces. Games and Economic Behaviour\u00a035, 31\u201353 (2001)","journal-title":"Games and Economic Behaviour"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1051\/ita:2001108","volume":"35","author":"B. Jacobs","year":"2001","unstructured":"Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. Theor. Inform. Appl.\u00a035(1), 31\u201359 (2001)","journal-title":"Theor. Inform. Appl."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/3-540-45465-9_45","volume-title":"Automata, Languages and Programming","author":"M. Kick","year":"2002","unstructured":"Kick, M.: Bialgebraic modelling of timed processes. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 525. Springer, Heidelberg (2002)"},{"key":"17_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. Theoret. Comput. Sci.\u00a027, 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"17_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(00)00125-0","volume":"260","author":"A. Kurz","year":"2001","unstructured":"Kurz, A.: Specifying Coalgebras with Modal Logic. Theoret. Comput. Sci.\u00a0260(1\u20132), 119\u2013138 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR17","series-title":"ENTCS","volume-title":"Proc. CMCS 2002","author":"A. Kurz","year":"2002","unstructured":"Kurz, A., Pattinson, D.: Definability, canonical models, and compactness for finitary coalgebraic modal logic. In: Moss, L.S. (ed.) Proc. CMCS 2002. ENTCS, vol.\u00a065. Elsevier, Amsterdam (2002)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inform. and Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inform. and Comput."},{"key":"17_CR19","series-title":"International series in computer science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International series in computer science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L.S. Moss","year":"1999","unstructured":"Moss, L.S.: Coalgebraic logic. Ann. Pure Appl. Logic\u00a096, 277\u2013317 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"volume-title":"Software Engineering: Report of a conference sponsored by the NATO Science Committee","year":"1969","key":"17_CR21","unstructured":"Naur, P., Randell, B. (eds.): Software Engineering: Report of a conference sponsored by the NATO Science Committee, Garmisch, Germany, 7-11 October 1968. Scientific Affairs Division, NATO (1969)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104. Springer, Heidelberg (1981)"},{"issue":"1\u20133","key":"17_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D. Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci.\u00a0309(1\u20133), 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic (to appear, 2004)","DOI":"10.1305\/ndjfl\/1094155277"},{"key":"17_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(00)00128-6","volume":"260","author":"M. R\u00f6\u00dfiger","year":"2001","unstructured":"R\u00f6\u00dfiger, M.: From Modal Logic to Terminal Coalgebras. Theoret. Comput. Sci.\u00a0260, 209\u2013228 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: A theory of systems. Theoret. Comput. Sci.\u00a0249, 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR28","unstructured":"Segala, R.: Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)"},{"key":"17_CR29","first-page":"280","volume-title":"Proc. 12th LICS Conference","author":"D. Turi","year":"1999","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proc. 12th LICS Conference, pp. 280\u2013291. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"17_CR30","volume-title":"Handbook of Theoretical Computer Science","author":"M. Wirsing","year":"1990","unstructured":"Wirsing, M.: Algebraic specification. In: van Leuween, J. (ed.) Handbook of Theoretical Computer Science. Elsevier, Amsterdam (1990)"},{"key":"17_CR31","unstructured":"Worrell, J.: On the Final Sequence of an Accessible Set Functor. Theoret. Comput. Sci. (to appear, 2003)"},{"issue":"1","key":"17_CR32","doi-asserted-by":"publisher","first-page":"414","DOI":"10.2307\/2694931","volume":"66","author":"A. Zanardo","year":"2001","unstructured":"Zanardo, A., Sernadas, A., Sernadas, C.: Fibring: Completeness preservation. J. Symbolic Logic\u00a066(1), 414\u2013439 (2001)","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T13:12:06Z","timestamp":1711285926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}