{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:48Z","timestamp":1725663588505},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564966"},{"type":"electronic","value":"9783540475729"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56496-9_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:12:35Z","timestamp":1330254755000},"page":"137-150","source":"Crossref","is-referenced-by-count":15,"title":["Timing verification by successive approximation"],"prefix":"10.1007","author":[{"given":"R.","family":"Alur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Itai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Kurshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur and D.L. Dill. Automata for modeling real-time systems. In Automata, Languages and Programming: Proceedings of the 17th ICALP, Lecture Notes in Computer Science 443, pages 322\u2013335. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0032042"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Y. Choueka. Theories of automata on \u03c9-tapes: a simplified approach. Journal of Computer and System Sciences, 8:117\u2013141, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_17"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan. Reducibility in analysis of coordination. In Lecture Notes in Computer Science, volume 103, pages 19\u201339. Springer-Verlag, 1987.","DOI":"10.1007\/BFb0042302"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan. Analysis of discrete event coordination. In Lecture Notes in Computer Science, volume 430, pages 414\u2013453. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52559-9_74"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the 9th ACM Symposium on Principles of Database Systems, pages 230\u2013242, 1990.","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56496-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:57Z","timestamp":1605647037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56496-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564966","9783540475729"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-56496-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}