{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:40:37Z","timestamp":1729651237367,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029827","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:14:31Z","timestamp":1056579271000},"page":"177-186","source":"Crossref","is-referenced-by-count":4,"title":["Computing reachability relations in timed automata"],"prefix":"10.1109","author":[{"given":"C.","family":"Dima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"114","article-title":"Model-checking timed automata","volume":"1494","author":"yovine","year":"1998","journal-title":"LNCS"},{"key":"15","first-page":"232","article-title":"Beyond region graphs: Symbolic forward analysis of timed automata","volume":"1738","author":"mukhopadhyay","year":"1999","journal-title":"LNCS"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","author":"tarski","year":"1951","journal-title":"A decision method for elementary algebra and geometry"},{"key":"13","first-page":"456","article-title":"Uppaal: Status & developments","author":"larsen","year":"1997","journal-title":"Proc CAV 97"},{"key":"14","first-page":"61","article-title":"Temporal constraint networks","author":"meiri","year":"1991","journal-title":"Artificial Intelligence"},{"key":"11","first-page":"179","article-title":"Integration graphs: A class of decidable hybrid systems","volume":"736","author":"kesten","year":"1992","journal-title":"LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1037"},{"journal-title":"Dynamic Programming","year":"1957","author":"bellmann","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614944"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"1992","author":"hopcroft","key":"10"},{"journal-title":"An algebraic theory of real-time formal languages","year":"2001","author":"dima","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_48"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48320-9_18"},{"key":"4","first-page":"485","article-title":"Partial order reductions for timed systems","volume":"1466","author":"bengtsson","year":"1998","journal-title":"LNCS"},{"key":"9","first-page":"261","article-title":"Methods and applications of (max, +) linear algebra","volume":"1200","author":"gaubert","year":"1997","journal-title":"LNCS"},{"journal-title":"Computers and Intractability","year":"1979","author":"garey","key":"8"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029827.pdf?arnumber=1029827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T07:04:48Z","timestamp":1623135888000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029827\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029827","relation":{},"subject":[]}}