{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:13:06Z","timestamp":1770358386555,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540754534","type":"print"},{"value":"9783540754541","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75454-1_15","type":"book-chapter","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T01:47:54Z","timestamp":1190080074000},"page":"195-210","source":"Crossref","is-referenced-by-count":22,"title":["Efficient Detection of Zeno Runs in Timed Automata"],"prefix":"10.1007","author":[{"given":"Rodolfo","family":"G\u00f3mez","sequence":"first","affiliation":[]},{"given":"Howard","family":"Bowman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_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.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s100090050009","volume":"1","author":"S. Yovine","year":"1997","unstructured":"Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer\u00a01(1-2), 123\u2013133 (1997)","journal-title":"International Journal of Software Tools for Technology Transfer"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Berhmann","year":"2004","unstructured":"Berhmann, G., David, A., Larsen, K.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) Formal Methods for the Design of Real-Time Systems. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","first-page":"553","volume-title":"Algebraic Methodology and Software Technology","author":"F. Wang","year":"2004","unstructured":"Wang, F.: Model-checking distributed real-time systems with states, events, and multiple fairness assumptions. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 553\u2013568. Springer, Heidelberg (2004)"},{"key":"15_CR5","volume-title":"PSTV XIII, 13th Protocol Spec., Testing & Verification","author":"T. Regan","year":"1993","unstructured":"Regan, T.: Multimedia in temporal LOTOS: A lip synchronisation algorithm. In: PSTV XIII, 13th Protocol Spec. Testing & Verification, North-Holland, Amsterdam (1993)"},{"key":"15_CR6","first-page":"64","volume-title":"Proceedings of SEFM 2005","author":"B. Gebremichael","year":"2005","unstructured":"Gebremichael, B., Vaandrager, F.: Specifying Urgency in Timed I\/O Automata. In: Proceedings of SEFM 2005, pp. 64\u201373. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-540-39979-7_12","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2003","author":"R. Gomez","year":"2003","unstructured":"Gomez, R., Bowman, H.: Discrete timed automata and MONA: Description, specification and verification of a multimedia stream. In: K\u00f6nig, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol.\u00a02767, pp. 177\u2013192. Springer, Heidelberg (2003)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-49213-5_5","volume-title":"Compositionality: The Significant Difference","author":"S. Bornot","year":"1998","unstructured":"Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 103\u2013129. Springer, Heidelberg (1998)"},{"key":"15_CR9","first-page":"119","volume-title":"Proceedings of FORTE 2001","author":"H. Bowman","year":"2001","unstructured":"Bowman, H.: Time and action lock freedom properties for timed automata. In: Proceedings of FORTE 2001, pp. 119\u2013134. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"3","key":"15_CR10","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":"15_CR11","unstructured":"Gomez, R.: Verification of Real-Time Systems: Improving Tool Support. PhD thesis, Computing Laboratory, University of Kent (October 2006)"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00165-006-0010-7","volume":"18","author":"H. Bowman","year":"2006","unstructured":"Bowman, H., Gomez, R.: How to stop time stopping. Formal Aspects of Computing\u00a018(4), 459\u2013493 (2006)","journal-title":"Formal Aspects of Computing"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (1999)"},{"issue":"300","key":"15_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"1-3","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.: The power of reachability testing for timed automata. Theoretical Computer Science\u00a01-3(300), 411\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-540-40903-8_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M. Hendriks","year":"2004","unstructured":"Hendriks, M., Behrmann, G., Larsen, K., Niebert, P., Vaandrager, F.: Adding symmetry reduction to uppaal. In: Larsen, K., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 46\u201359. Springer, Heidelberg (2004)"},{"issue":"5-6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/s001650050032","volume":"10","author":"H. Bowman","year":"1998","unstructured":"Bowman, H., Faconti, G., Katoen, J.P., Latella, D., Massink, M.: Automatic verification of a lip synchronisation protocol using uppaal. Formal Aspects of Computing\u00a010(5-6), 550\u2013575 (1998)","journal-title":"Formal Aspects of Computing"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/BF01931370","volume":"16","author":"J. Szwarcfiter","year":"1976","unstructured":"Szwarcfiter, J., Lauer, P.: A search strategy for the elementary cycles of a directed graph. BIT\u00a016, 192\u2013204 (1976)","journal-title":"BIT"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1029133.1029137","volume-title":"Proceedings of FMSE 2004","author":"R. Corin","year":"2004","unstructured":"Corin, R., Etalle, S., Hartel, P.H., Mader, A.: Timed model checking of security protocols. In: Proceedings of FMSE 2004, pp. 23\u201332. ACM Press, New York (2004)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/1176887.1176923","volume-title":"Proceedings of EMSOFT 2006","author":"B. Gebremichael","year":"2006","unstructured":"Gebremichael, B., Vaandrager, F., Zhang, M.: Analysis of the zeroconf protocol using Uppaal. In: Proceedings of EMSOFT 2006, pp. 242\u2013251. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75454-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:56Z","timestamp":1619521316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75454-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754534","9783540754541"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75454-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}