{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:22Z","timestamp":1725471322948},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_23","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"349-364","source":"Crossref","is-referenced-by-count":4,"title":["Infinite State Model-Checking of Propositional Dynamic Logics"],"prefix":"10.1007","author":[{"given":"Stefan","family":"G\u00f6ller","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R. Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst.\u00a027(4), 786\u2013818 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"23_CR3","unstructured":"Blumensath, A.: Prefix-recognizable graphs and monadic second-order logic. Tech. Rep. 2001-06, RWTH Aachen, Germany (2001)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. ENTCS\u00a068(6) (2002)","DOI":"10.1016\/S1571-0661(04)80534-6"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci.\u00a0290(1), 79\u2013115 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. Assoc. Comput. Mach.\u00a028(1), 114\u2013133 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-16066-3_5","volume-title":"Computation Theory","author":"R. Danecki","year":"1985","unstructured":"Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 34\u201353. Springer, Heidelberg (1985)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0017477","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: On the decidabilty of model checking for several mu-calculi and petri nets. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 115\u2013129. Springer, Heidelberg (1994)"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J. Esparza","year":"2003","unstructured":"Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inf. Comput.\u00a0186(2), 355\u2013376 (2003)","journal-title":"Inf. Comput."},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci.\u00a018(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR11","unstructured":"G\u00f6ller, S., Lohrey, M.: Infinite State Model-Checking of Propositional Dynamic Logics Technical Report 2006\/04, University of Stuttgart, Germany (2006), ftp:\/\/ftp.informatik.uni-stuttgart.de\/pub\/library\/ncstrl.ustuttgart fi\/TR2006-04\/"},{"key":"23_CR12","first-page":"51","volume":"24","author":"D. Harel","year":"1985","unstructured":"Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. Ann. Discrete Math.\u00a024, 51\u201372 (1985)","journal-title":"Ann. Discrete Math."},{"key":"23_CR13","series-title":"Foundations of computing","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. Foundations of computing. MIT Press, Cambridge (2000)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45657-0_31","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2002","unstructured":"Kupferman, O., Piterman, N., Vardi, M.: Model checking linear properties of prefix-recognizable systems. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/10722167_7","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to reasoning about infinite-state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 36\u201352. Springer, Heidelberg (2000)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jal.2005.08.002","volume":"4","author":"M. Lange","year":"2005","unstructured":"Lange, M.: Model checking propositional dynamic logic with all extras. J. Appl. Log.\u00a04(1), 39\u201349 (2005)","journal-title":"J. Appl. Log."},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","volume":"70","author":"M. Lange","year":"2005","unstructured":"Lange, M., Lutz, C.: 2-Exptime lower bounds for propositional dynamic logics with intersection. J. Symb. Log.\u00a070(4), 1072\u20131086 (2005)","journal-title":"J. Symb. Log."},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11690634_20","volume-title":"Foundations of Software Science and Computation Structures","author":"C. L\u00f6ding","year":"2006","unstructured":"L\u00f6ding, C., Serre, O.: Propositional dynamic logic with recursive programs. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 292\u2013306. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"23_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. Theor. Comput. Sci.\u00a0274(1\u20132), 89\u2013115 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Mayr, R.: Strict lower bounds for model checking BPA. ENTCS\u00a018 (1998)","DOI":"10.1016\/S1571-0661(05)80256-7"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput.\u00a0156(1), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(00)00101-8","volume":"256","author":"R. Mayr","year":"2001","unstructured":"Mayr, R.: Decidability of model checking with the temporal logic EF. Theor. Comput. Sci.\u00a0256(1-2), 31\u201362 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"2-3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D. Muller","year":"1987","unstructured":"Muller, D., Schupp, P.: Alternating automata on infinite trees. Theor. Comput. Sci.\u00a054(2-3), 267\u2013276 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR24","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11562948_3","volume-title":"Automated Technology for Verification and Analysis","author":"W. Thomas","year":"2005","unstructured":"Thomas, W.: Some perspectives of infinite-state verification. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 3\u201310. Springer, Heidelberg (2005)"},{"key":"23_CR26","first-page":"137","volume-title":"Proc. STOC 1982","author":"M.Y. Vardi","year":"1982","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proc. STOC 1982, pp. 137\u2013146. ACM Press, New York (1982)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44450-5_10","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 127\u2013138. Springer, Heidelberg (2000)"},{"issue":"2","key":"23_CR29","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput.\u00a0164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."},{"key":"23_CR30","unstructured":"W\u00f6hrle, S.: Decision problems over infinite graphs: Higher-order pushdown systems and synchronized products. Dissertation, RWTH Aachen, Germany (2005)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:47:33Z","timestamp":1605642453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11874683_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}