{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:26:55Z","timestamp":1750318015540,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043673"},{"type":"electronic","value":"9783642043680"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04368-0_18","type":"book-chapter","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T03:31:59Z","timestamp":1251862319000},"page":"228-242","source":"Crossref","is-referenced-by-count":14,"title":["Checking Timed B\u00fcchi Automata Emptiness Using LU-Abstractions"],"prefix":"10.1007","author":[{"given":"Guangyuan","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/3-540-48683-6_3","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1999","unstructured":"Alur, R.: Timed Automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 8\u201322. Springer, Heidelberg (1999)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814105","volume-title":"Modelling, Specification and Verification","author":"L. Aceto","year":"2007","unstructured":"Aceto, L., Ingolfsdottir, A., Larsen, K., Srba, J.: Reactive Systems. In: Modelling, Specification and Verification. Cambridge University Press, Cambridge (2007)"},{"issue":"1-3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"300","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgueno, A., Larsen, K.: The power of reachability testing for timed automata. Theoretical Computer Science\u00a0300(1-3), 411\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR4","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"},{"key":"18_CR5","series-title":"Trends in Software Series","first-page":"55","volume-title":"Formal Methods for Real-Time Computing","author":"R. Alur","year":"1996","unstructured":"Alur, R., Dill, D.L.: Automata-theoretic verification of real-time systems. In: Formal Methods for Real-Time Computing. Trends in Software Series, pp. 55\u201382. John Wiley & Sons Publishers, Chichester (1996)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM\u00a043, 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: 4th Intl. School on Formal Mthods for Computer, Communication, and Software Systems: Real Time (2004)","DOI":"10.1007\/978-3-540-30080-9_1"},{"key":"18_CR8","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"3","key":"18_CR9","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., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. STTT\u00a08(3), 204\u2013215 (2006)","journal-title":"STTT"},{"key":"18_CR10","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)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J.E. Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"issue":"3","key":"18_CR12","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"},{"key":"18_CR13","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-48119-2_16","volume-title":"FM\u201999 - Formal Methods","author":"J.-M. Couvreur","year":"1999","unstructured":"Couvreur, J.-M.: On-the-fly verification of linear temporal logic. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 253\u2013271. Springer, Heidelberg (1999)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11537328_15","volume-title":"Model Checking Software","author":"J.-M. Couvreur","year":"2005","unstructured":"Couvreur, J.-M., Duret-Lutz, A., Poitrenaud, D.: On-the-Fly Emptiness Checks for Generalized B\u00fcchi Automata. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 169\u2013184. Springer, Heidelberg (2005)"},{"issue":"2\/3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-Efficient algorithms for the verification of temporal properties. Formal Methods in System Design\u00a01(2\/3), 275\u2013288 (1992)","journal-title":"Formal Methods in System Design"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0020933","volume-title":"Hybrid Systems III","author":"Y. Kesten","year":"1996","unstructured":"Kesten, Y., Manna, Z., Pnueli, A.: Verifying clocked transition systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066, pp. 13\u201340. Springer, Heidelberg (1996)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11867340_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O. Maler","year":"2006","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: From MITL to Timed Automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol.\u00a04202, pp. 274\u2013289. Springer, Heidelberg (2006)"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The temporal logic of reactive and concurrent systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems: Specification. Springer, New York (1992)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Checking Timed Buchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic\u00a010(3), 15:1\u201315:19 (2009)","DOI":"10.1145\/1507244.1507245"},{"issue":"3","key":"18_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04368-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T05:56:15Z","timestamp":1558504575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04368-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043673","9783642043680"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04368-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}