{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T08:40:19Z","timestamp":1741509619340,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_7","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"92-107","source":"Crossref","is-referenced-by-count":2,"title":["Coarse Abstractions Make Zeno Behaviours Difficult to Detect"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Herbreteau","sequence":"first","affiliation":[]},{"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_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(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR2","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":"7_CR3","doi-asserted-by":"crossref","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, Los Alamitos (2006)","DOI":"10.1109\/QEST.2006.59"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods in System Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00165-006-0010-7","volume":"18","author":"H. Bowman","year":"2006","unstructured":"Bowman, H., G\u00f3mez, R.: How to stop time stopping. Formal Aspects of Computing\u00a018(4), 459\u2013493 (2006)","journal-title":"Formal Aspects of Computing"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"7_CR7","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.) AVMFSS 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-75454-1_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"R. G\u00f3mez","year":"2007","unstructured":"G\u00f3mez, R., Bowman, H.: Efficient detection of zeno runs in timed automata. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 195\u2013210. Springer, Heidelberg (2007)"},{"key":"#cr-split#-7_CR9.1","doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B.: Coarse abstractions make zeno behaviours difficult to detect. CoRR abs\/1106.1850 (2011);","DOI":"10.1007\/978-3-642-23217-6_7"},{"key":"#cr-split#-7_CR9.2","unstructured":"Extended version with proofs"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-14295-6_15","volume-title":"Computer Aided Verification","author":"F. Herbreteau","year":"2010","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Efficient Emptiness Check for Timed B\u00fcchi Automata. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 148\u2013161. Springer, Heidelberg (2010)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04368-0_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G. Li","year":"2009","unstructured":"Li, G.: Checking timed B\u00fcchi automata emptiness using LU-abstractions. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol.\u00a05813, pp. 228\u2013242. Springer, Heidelberg (2009)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-48778-6_18","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"S. Tripakis","year":"1999","unstructured":"Tripakis, S.: Verifying progress in timed systems. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 299\u2013314. Springer, Heidelberg (1999)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Checking timed B\u00fcchi emptiness on simulation graphs. ACM Trans. on Computational Logic\u00a010(3) (2009)","DOI":"10.1145\/1507244.1507245"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10703-005-1632-8","volume":"26","author":"S. Tripakis","year":"2005","unstructured":"Tripakis, S., Yovine, S., Bouajjani, A.: Checking timed B\u00fcchi automata emptiness efficiently. Formal Methods in System Design\u00a026(3), 267\u2013292 (2005)","journal-title":"Formal Methods in System Design"},{"key":"7_CR15","first-page":"341","volume-title":"ISoLA","author":"F. Wang","year":"2006","unstructured":"Wang, F.: Redlib for the formal verification of embedded systems. In: ISoLA, pp. 341\u2013346. IEEE, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T08:20:26Z","timestamp":1741508426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}