{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:14:22Z","timestamp":1743027262073,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319229744"},{"type":"electronic","value":"9783319229751"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22975-1_13","type":"book-chapter","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T08:37:43Z","timestamp":1440146263000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Nested Timed Automata with Frozen Clocks"],"prefix":"10.1007","author":[{"given":"Guoqiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mizuhito","family":"Ogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoji","family":"Yuen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"key":"13_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 126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","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":"13_CR3","doi-asserted-by":"crossref","unstructured":"Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines. In: TIME 2010, pp. 61\u201368. IEEE (2010)","DOI":"10.1109\/TIME.2010.10"},{"key":"13_CR4","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":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-44618-4_12","volume-title":"CONCUR 2000 - Concurrency Theory","author":"F Cassez","year":"2000","unstructured":"Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138\u2013152. Springer, Heidelberg (2000)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Berard, B., Haddad, S., Sassolas, M.: Real time properties for interrupt timed automata. In: TIME 2010, pp. 69\u201376. IEEE (2010)","DOI":"10.1109\/TIME.2010.11"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Krishna, S.N., Manasa L., Trivedi, A.: What\u2019s decidable about recursive hybrid automata? In: HSCC 2015, pp. 31\u201340. ACM (2015)","DOI":"10.1109\/TIME.2015.27"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: LICS 2012, pp. 35\u201344. IEEE (2012)","DOI":"10.1109\/LICS.2012.15"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-07151-0_21","volume-title":"Functional and Logic Programming","author":"X Cai","year":"2014","unstructured":"Cai, X., Ogawa, M.: Well-structured pushdown system: case of dense timed pushdown automata. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 336\u2013352. Springer, Heidelberg (2014)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-40184-8_10","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"X Cai","year":"2013","unstructured":"Cai, X., Ogawa, M.: Well-structured pushdown systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol. 8052, pp. 121\u2013136. Springer, Heidelberg (2013)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Leroux, J., Praveen, M., Sutre, G.: Hyper-ackermannian bounds for pushdown vector addition systems. In: CSL-LICS 2014, pp. 63:1\u201363:10. IEEE (2014)","DOI":"10.1145\/2603088.2603146"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"TA Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. Information and Computation 111, 193\u2013244 (1994)","journal-title":"Information and Computation"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: LICS 2004, pp. 54\u201363. IEEE (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"13_CR14","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, pp. 298\u2013312. Springer, Heidelberg (1998)"},{"key":"13_CR15","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. Theoretical Computer Science 290, 241\u2013264 (2003)","journal-title":"Theoretical Computer Science"},{"key":"13_CR16","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T Henzinger","year":"1998","unstructured":"Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What\u2019s Decidable about Hybrid Automata? Journal of Computer and System Sciences 57, 94\u2013124 (1998)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22975-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:25:51Z","timestamp":1675873551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22975-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319229744","9783319229751"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22975-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}