{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:57:35Z","timestamp":1743134255370,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686899"},{"type":"electronic","value":"9783319686905"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68690-5_24","type":"book-chapter","created":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T21:14:51Z","timestamp":1507583691000},"page":"396-412","source":"Crossref","is-referenced-by-count":0,"title":["Nested Timed Automata with Diagonal Constraints"],"prefix":"10.1007","author":[{"given":"Yuwei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunqing","family":"Wen","sequence":"additional","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","published-online":{"date-parts":[[2017,10,11]]},"reference":[{"key":"24_CR1","volume-title":"Real-Time Systems: Specification, Verification, and Analysis","author":"J Mattai","year":"1995","unstructured":"Mattai, J.: Real-Time Systems: Specification, Verification, and Analysis. Prentice Hall, Englewood Cliffs (1995)"},{"key":"24_CR2","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR3","doi-asserted-by":"crossref","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. Inf. Comput. 111, 193\u2013244 (1994)","journal-title":"Inf. Comput."},{"key":"24_CR4","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 Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27755-2_3"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Clemente, L., Lasota, S.: Timed pushdown automata, revisited. In: Proceedings of LICS 2015, pp. 738\u2013749","DOI":"10.1109\/LICS.2015.73"},{"key":"24_CR6","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). doi:\n10.1007\/978-3-642-40229-6_12"},{"key":"24_CR7","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, Cham (2015). doi:\n10.1007\/978-3-319-22975-1_13"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-47677-3_10","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"B Fang","year":"2016","unstructured":"Fang, B., Li, G., Sun, D., Cai, H.: Schedulability analysis of timed regular tasks by under-approximation on WCET. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 147\u2013162. Springer, Cham (2016). doi:\n10.1007\/978-3-319-47677-3_10"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Berard, B., Haddad, S., Sassolas, M.: Real time properties for interrupt timed automata. In: Proceedings of TIME 2010, pp. 69\u201376. IEEE Computer Society (2010)","DOI":"10.1109\/TIME.2010.11"},{"key":"24_CR10","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). doi:\n10.1007\/978-3-642-15643-4_23"},{"key":"24_CR11","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of LICS 2004, pp. 54\u201363. IEEE Computer Society (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"24_CR13","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. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298\u2013312. Springer, Heidelberg (1998). doi:\n10.1007\/BFb0054179"},{"key":"24_CR14","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 290, 241\u2013264 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR15","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, Cham (2014). doi:\n10.1007\/978-3-319-07151-0_21"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: Proceedings of LICS 2012, pp. 35\u201344. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.15"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-28332-1_6","volume-title":"Language and Automata Theory and Applications","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: The minimal cost reachability problem in priced timed pushdown systems. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 58\u201369. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-28332-1_6"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification","author":"R Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 207\u2013220. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44585-4_18"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines, pp. 61\u201368. In: Proceedings of the TIME 2010. IEEE Computer Society (2010)","DOI":"10.1109\/TIME.2010.10"},{"key":"24_CR20","first-page":"51","volume":"24","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Li, G., Yuen, S.: Nested timed automata with various clocks. Sci. Found. Chin. 24, 51\u201368 (2016)","journal-title":"Sci. Found. Chin."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Tian, C., Duan, Z.: Detecting spurious counterexamples efficiently in abstract model checking. In: Proceedings of the ICSE 2013, pp. 202\u2013211. IEEE\/ACM (2013)","DOI":"10.1109\/ICSE.2013.6606566"},{"key":"24_CR22","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1109\/TSE.2014.2357442","volume":"40","author":"C Tian","year":"2014","unstructured":"Tian, C., Duan, Z., Duan, Z.: Making CEGAR more efficient in software model checking. IEEE Trans. Softw. Eng. 40, 1206\u20131223 (2014)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"24_CR23","unstructured":"Liu, Y., Duan, Z., Tian, C.: A decision procedure for a fragment of linear time Mu-calculus. In: Proceedings of the IJCAI 2016, pp. 1195\u20131201. IJCAI\/AAAI Press (2016)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68690-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T08:21:27Z","timestamp":1507796487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68690-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686899","9783319686905"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68690-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}