{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T02:18:12Z","timestamp":1766888292773},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027154"},{"type":"electronic","value":"9783642027161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02716-1_17","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T04:22:21Z","timestamp":1246335741000},"page":"220-234","source":"Crossref","is-referenced-by-count":17,"title":["A Tableau System for the Modal \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Natthapong","family":"Jungteerapanich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/S1570-2464(07)80015-2","volume-title":"Handbook of Modal Logic","author":"J. Bradfield","year":"2007","unstructured":"Bradfield, J., Stirling, C.: Modal Mu-Calculi. In: Handbook of Modal Logic, pp. 721\u2013756. Elsevier, Amsterdam (2007)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. In: Proc. 29th FOCS, pp. 328\u2013337 (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C., Sistla, A.P.: On model-checking for fragments of \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"17_CR4","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."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-12896-4_370","volume-title":"Logics of Programs","author":"D. Kozen","year":"1984","unstructured":"Kozen, D., Parikh, R.: A decision procedure for the propositional \u03bc-calculus. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 313\u2013325. Springer, Heidelberg (1984)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of ACM\u00a047, 312\u2013360 (2000)","journal-title":"Journal of ACM"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D. Niwi\u0144ski","year":"1997","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Games for the \u03bc-calculus. Theoret. Comput. Sci.\u00a0163, 99\u2013116 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Tran. AMS\u00a0141, 1\u201335 (1969)","journal-title":"Tran. AMS"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. 29th FOCS, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R.S. Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation\u00a081, 249\u2013264 (1989)","journal-title":"Information and Computation"},{"key":"17_CR11","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2000","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Springer, Heidelberg (2000)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","volume":"89","author":"C. Stirling","year":"1991","unstructured":"Stirling, C., Walker, D.: Local model checking in the modal mu-calculus. Theoret. Comput. Sci.\u00a089, 161\u2013177 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR13","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 axiomatization of the propositional \u03bc-calculus. Information and Computation\u00a0157, 142\u2013182 (2000)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02716-1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T10:55:52Z","timestamp":1619780152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02716-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027154","9783642027161"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02716-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}