{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:05:38Z","timestamp":1746079538940,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785684","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Timed Systems through the Lens of Logic"],"prefix":"10.1109","author":[{"given":"S.","family":"Akshay","sequence":"first","affiliation":[]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Juge","sequence":"additional","affiliation":[]},{"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(1:2)2014"},{"key":"ref11","article-title":"Non-sequential theory of distributed systems","volume":"abs 1904 6942","author":"bollig","year":"2019","journal-title":"CoRR"},{"key":"ref12","first-page":"64","article-title":"On the automatic verification of systems with continuous variables and unbounded discrete data structures","author":"bouajjani","year":"1994","journal-title":"Hybrid Systems II"},{"key":"ref13","first-page":"393","article-title":"On conciseness of extensions of timed automata","volume":"10","author":"bouyer","year":"2005","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.003"},{"key":"ref15","article-title":"Decidability of timed communicating automata","volume":"abs 1804 7815","author":"clemente","year":"2018","journal-title":"CoRR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.73"},{"key":"ref17","first-page":"118: 1","article-title":"Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms","author":"clemente","year":"2018","journal-title":"Proceedings ICALP"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005083"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926419"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11936-6_1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(4:17)2014"},{"key":"ref3","first-page":"11","article-title":"Reasoning about distributed systems: WYSIWYG (invited talk)","author":"aiswarya","year":"2014","journal-title":"Proceedings of FSTTCS?93"},{"key":"ref6","first-page":"39: 1","article-title":"Towards an efficient tree automata based technique for timed systems","author":"akshay","year":"2017","journal-title":"Proceedings of CONCUR94"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"ref5","article-title":"Analyzing timed systems using tree automata","author":"akshay","year":"2016","journal-title":"Proceedings of CONCUR94"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785684"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00151-3_6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23534-9_7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_38"},{"journal-title":"Graph Structure and Monadic Second-Order Logic-A Language-Theoretic Approach volume 138 of Encyclopedia of mathematics and its applications","year":"2012","author":"courcelle","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-014-0212-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2728606.2728624"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1231082313"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785684.pdf?arnumber=8785684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785684\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785684","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}