{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:24:00Z","timestamp":1725791040815},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_13","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"195-209","source":"Crossref","is-referenced-by-count":0,"title":["Resource Reachability Games on Pushdown Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-85361-9_9","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Krcal, P., Yi, W.: R-automata. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 67\u201381. Springer, Heidelberg (2008)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-31424-7_8","volume-title":"Computer Aided Verification","author":"T. Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Ku\u010dera, A., Novotn\u00fd, P.: Efficient controller synthesis for consumption games with multiple resource types. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 23\u201338. Springer, Heidelberg (2012)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/3-540-45465-9_60","volume-title":"Automata, Languages and Programming","author":"T. Cachat","year":"2002","unstructured":"Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 704\u2013715. Springer, Heidelberg (2002)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-45212-6_9","volume-title":"Embedded Software","author":"A. Chakrabarti","year":"2003","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol.\u00a02855, pp. 117\u2013133. Springer, Heidelberg (2003)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K. Chatterjee","year":"2012","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theoretical Computer Science\u00a0458, 49\u201360 (2012)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","unstructured":"Chatterjee, K., Fijalkow, N.: Infinite-state games with finitary conditions. In: CSL, pp. 181\u2013196 (2013)"},{"key":"13_CR8","first-page":"3","volume":"1","author":"A. Church","year":"1957","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. Summaries of the Summer Institute of Symbolic Logic\u00a01, 3\u201350 (1957)","journal-title":"Summaries of the Summer Institute of Symbolic Logic"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Colcombet, T.: Regular cost functions over words (2009)","DOI":"10.1109\/LICS.2010.36"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Colcombet, T., L\u00f6ding, C.: Regular cost functions over finite trees. In: LICS, pp. 70\u201379 (2010)","DOI":"10.1109\/LICS.2010.36"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3-2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by Divisibility in Abstract Algebras. Proceedings London Mathematical Society\u00a0s3-2(1), 326\u2013336 (1952)","journal-title":"Proceedings London Mathematical Society"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1051\/ita:2005027","volume":"39","author":"D. Kirsten","year":"2005","unstructured":"Kirsten, D.: Distance desert automata and the star height problem. RAIRO - Theoretical Informatics and Applications\u00a039, 455\u2013509 (2005)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-540-31980-1_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Suwimonteerabuth","year":"2005","unstructured":"Suwimonteerabuth, D., Schwoon, S., Esparza, J.: jMoped: A java bytecode checker based on moped. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 541\u2013545. Springer, Heidelberg (2005)"},{"issue":"2","key":"13_CR15","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."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:06:37Z","timestamp":1558872397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}