{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:49Z","timestamp":1750308769121,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["IE110996"],"award-info":[{"award-number":["IE110996"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2012\/05\/N\/ST6\/03226"],"award-info":[{"award-number":["2012\/05\/N\/ST6\/03226"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Linnaeus centre of excellence UPMARC, Uppsala Programming for Multicore Architectures Research Center"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603100","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Infinite-state energy games"],"prefix":"10.1145","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[{"name":"University of Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S.\n      Almagor U.\n      Boker and \n      O.\n      Kupferman\n  . \n  What's decidable about weighted automata? In ATVA volume \n  6996\n   of \n  LNCS pages \n  482\n  --\n  491\n  . \n  Springer 2011\n  .   S. Almagor U. Boker and O. Kupferman. What's decidable about weighted automata? In ATVA volume 6996 of LNCS pages 482--491. Springer 2011.","DOI":"10.1007\/978-3-642-24372-1_37"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"135","volume-title":"CONCUR","author":"Bouajjani A.","year":"1997","unstructured":"A. Bouajjani , J. Esparza , and O. Maler . Reachability analysis of pushdown automata: Application to model-checking . In CONCUR , volume 1243 of LNCS , pages 135 -- 150 . Springer , 1997 . A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, volume 1243 of LNCS, pages 135--150. Springer, 1997."},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","volume-title":"ICALP'10","author":"Br\u00e1zdil T.","year":"2010","unstructured":"T. Br\u00e1zdil , P. Jan\u010dar , and A. Ku\u010dera . Reachability games on extended vector addition systems with states . In ICALP'10 , volume 6199 of LNCS . Springer , 2010 . T. Br\u00e1zdil, P. Jan\u010dar, and A. Ku\u010dera. Reachability games on extended vector addition systems with states. In ICALP'10, volume 6199 of LNCS. Springer, 2010."},{"issue":"6","key":"e_1_3_2_1_5_1","first-page":"71","volume":"68","author":"Cachat T.","year":"2002","unstructured":"T. Cachat . Uniform solution of parity games on prefix-recognizable graphs. ENTCS. , 68 ( 6 ): 71 -- 84 , 2002 . T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. ENTCS., 68(6):71--84, 2002.","journal-title":"ENTCS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.07.038"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.30"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_35"},{"key":"e_1_3_2_1_9_1","series-title":"LIPIcs","first-page":"505","volume-title":"FSTTCS'10","author":"Chatterjee K.","year":"2010","unstructured":"K. Chatterjee , L. Doyen , T. Henzinger , and J.-F. Raskin . Generalized mean-payoff and energy games . In FSTTCS'10 , volume 8 of LIPIcs , LZI , pages 505 -- 516 , 2010 . K. Chatterjee, L. Doyen, T. Henzinger, and J.-F. Raskin. Generalized mean-payoff and energy games. In FSTTCS'10, volume 8 of LIPIcs, LZI, pages 505--516, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_10"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","volume-title":"CAV","author":"Esparza J.","year":"2000","unstructured":"J. Esparza , D. Hansel , P. Rossmanith , and S. Schwoon . Efficient algorithms for model checking pushdown systems . In CAV , volume 1855 of LNCS . Springer , 2000 . J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV, volume 1855 of LNCS. Springer, 2000."},{"key":"e_1_3_2_1_12_1","first-page":"3","volume-title":"The linear time -- branching time spectrum I","author":"Glabbeek R. v.","year":"2001","unstructured":"R. v. Glabbeek . The linear time -- branching time spectrum I ; the semantics of concrete, sequential processes. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, chapter 1, pages 3 -- 99 . Elsevier , 2001 . R. v. Glabbeek. The linear time -- branching time spectrum I; the semantics of concrete, sequential processes. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, chapter 1, pages 3--99. Elsevier, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.37"},{"key":"e_1_3_2_1_14_1","series-title":"LIPIcs","first-page":"515","volume-title":"FSTTCS'13","author":"Hofman P.","year":"2013","unstructured":"P. Hofman , S. Lasota , R. Mayr , and P. Totzke . Simulation over one-counter nets is PSPACE-complete . In FSTTCS'13 , volume 24 of LIPIcs , LZI , pages 515 -- 526 , 2013 . P. Hofman, S. Lasota, R. Mayr, and P. Totzke. Simulation over one-counter nets is PSPACE-complete. In FSTTCS'13, volume 24 of LIPIcs, LZI, pages 515--526, 2013."},{"key":"e_1_3_2_1_15_1","first-page":"404","volume":"1725","author":"Jan\u010dar P.","year":"1999","unstructured":"P. Jan\u010dar , F. Moller , and Z. Sawa . Simulation problems for one-counter machines. In SOFSEM , volume 1725 of LNCS, pages 404 -- 413 , 1999 . P. Jan\u010dar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In SOFSEM, volume 1725 of LNCS, pages 404--413, 1999.","journal-title":"Simulation problems for one-counter machines. In SOFSEM"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"334","volume-title":"STACS","author":"Jan\u010dar P.","year":"2000","unstructured":"P. Jan\u010dar , A. Ku\u010dera , and F. Moller . Simulation and bisimulation over one-counter processes . In STACS , volume 1770 of LNCS , pages 334 -- 345 . Springer , 2000 . ISBN 3-540-67141-2. URL http:\/\/portal.acm.org\/citation.cfm?id=646514.695814. P. Jan\u010dar, A. Ku\u010dera, and F. Moller. Simulation and bisimulation over one-counter processes. In STACS, volume 1770 of LNCS, pages 334--345. Springer, 2000. ISBN 3-540-67141-2. URL http:\/\/portal.acm.org\/citation.cfm?id=646514.695814."},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"387","volume-title":"CAV","author":"Piterman N.","year":"2004","unstructured":"N. Piterman and M. Vardi . Global model-checking of infinite-state systems . In CAV , volume 3114 of LNCS , pages 387 -- 400 . Springer , 2004 . N. Piterman and M. Vardi. Global model-checking of infinite-state systems. In CAV, volume 3114 of LNCS, pages 387--400. Springer, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_23"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/7.1.103"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","first-page":"127","volume-title":"FSTTCS","author":"Walukiewicz I.","year":"2000","unstructured":"I. Walukiewicz . Model checking ctl properties of pushdown systems . In FSTTCS , volume 1974 of LNCS , pages 127 -- 138 . Springer , 2000 . I. Walukiewicz. Model checking ctl properties of pushdown systems. In FSTTCS, volume 1974 of LNCS, pages 127--138. Springer, 2000."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2894"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603100","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":21,"alternative-id":["10.1145\/2603088.2603100","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603100","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}