{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:41Z","timestamp":1742913521747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319312194"},{"type":"electronic","value":"9783319312200"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31220-0_11","type":"book-chapter","created":{"date-parts":[[2016,3,12]],"date-time":"2016-03-12T08:59:52Z","timestamp":1457773192000},"page":"147-161","source":"Crossref","is-referenced-by-count":1,"title":["On Reachability Analysis of Updatable Timed Automata with One Updatable Clock"],"prefix":"10.1007","author":[{"given":"Yunqing","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoji","family":"Yuen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_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. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_35","volume-title":"Computer Aided Verification","author":"P Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are timed automata updatable? In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-44612-5_19","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, \u00c9., Petit, A.: Expressiveness of updatable timed automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 232\u2013242. Springer, Heidelberg (2000)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theor. Comput. Sci. 321, 291\u2013345 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR5","unstructured":"Schwoon, S.: Model-checking pushdown system. Ph.D. thesis, Technical University of Munich (2000)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS\u201904), IEEE Computer Society, pp. 54\u201363 (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0054179","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"1998","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying Networks of Timed Processes (Extended Abstract). In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, p. 298. Springer, Heidelberg (1998)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"P Abdulla","year":"2003","unstructured":"Abdulla, P., Jonsson, B.: Model checking of systems with many identical time processes. Theor. Comput. Sci. 290, 241\u2013264 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-40229-6_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2013","unstructured":"Li, G., Cai, X., Ogawa, M., Yuen, S.: Nested timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 168\u2013182. Springer, Heidelberg (2013)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-22975-1_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2015","unstructured":"Li, G., Ogawa, M., Yuen, S.: Nested timed automata with frozen clocks. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 189\u2013205. Springer, Heidelberg (2015)"},{"key":"11_CR11","first-page":"371","volume":"5","author":"C Choffrut","year":"2000","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. J. Automata, Lang. Comb. 5, 371\u2013404 (2000)","journal-title":"J. Automata, Lang. Comb."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0055641","volume-title":"CONCUR \u201998 Concurrency Theory","author":"F Demichelis","year":"1998","unstructured":"Demichelis, F., Zielonka, W.: Controlled timed automata. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 455\u2013469. Springer, Heidelberg (1998)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-15643-4_23","volume-title":"Automated Technology for Verification and Analysis","author":"A Trivedi","year":"2010","unstructured":"Trivedi, A., Wojtczak, D.: Recursive timed automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 306\u2013324. Springer, Heidelberg (2010)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-319-17404-4_5","volume-title":"Structured Object-Oriented Formal Language and Method","author":"Y Wen","year":"2015","unstructured":"Wen, Y., Li, G., Yuen, S.: An over-approximation forward analysis for nested timed automata. In: Liu, S., Duan, Z. (eds.) SOFL+MSVL 2014. LNCS, vol. 8979, pp. 62\u201380. Springer, Heidelberg (2015)"},{"key":"11_CR15","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Upper Saddle River (1967)"},{"key":"11_CR16","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 24, 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Fang, B., Li, G., Fang, L., Xiang, J.: A refined algorithm for reachability analysis of updatable timed automata. In: Proceedings of the 1st IEEE International Workshop on Software Engineering and Knowledge Management (SEKM 2015 @ QRS 2015), IEEE Computer Society, pp. 230\u2013236 (2015)","DOI":"10.1109\/QRS-C.2015.47"}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31220-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:31:44Z","timestamp":1559399504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31220-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319312194","9783319312200"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31220-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}