{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:01:37Z","timestamp":1760644897095,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319600","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"54-63","source":"Crossref","is-referenced-by-count":45,"title":["On the language inclusion problem for timed automata: closing a decidability gap"],"prefix":"10.1109","author":[{"given":"J.","family":"Ouaknine","sequence":"first","affiliation":[]},{"given":"J.","family":"Worrell","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/5.533956"},{"journal-title":"Transmission control protocol","year":"1981","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2003.1253264"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.326"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"1979","author":"hopcroft","key":"16"},{"key":"13","first-page":"145","article-title":"Robust undecidability of timed and hybrid systems","volume":"1790","author":"henzinger","year":"2000","journal-title":"Proceedings of HSCC 00"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00217-2"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90035-9"},{"key":"12","first-page":"545","article-title":"What good are digital clocks?","volume":"623","author":"henzinger","year":"1992","journal-title":"Proceedings of ICALP 92"},{"journal-title":"Concurrency State Models and Java Programs","year":"1999","author":"magee","key":"21"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252683"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46002-0_4"},{"journal-title":"On the Undecidability of Universality for Timed Automata with Minimal Resources","year":"0","author":"ouaknine","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210059"},{"key":"25","first-page":"99","article-title":"Timed CSP = closed timed ?-automata","volume":"10","author":"ouaknine","year":"2003","journal-title":"Nordic Journal of Computing"},{"key":"26","first-page":"375","article-title":"Universality and language inclusion for open and closed timed automata","volume":"2623","author":"ouaknine","year":"2003","journal-title":"Proceedings of HSCC 03"},{"journal-title":"Logics Automata and Classical Theories for Deciding Real Time","year":"1999","author":"raskin","key":"27"},{"key":"28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1540","article-title":"An infinite antichain of permutations","volume":"7","author":"spielman","year":"2000","journal-title":"The Electronic Journal of Combinatorics"},{"key":"29","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-61604-7_75","article-title":"Verifying abstractions of timed systems","volume":"1119","author":"tas?iran","year":"1996","journal-title":"Proceedings of CONCUR 96"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561359"},{"key":"2","first-page":"298","article-title":"Verifying networks of timed processes","volume":"1384","author":"abdulla","year":"1998","journal-title":"Proceedings of TACAS 98"},{"key":"10","first-page":"331","article-title":"Robust timed automata","volume":"1201","author":"gupta","year":"1997","journal-title":"Proceedings of HART 97"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287591"},{"key":"30","article-title":"Folk theorems on the determinization and minimization of timed automata","author":"tripakis","year":"2003","journal-title":"Proceedings of FORMATS 03"},{"key":"7","article-title":"Digitization of timed automata","author":"bos?nac?ki","year":"1999","journal-title":"Proceedings of FMICS 99"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"4","first-page":"414","article-title":"Model-checking for real-time systems","author":"alur","year":"1990","journal-title":"Proceedings of LICS 90"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201217"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319600.pdf?arnumber=1319600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T01:47:42Z","timestamp":1585964862000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319600","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}