{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:07Z","timestamp":1776333487525,"version":"3.51.2"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319670881","type":"print"},{"value":"9783319670898","type":"electronic"}],"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-67089-8_2","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:47:26Z","timestamp":1503578846000},"page":"9-25","source":"Crossref","is-referenced-by-count":2,"title":["Adding Dense-Timed Stack to Integer Reset Timed Automata"],"prefix":"10.1007","author":[{"given":"Devendra","family":"Bhave","sequence":"first","affiliation":[]},{"given":"Shibashis","family":"Guha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: LICS, pp. 35\u201344 (2012)","DOI":"10.1109\/LICS.2012.15"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S1567-8326(02)00022-X","volume":"52\u201353","author":"L Aceto","year":"2002","unstructured":"Aceto, L., Laroussinie, F.: Is your model checker on time? on the complexity of model checking for timed modal logics. J. Log. Algebr. Program. 52\u201353, 7\u201351 (2002)","journal-title":"J. Log. Algebr. Program."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Akshay, S., Gastin, P., Krishna, S.N.: Analyzing timed systems using tree automata. In: CONCUR, pp. 27:1\u201327:14 (2016)","DOI":"10.23638\/LMCS-14(2:8)2018"},{"key":"2_CR4","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.: A theory of timed automata. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-02930-1_4","volume-title":"Automata, Languages and Programming","author":"C Baier","year":"2009","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 43\u201354. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02930-1_4"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-30000-9_7","volume-title":"Language and Automata Theory and Applications","author":"D Bhave","year":"2016","unstructured":"Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A logical characterization for dense-time visibly pushdown automata. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 89\u2013101. Springer, Cham (2016). doi: 10.1007\/978-3-319-30000-9_7"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-662-53132-7_4","volume-title":"Developments in Language Theory","author":"D Bhave","year":"2016","unstructured":"Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A perfect class of context-sensitive timed languages. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 38\u201350. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53132-7_4"},{"key":"2_CR9","first-page":"64","volume":"II","author":"A Bouajjani","year":"1995","unstructured":"Bouajjani, A., Echahed, R., Robbana, R.: On the automatic verification of systems with continuous variables and unbounded discrete data structures. Hybrid Syst. II, 64\u201385 (1995)","journal-title":"Hybrid Syst."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Clemente, L., Lasota, S.: Timed pushdown automata revisited. In: LICS, pp. 738\u2013749 (2015)","DOI":"10.1109\/LICS.2015.73"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-44585-4_48","volume-title":"Computer Aided Verification","author":"Z Dang","year":"2001","unstructured":"Dang, Z.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 506\u2013517. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44585-4_48"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-20297-6_13","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Droste","year":"2015","unstructured":"Droste, M., Perevoshchikov, V.: A logical characterization of timed pushdown languages. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 189\u2013203. Springer, Cham (2015). doi: 10.1007\/978-3-319-20297-6_13"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-30206-3_7","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"D D\u2019Souza","year":"2004","unstructured":"D\u2019Souza, D., Tabareau, N.: On timed automata with input-determined guards. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 68\u201383. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30206-3_7"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"TA Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying similarities between timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 226\u2013241. Springer, Heidelberg (2005). doi: 10.1007\/11603009_18"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BFb0022257","volume-title":"Computer Science Logic","author":"C Lautemann","year":"1995","unstructured":"Lautemann, C., Schwentick, T., Th\u00e9rien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 205\u2013216. Springer, Heidelberg (1995). doi: 10.1007\/BFb0022257"},{"key":"2_CR16","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: 10.1007\/978-3-642-40229-6_12"},{"key":"2_CR17","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: 10.1007\/978-3-319-22975-1_13"},{"key":"2_CR18","unstructured":"Manasa, L., Krishna, S.N.: Integer reset timed automata: clock reduction and determinizability. CoRR, abs\/1001.1215 (2010)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Mohalik, A., Rajeev, C., Dixit, M.G., Ramesh, S., Suman, P.V., Pandya, P.K., Jiang, S.: Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts. In: DAC (2008)","DOI":"10.1145\/1391469.1391544"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-85778-5_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"PV Suman","year":"2008","unstructured":"Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed automata with integer resets: language inclusion and expressiveness. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 78\u201392. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85778-5_7"},{"key":"2_CR21","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: 10.1007\/978-3-642-15643-4_23"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T01:29:30Z","timestamp":1750814970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}