{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:53:30Z","timestamp":1781855610915,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"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":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209191","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"185-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS"],"prefix":"10.1145","author":[{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"first","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Novotn\u00fd","sequence":"additional","affiliation":[{"name":"IST Austria Klosterneuburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"Velan","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[{"name":"Forsyte, TU Wien Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.12.008"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882094.1882102"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48899-7_22"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_30"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008428"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951860.2951873"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2045343.2045353"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"T. Br\u00e1zdil C. Chatterjee A. Ku\u010dera P. Novotn\u00fd D. Velan and F. Zuleger. 2018. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. arXiv:1804.10985.","DOI":"10.1145\/3209108.3209191"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of CAV","author":"Carbonneaux Q.","year":"2017","unstructured":"Q. Carbonneaux, J. Hoffmann, T. W. Reps, and Z. Shao. 2017. Automated Resource Analysis with Coq Proof Objects. In Proc. of CAV 2017. 64--85."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of FSTTCS","author":"Chatterjee K.","year":"2010","unstructured":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J-F. Raskin. 2010. Generalized Mean-payoff and Energy Games. In Proc. of FSTTCS 2010. 505--516."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_35"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of LICS","author":"Colcombet T.","year":"2017","unstructured":"T. Colcombet, M. Jurdzinski, R. Lazic, and S. Schmitz. 2017. Perfect Half Space Games. In Proc. of LICS 2017. 1--11."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647444.727062"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_40"},{"key":"e_1_3_2_1_15_1","first-page":"245","article-title":"Decidability Issues for Petri Nets -- A survey","volume":"52","author":"Esparza J.","year":"1994","unstructured":"J. Esparza and M. Nielsen. 1994. Decidability Issues for Petri Nets -- A survey. Bulletin of the EATCS 52 (1994), 245--262.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of APLAS","author":"Montoya A.","year":"2014","unstructured":"A. F.-Montoya and R. H\u00e4hnle. 2014. Resource Analysis of Complex Programs with Cost Equations. In Proc. of APLAS 2014. 275--295."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9388-y"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362389.2362393"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62251"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926421"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of RP","author":"Leroux J.","year":"2014","unstructured":"J. Leroux and P. Schnoebelen. 2014. On Functions Weakly Computable by Petri Nets and Vector Addition Systems. In Proc. of RP 2014. 190--202."},{"key":"e_1_3_2_1_28_1","unstructured":"R. Lipton. 1976. The Reachability Problem Requires Exponential Space. Yale Technical report 62."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213029"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of VMCAI","author":"Podelski A.","year":"2004","unstructured":"A. Podelski and A. Rybalchenko. 2004. A Complete Method for the Synthesis of Linear Ranking Functions. In Proc. of VMCAI 2004. 239--251."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_50"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9402-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.03.001"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-009-0074-7"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90059-O"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:29:15Z","timestamp":1781854155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":37,"alternative-id":["10.1145\/3209108.3209191","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209191","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}