{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T22:59:35Z","timestamp":1790636375216,"version":"4.1.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470525","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Continuous One-Counter Automata"],"prefix":"10.1109","author":[{"given":"Michael","family":"Blondin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Leys","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Offtermatt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillermo A.","family":"Perez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-011-0111-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017096"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33512-9_6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.07.011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167242"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56939-1_82"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005068"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28644-8_25"},{"key":"ref19","author":"papadimitriou","year":"1994","journal-title":"Computational Complexity"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"ref3","first-page":"62","article-title":"The reachability problem requires exponential space","author":"lipton","year":"1976","journal-title":"Tech Rep"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316369"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785796"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_25"},{"key":"ref2","author":"minsky","year":"1967","journal-title":"Computation Finite and Infinite Machines"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"ref9","article-title":"The complexity of flat freeze LTL","volume":"15","author":"bollig","year":"2019","journal-title":"Logical Methods in Computer Science"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0204006"},{"key":"ref21","author":"bovet","year":"1994","journal-title":"Introduction to the Theory of Complexity"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90076-6"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Rome, Italy","start":{"date-parts":[[2021,6,29]]},"end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470525.pdf?arnumber=9470525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:22Z","timestamp":1652197582000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470525\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470525","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}