{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:05:12Z","timestamp":1746079512010,"version":"3.37.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"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-30000-9_7","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T16:45:50Z","timestamp":1456418750000},"page":"89-101","source":"Crossref","is-referenced-by-count":6,"title":["A Logical Characterization for Dense-Time Visibly Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Devendra","family":"Bhave","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vrunda","family":"Dave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramchandra","family":"Phawade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashutosh","family":"Trivedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Atig, M., Stenman, J.: Dense-timed pushdown automata. In: LICS, pp. 35\u201344 (2012)","DOI":"10.1109\/LICS.2012.15"},{"key":"7_CR2","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. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"7_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. TCS 211(1\u20132), 253\u2013273 (1999)","journal-title":"TCS"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Symposium on Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"7_CR5","unstructured":"Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A logical characterization for dense-time visibly pushdown automata. Technical report, IIT Bombay (2015). \n                      http:\/\/www.cse.iitb.ac.in\/internal\/techreports\/reports\/TR-CSE-2015-77.pdf"},{"key":"7_CR6","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"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1142\/S0129054103001923","volume":"14","author":"D D\u2019Souza","year":"2003","unstructured":"D\u2019Souza, D.: A logical characterisation of event clock automata. Int. J. Found. Comput. Sci. 14(4), 625\u2013640 (2003). \n                      http:\/\/dx.doi.org\/10.1142\/S0129054103001923","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR8","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.) Computer Science Logic. LNCS, vol. 933, pp. 205\u2013216. Springer, Heidelberg (1995)"},{"key":"7_CR9","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":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-95891-8_50","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"N Tang Van","year":"2009","unstructured":"Van Tang, N., Ogawa, M.: Event-clock visibly pushdown automata. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 558\u2013569. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:53:23Z","timestamp":1559390003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}