{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:00:30Z","timestamp":1725861630019},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"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"},{"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-662-53132-7_4","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"38-50","source":"Crossref","is-referenced-by-count":4,"title":["A Perfect Class of Context-Sensitive Timed Languages"],"prefix":"10.1007","author":[{"given":"Devendra","family":"Bhave","sequence":"first","affiliation":[]},{"given":"Vrunda","family":"Dave","sequence":"additional","affiliation":[]},{"given":"S. N.","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"Ramchandra","family":"Phawade","sequence":"additional","affiliation":[]},{"given":"Ashutosh","family":"Trivedi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"4_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":"4_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.: A theory of timed automata. TCS 126, 183\u2013235 (1994)","journal-title":"TCS"},{"issue":"1\u20132","key":"4_CR3","doi-asserted-by":"crossref","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":"4_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"},{"issue":"3","key":"4_CR5","first-page":"1","volume":"8","author":"MF Atig","year":"2012","unstructured":"Atig, M.F.: Model-checking of ordered multi-pushdown automata. Log. Methods Comput. Sci. 8(3), 1\u201331 (2012)","journal-title":"Log. Methods Comput. Sci."},{"key":"4_CR6","first-page":"143","volume":"14","author":"Y Bar-Hillel","year":"1961","unstructured":"Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143\u2013172 (1961)","journal-title":"Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft und Kommunikationsforschung"},{"key":"4_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, Heidelberg (2016). doi: 10.1007\/978-3-319-30000-9_7"},{"key":"4_CR8","unstructured":"Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A perfect class of context-sensitive timed languages. Technical report, IIT Bombay (2016). www.cse.iitb.ac.in\/internal\/techreports\/reports\/TR-CSE-2016-80.pdf"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-642-32940-1_6","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"W Czerwi\u0144ski","year":"2012","unstructured":"Czerwi\u0144ski, W., Hofman, P., Lasota, S.: Reachability problem for weak multi-pushdown automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 53\u201368. Springer, Heidelberg (2012)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: A perfect model for bounded verification. In: LICS, pp. 285\u2013294. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.39"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161\u2013170 (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-319-09698-8_11","volume-title":"Developments in Language Theory","author":"S Torre La","year":"2014","unstructured":"La Torre, S., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 116\u2013128. Springer, Heidelberg (2014)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-662-44522-8_32","volume-title":"Mathematical Foundations of Computer Science 2014","author":"S Torre La","year":"2014","unstructured":"La Torre, S., Napoli, M., Parlato, G.: A unifying approach for multistack pushdown automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 377\u2013389. Springer, Heidelberg (2014)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-642-12200-2_10","volume-title":"LATIN 2010: Theoretical Informatics","author":"S Torre La","year":"2010","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: The language theory of bounded context-switching. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 96\u2013107. Springer, Heidelberg (2010)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:55Z","timestamp":1498315555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}