{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:26:42Z","timestamp":1726406802980},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_39","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"483-494","source":"Crossref","is-referenced-by-count":2,"title":["Fixpoint Logics on Hierarchical Structures"],"prefix":"10.1007","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"39_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/503502.503503","volume":"23","author":"R. Alur","year":"2001","unstructured":"Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst.\u00a023(3), 273\u2013303 (2001)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-63172-0_34","volume-title":"Computer Science Logic","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S.: Bounded-variable fixpoint queries are PSPACE-complete. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 89\u2013105. Springer, Heidelberg (1997)"},{"key":"39_CR3","first-page":"132","volume-title":"Proc. FOCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proc. FOCS 1991, pp. 132\u2013142. IEEE Computer Society Press, Los Alamitos (1991)"},{"issue":"1-2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. Theor. Comput. Sci.\u00a0258(1-2), 491\u2013522 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR5","first-page":"267","volume-title":"Proc. LICS 1986","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In: Proc. LICS 1986, pp. 267\u2013278. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"39_CR6","series-title":"Beyond Words","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-59126-6_3","volume-title":"Handbook of Formal Languages","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol.\u00a03, pp. 125\u2013213. Springer, Heidelberg (1997)"},{"key":"39_CR7","unstructured":"G\u00f6ller, S., Lohrey, M.: Fixpoint logics on hierarchical structures. Tech. Rep. 2005\/3, University of Stuttgart, Germany (2005), ftp.informatik.uni-stuttgart.de\/pub\/library\/ncstrl.ustuttgart fi\/TR-2005-04\/"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Inf. Control\u00a068(1-3), 86\u2013104 (1986)","journal-title":"Inf. Control"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP and co-UP. Inf. Process. Lett.\u00a068(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"39_CR11","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)"},{"issue":"3","key":"39_CR12","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1145\/65950.65952","volume":"36","author":"T. Lengauer","year":"1989","unstructured":"Lengauer, T.: Hierarchical planarity testing algorithms. J. Assoc. Comput. Mach.\u00a036(3), 474\u2013509 (1989)","journal-title":"J. Assoc. Comput. Mach."},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(92)90004-3","volume":"44","author":"T. Lengauer","year":"1992","unstructured":"Lengauer, T., Wagner, K.W.: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. J. Comput. Syst. Sci.\u00a044, 63\u201393 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"39_CR14","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T. Lengauer","year":"1988","unstructured":"Lengauer, T., Wanke, E.: Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput.\u00a017(6), 1063\u20131080 (1988)","journal-title":"SIAM J. Comput."},{"key":"39_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"39_CR16","unstructured":"Lohrey, M.: Model-checking hierarchical graphs. Tech. Rep. 2005\/1, University of Stuttgart, Germany (2005), ftp.informatik.uni-stuttgart.de\/pub\/library\/ncstrl.ustuttgart fi\/TR-2005-1\/"},{"key":"39_CR17","first-page":"168","volume-title":"Proc. LICS 2005","author":"M. Lohrey","year":"2005","unstructured":"Lohrey, M.: Model-checking hierarchical structures. In: Proc. LICS 2005, pp. 168\u2013177. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"5","key":"39_CR18","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/S0097539795285254","volume":"27","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Hunt III, H.B., Stearns, R.E., Radhakrishnan, V.: Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM J. Comput.\u00a027(5), 1237\u20131261 (1998)","journal-title":"SIAM J. Comput."},{"key":"39_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45069-6_7","volume-title":"Computer Aided Verification","author":"J. Obdr\u017e\u00e1lek","year":"2003","unstructured":"Obdr\u017e\u00e1lek, J.: Fast mu-calculus model checking when tree-width is bounded. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 80\u201392. Springer, Heidelberg (2003)"},{"key":"39_CR20","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"39_CR21","series-title":"137\u2013146","first-page":"137","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"M.Y. Vardi","year":"1995","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. 137\u2013146, vol.\u00a0888, pp. 137\u2013146. Springer, Heidelberg (1995)"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/212433.212474","volume-title":"Proc. PODS 1995","author":"M.Y. Vardi","year":"1995","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. PODS 1995, pp. 266\u2013276. ACM Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:15Z","timestamp":1619506155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11590156_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}