{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:08:27Z","timestamp":1777889307232,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405245","type":"print"},{"value":"9783540450696","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45069-6_7","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:11:46Z","timestamp":1277241106000},"page":"80-92","source":"Crossref","is-referenced-by-count":44,"title":["Fast Mu-Calculus Model Checking when Tree-Width Is Bounded"],"prefix":"10.1007","author":[{"given":"Jan","family":"Obdr\u017e\u00e1lek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"7_CR2","first-page":"193","volume-title":"Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pp. 193\u2013242. Elsevier, Amsterdam (1990)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinancy. In: Proc. 5th IEE Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"7_CR4","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.S., Sistla, A.P.: On model-checking for fragments of mu-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"7_CR5","first-page":"267","volume-title":"Symposion on Logic in Computer Science","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional \u03bc\u2013calculus. In: Symposion on Logic in Computer Science, pp. 267\u2013278. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"7_CR6","first-page":"215","volume-title":"LICS 2002","author":"M. Frick","year":"2002","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. In: LICS 2002, pp. 215\u2013224. IEEE Computer Society, Los Alamitos (2002)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45643-0_7","volume-title":"Algorithm Engineering and Experiments","author":"J. Gustedt","year":"2002","unstructured":"Gustedt, J., M\u00e6hle, O., Telle, J.A.: The treewidth of Java programs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, p. 86. Springer, Heidelberg (2002)"},{"key":"7_CR8","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":"7_CR9","doi-asserted-by":"crossref","unstructured":"Kloks, T. (ed.): Treewidth \u2013 computations and approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0045375"},{"key":"7_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. Theoretical Computer Science (TCS)\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-58179-0_66","volume-title":"Computer Aided Verification","author":"D.E. Long","year":"1994","unstructured":"Long, D.E., Browne, A., Clarke, E.M., Jha, S., Marrero, W.R.: An improved algorithm for the evaluation of fixpoint expressions. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 338\u2013350. Springer, Heidelberg (1994)"},{"key":"7_CR12","volume-title":"Verification of Modal Properties Using Boolean Equation Systems","author":"A. Mader","year":"1997","unstructured":"Mader, A.: Verification of Modal Properties Using Boolean Equation Systems, 8th edn. Bertz Verlag, Berlin (1997)","edition":"8"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Obdr\u017e\u00e1lek, J.: Fast mu-calculus model checking when tree-width is bounded. Technical report, LFCS (July 2003), http:\/\/www.dcs.ed.ac.uk\/home\/s0128832","DOI":"10.1007\/978-3-540-45069-6_7"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B\u00a036, 49\u201363 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local model checking games. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"7_CR16","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","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":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M. Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree-width and good register allocation. Information and Computation\u00a0142(2), 159\u2013181 (1998)","journal-title":"Information and Computation"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J. V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzi\u0144ski, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45069-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T04:59:35Z","timestamp":1740200375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45069-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405245","9783540450696"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45069-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}