{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658408,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394772","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"397-409","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["One-Clock Priced Timed Games are PSPACE-hard"],"prefix":"10.1145","author":[{"given":"John","family":"Fearnley","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, University of Liverpool"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Liverpool"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Liverpool"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"volume-title":"Proc. of ICALP. 122--133","author":"Alur Rajeev","key":"e_1_3_2_1_1_1","unstructured":"Rajeev Alur , Mikhail Bernadsky , and P. Madhusudan . 2004. Optimal Reachability for Weighted Timed Games . In Proc. of ICALP. 122--133 . Rajeev Alur, Mikhail Bernadsky, and P. Madhusudan. 2004. Optimal Reachability for Weighted Timed Games. In Proc. of ICALP. 122--133."},{"key":"e_1_3_2_1_2_1","volume-title":"Salvatore La Torre, and George J. Pappas","author":"Alur Rajeev","year":"2001","unstructured":"Rajeev Alur , Salvatore La Torre, and George J. Pappas . 2001 . Optimal Paths in Weighted Timed Automata. In Proc. of HSCC. 49--62. Rajeev Alur, Salvatore La Torre, and George J. Pappas. 2001. Optimal Paths in Weighted Timed Automata. In Proc. of HSCC. 49--62."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_14"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45351-2_15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-007-0035-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1146068.1711154"},{"key":"e_1_3_2_1_8_1","volume-title":"Larsen","author":"Bouyer Patricia","year":"2004","unstructured":"Patricia Bouyer , Franck Cassez , Emmanuel Fleury , and Kim G . Larsen . 2004 . Optimal Strategies in Priced Timed Game Automata. In Proc. of FSTTCS. 148--160. Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim G. Larsen. 2004. Optimal Strategies in Priced Timed Game Automata. In Proc. of FSTTCS. 148--160."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.07.006"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of CONCUR. 311--324","author":"Bouyer Patricia","year":"2015","unstructured":"Patricia Bouyer , Samy Jaziri , and Nicolas Markey . 2015 . On the Value Problem in Weighted Timed Games . In Proc. of CONCUR. 311--324 . Patricia Bouyer, Samy Jaziri, and Nicolas Markey. 2015. On the Value Problem in Weighted Timed Games. In Proc. of CONCUR. 311--324."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944836_32"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11603009_5"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of FSTTCS. 278--292","author":"Brihaye Thomas","year":"2015","unstructured":"Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , and Benjamin Monmege . 2015 . Simple Priced Timed Games are not That Simple . In Proc. of FSTTCS. 278--292 . Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. 2015. Simple Priced Timed Games are not That Simple. In Proc. of FSTTCS. 278--292."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_38"},{"key":"e_1_3_2_1_15_1","volume-title":"One-Clock Priced Timed Games are PSPACE-hard. CoRR abs\/2001.04458","author":"Fearnley John","year":"2020","unstructured":"John Fearnley , Rasmus Ibsen-Jensen , and Rahul Savani . 2020. One-Clock Priced Timed Games are PSPACE-hard. CoRR abs\/2001.04458 ( 2020 ). https:\/\/arxiv.org\/abs\/2001.04458 John Fearnley, Rasmus Ibsen-Jensen, and Rahul Savani. 2020. One-Clock Priced Timed Games are PSPACE-hard. CoRR abs\/2001.04458 (2020). https:\/\/arxiv.org\/abs\/2001.04458"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_37"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_72"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35608-2_40"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28644-8_25"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.57.3"}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394772","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":20,"alternative-id":["10.1145\/3373718.3394772","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394772","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}