{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:09Z","timestamp":1725663909643},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581796"},{"type":"electronic","value":"9783540484691"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58179-0_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:25:22Z","timestamp":1330269922000},"page":"27-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Criteria for the simple path property in timed automata"],"prefix":"10.1007","author":[{"given":"William K. C.","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert K.","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. International Conference on Computer-Aided Verification, 1992."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, A. Itai, R. Kurshan, and M. Yannakakis. Timing verification by successive approximation. International Conference on Computer-Aided Verification, 1992.","DOI":"10.1007\/3-540-56496-9_12"},{"key":"3_CR3","unstructured":"Rajeev Alur and David Dill. Automata for modeling real-time systems. 1990 ACM International Workshop on Timing Issues In the Specification and Synthesis of Digital Systems, 1990."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Felice Balarin and Alberto Sangiovanni-Vincentelli. A verification strategy for timing constrainted systems. International Conference on Computer-Aided Verification, 1992.","DOI":"10.1007\/3-540-56496-9_13"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"E. Clarke, O. Grumberg, and R. Kurshan. A synthesis of two approaches for verifying finite state concurrent systems. Workshop on Automatic Verification Methods for Finite State Systems, 1989.","DOI":"10.1007\/3-540-51237-3_7"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"David Dill. Timing assumptions and verification of finite-state concurrent systems. Workshop on Automatic Verification Methods for Finite State Systems, 1989.","DOI":"10.1007\/3-540-52148-8_17"},{"key":"3_CR7","unstructured":"R.Kurshan E.M.Clarke, I.A.Draghicescu. A unified approach for showing language containment and equivalence between various types of \u03a9-automata. Tech. report, CMU, 1989."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"R. Hojati, H. Touati,R. Kurshan, and R. Brayton. Efficient \u03a9-regular language containment. International Conference on Computer-Aided Verification, 1992.","DOI":"10.1007\/3-540-56496-9_31"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"W. Lam and R. Brayton. Alternating rq timed automata. International Conference on Computer-Aided Verification, 1993.","DOI":"10.1007\/3-540-56922-7_20"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"W. Lam and R. Brayton. Criteria for the simple path property in timed automata. UC Berkeley ERL memorandum: UCB\/ERL, 1994.","DOI":"10.1007\/3-540-58179-0_41"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Mihalis Yannakakis and David Lee. An efficient algorithm for minimizing real-time transition systems. International Conference on Computer-Aided Verification, 1993.","DOI":"10.1007\/3-540-56922-7_18"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58179-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:43:36Z","timestamp":1558269816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58179-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581796","9783540484691"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58179-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}