{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:08:11Z","timestamp":1776373691503,"version":"3.51.2"},"publisher-location":"Heidelberg","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319009445","type":"print"},{"value":"9783319009452","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00945-2_43","type":"book-chapter","created":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T09:29:17Z","timestamp":1369906157000},"page":"469-478","source":"Crossref","is-referenced-by-count":3,"title":["K-Induction Based Verification of Real-Time Safety Critical Systems"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"V\u00f6r\u00f6s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Istv\u00e1n","family":"Majzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-16145-2_6","volume-title":"Model Driven Engineering Languages and Systems","author":"G. Bergmann","year":"2010","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, D., Balogh, A., Balogh, Z., \u00d6kr\u00f6s, A.: Incremental Evaluation of Model Queries over EMF Models. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010, Part I. LNCS, vol.\u00a06394, pp. 76\u201390. Springer, Heidelberg (2010)"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, p. 193. Springer, Heidelberg (1999)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Biere, A., Artho, C., Schuppan, V.: Liveness Checking as Safety Checking. In: FMICS 2002 (2002)","DOI":"10.1016\/S1571-0661(04)80410-9"},{"key":"43_CR5","unstructured":"Claessen, K., Sorensson, N.: A Liveness Checking Algorithm That Counts. In: FMCAD 2012 (2012)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Dutertre, B., Sorea, M.: Modeling and Verification of a Fault-Tolerant Real-time Startup Protocol using Calendar Automata. In: FORMATS-FTRTFT 2004 (2004)","DOI":"10.1007\/978-3-540-30206-3_15"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Kindermann, R., Junttila, T., Niemel\u00e4, I.: Complete SMT-Based Bounded Model Checking for Timed Automata. In: FMOODS\/FORTE 2012 (2012)","DOI":"10.1007\/978-3-642-30793-5_6"},{"key":"43_CR8","unstructured":"de Moura, L., Owre, S., Shankar, N.: The SAL Language Manual. CSL Technical Report SRI-CSL-01-02 (2003)"},{"key":"43_CR9","unstructured":"Pike, L.: Real-Time System Verification by k-Induction. NASA Technical Memorandum TM-2005-213751 (2005)"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking Safety Properties Using Induction and a SAT-Solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"}],"container-title":["Advances in Intelligent Systems and Computing","New Results in Dependability and Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00945-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T10:25:39Z","timestamp":1675333539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00945-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319009445","9783319009452"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00945-2_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}