{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:45:21Z","timestamp":1743036321567,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"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-02930-1_19","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"223-234","source":"Crossref","is-referenced-by-count":13,"title":["Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"C. -H. Luke","family":"Ong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"81","volume-title":"LICS 2006","author":"C.-H.L. Ong","year":"2006","unstructured":"Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81\u201390. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 416\u2013428 (2009)","DOI":"10.1145\/1594834.1480933"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/1057387.1057390","volume":"27","author":"A. Igarashi","year":"2005","unstructured":"Igarashi, A., Kobayashi, N.: Resource usage analysis. ACM Transactions on Programming Languages and Systems\u00a027(2), 264\u2013313 (2005)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Aehlig, K.: A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science 3(3) (2007)","DOI":"10.2168\/LMCS-3(3:1)2007"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(91)90015-T","volume":"95","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Iterated stack automata and complexity classes. Information and Computation\u00a095(1), 21\u201375 (1991)","journal-title":"Information and Computation"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of LICS 2009 (2009)","DOI":"10.1109\/LICS.2009.29"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, C.-H.L.: Complexity of model checking recursion schemes for fragments of the modal mu-calculus. A long version, available from the authors\u2019 web page (2009)","DOI":"10.1007\/978-3-642-02930-1_19"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45931-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"T. Knapik","year":"2002","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 205\u2013222. Springer, Heidelberg (2002)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Proc. MFCS","author":"D. Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal mu-calculus and related results. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 552\u2013562. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:36Z","timestamp":1558403376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}