{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:08:15Z","timestamp":1776373695893,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642397981","type":"print"},{"value":"9783642397998","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39799-8_71","type":"book-chapter","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T23:13:06Z","timestamp":1373497986000},"page":"990-1005","source":"Crossref","is-referenced-by-count":21,"title":["Lazy Abstractions for Timed Automata"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Herbreteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"71_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. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"issue":"1","key":"71_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1995.1059","volume":"118","author":"R. Alur","year":"1995","unstructured":"Alur, R., Itai, A., Kurshan, R.P., Yannakakis, M.: Timing verification by successive approximation. Inf. Comput.\u00a0118(1), 142\u2013157 (1995)","journal-title":"Inf. Comput."},{"key":"71_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36577-X_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2003","unstructured":"Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 254\u2013270. Springer, Heidelberg (2003)"},{"issue":"3","key":"71_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G. Behrmann","year":"2006","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pelanek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. Journal on Software Tools for Technology Transfer\u00a08(3), 204\u2013215 (2006)","journal-title":"Int. Journal on Software Tools for Technology Transfer"},{"key":"71_CR5","unstructured":"Behrmann, G., David, A., Larsen, K.G., Haakansson, J., Pettersson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: QEST, pp. 125\u2013126. IEEE Computer Society (2006)"},{"key":"71_CR6","doi-asserted-by":"crossref","unstructured":"Bengtsson, J.E., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27755-2_3"},{"key":"71_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11603009_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2005","unstructured":"Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: Forward analysis of timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 112\u2013126. Springer, Heidelberg (2005)"},{"key":"71_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48153-2_11","volume-title":"Correct Hardware Design and Verification Methods","author":"M. Bozga","year":"1999","unstructured":"Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 125\u2013141. Springer, Heidelberg (1999)"},{"issue":"4","key":"71_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF00709157","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Form. Methods Syst. Des.\u00a01(4), 385\u2013415 (1992)","journal-title":"Form. Methods Syst. Des."},{"key":"71_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"71_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1990","unstructured":"Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"key":"71_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-60045-0_66","volume-title":"Computer Aided Verification","author":"D.L. Dill","year":"1995","unstructured":"Dill, D.L., Wong-Toi, H.: Verification of real-time systems by successive over and under approximation. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 409\u2013422. Springer, Heidelberg (1995)"},{"key":"71_CR13","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, pp. 58\u201370 (2002)","DOI":"10.1145\/503272.503279"},{"key":"71_CR14","unstructured":"Herbreteau, F., Kini, D., Srivathsan, B., Walukiewicz, I.: Using non-convex approximations for efficient analysis of timed automata. In: FSTTCS. LIPIcs, vol.\u00a013, pp. 78\u201389 (2011)"},{"key":"71_CR15","doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. In: LICS, pp. 375\u2013384 (2012)","DOI":"10.1109\/LICS.2012.48"},{"key":"71_CR16","doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Lazy abstractions for timed automata. arXiv:1301.3127, Extended version with proofs (2013)","DOI":"10.1007\/978-3-642-39799-8_71"},{"issue":"1","key":"71_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2005.07.023","volume":"345","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. TCS\u00a0345(1), 27\u201359 (2005)","journal-title":"TCS"},{"key":"71_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11817963_14","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2006","unstructured":"McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 123\u2013136. Springer, Heidelberg (2006)"},{"key":"71_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-22110-1_50","volume-title":"Computer Aided Verification","author":"G. Morb\u00e9","year":"2011","unstructured":"Morb\u00e9, G., Pigorsch, F., Scholl, C.: Fully symbolic model checking for timed automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 616\u2013632. Springer, Heidelberg (2011)"},{"key":"71_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-30206-3_25","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M. Sorea","year":"2004","unstructured":"Sorea, M.: Lazy approximation for dense real-time systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 363\u2013378. Springer, Heidelberg (2004)"},{"issue":"1","key":"71_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10009-003-0135-4","volume":"6","author":"F. Wang","year":"2004","unstructured":"Wang, F.: Efficient verification of timed automata with BDD-like data structures. Int. J. Softw. Tools Technol. Transf.\u00a06(1), 77\u201397 (2004)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"71_CR22","doi-asserted-by":"crossref","unstructured":"Wong-Toi, H.: Symbolic Approximations of Verifying Real-Time Systems. PhD thesis, Stanford University (March 1995)","DOI":"10.1142\/9789812831583_0007"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39799-8_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T00:58:07Z","timestamp":1563411487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39799-8_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397981","9783642397998"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39799-8_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}