{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:53Z","timestamp":1760202593983},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_15","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:27:52Z","timestamp":1252934872000},"page":"179-193","source":"Crossref","is-referenced-by-count":12,"title":["EXPTIME Tableaux for the Coalgebraic \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Corina","family":"C\u00eerstea","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-60922-9_39","volume-title":"STACS 96","author":"J.C. Bradfield","year":"1996","unstructured":"Bradfield, J.C.: On the expressivity of the modal mu-calculus. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 479\u2013490. Springer, Heidelberg (1996)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Chellas, B.: Modal Logic, Cambridge (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C., Sadrzadeh, M.: Modular Games for Coalgebraic Fixed Point Logics. In: Ad\u00e1mek, J., Kupke, C. (eds.) Coalgebraic Methods in Computer Science (CMCS 2008). ENTCS, vol.\u00a0203 (2008)","DOI":"10.1016\/j.entcs.2008.05.020"},{"key":"15_CR4","first-page":"328","volume-title":"Proc. FOCS 1988","author":"E. Emerson","year":"1988","unstructured":"Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. In: Proc. FOCS 1988, pp. 328\u2013337. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"15_CR5","first-page":"368","volume-title":"Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991)","author":"E. Emerson","year":"1991","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991), pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"E.A. Emerson","year":"1999","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM J. Comput.\u00a029(1), 132\u2013158 (1999)","journal-title":"SIAM J. Comput."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"key":"15_CR8","series-title":"ENTCS","first-page":"121","volume-title":"Coalgebraic Methods in Computer Science","author":"H.H. Hansen","year":"2004","unstructured":"Hansen, H.H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Ad\u00e1mek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a0106, pp. 121\u2013143. Elsevier, Amsterdam (2004)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"15_CR10","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 \u03bc-calculus. Theoret. Comput. Sci.\u00a027, 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM\u00a047(2), 312\u2013360 (2000)","journal-title":"Journal of the ACM"},{"key":"15_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-45620-1_34","volume-title":"Automated Deduction - CADE-18","author":"O. Kupferman","year":"2002","unstructured":"Kupferman, O., Sattler, U., Y. Vardi, M.: The complexity of the graded mgr-calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 423\u2013437. Springer, Heidelberg (2002)"},{"key":"15_CR13","unstructured":"Mostowski, A.: Games with forbidden positions. Technical Report\u00a078, Instytut Matematyki, Uniwersytet Gda\u0144ski, Poland (1991)"},{"issue":"1&2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D. Niwinski","year":"1996","unstructured":"Niwinski, D., Walukiewicz, I.: Games for the mu-calculus. Theor. Comput. Sci.\u00a0163(1&2), 99\u2013116 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Logic Comput.\u00a012(1), 149\u2013166 (2002)","journal-title":"J. Logic Comput."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11690634_11","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 157\u2013171. Springer, Heidelberg (2006)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Compl. Log.\u00a02(10) (2008) (to appear)","DOI":"10.1145\/1462179.1462185"},{"key":"15_CR18","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ic.2005.06.003","volume":"204","author":"Y. Venema","year":"2006","unstructured":"Venema, Y.: Automata and fixed point logics: a coalgebraic perspective. Inform. Comput.\u00a0204(4), 637\u2013678 (2006)","journal-title":"Inform. Comput."},{"issue":"1-2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional \u03bc-calculus. Inf. Comput.\u00a0157(1-2), 142\u2013182 (2000)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:19:20Z","timestamp":1558523960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}