{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:24:28Z","timestamp":1742934268854,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031095733"},{"type":"electronic","value":"9783031095740"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_16","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"256-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Determinization of\u00a0Event-Clock Input-Driven Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Mizuhito","family":"Ogawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25\u201328, 2012, pp. 35\u201344. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/LICS.2012.15","key":"16_CR1","DOI":"10.1109\/LICS.2012.15"},{"issue":"2","key":"16_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.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"16_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. Theor. Comput. Sci. 211(1\u20132), 253\u2013273 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(97)00173-4","journal-title":"Theor. Comput. Sci."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1\u201324. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_1"},{"doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13\u201316, 2004, pp. 202\u2013211. ACM (2004). https:\/\/doi.org\/10.1145\/1007352.1007390","key":"16_CR5","DOI":"10.1145\/1007352.1007390"},{"doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16:1\u201316:43 (2009). https:\/\/doi.org\/10.1145\/1516512.1516518","key":"16_CR6","DOI":"10.1145\/1516512.1516518"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0020949","volume-title":"Hybrid Systems III","author":"J Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL\u2014a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 232\u2013243. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0020949"},{"key":"16_CR8","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). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_7"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-77313-1_6","volume-title":"Language and Automata Theory and Applications","author":"L Bozzelli","year":"2018","unstructured":"Bozzelli, L., Murano, A., Peron, A.: Event-clock nested automata. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 80\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_6"},{"doi-asserted-by":"publisher","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in log n space. In: Karplnski, M., van Leeuwen, J. (eds.) Topics in the Theory of Computation, North-Holland Mathematics Studies, vol. 102, pp. 1\u201319. North-Holland (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73072-X","key":"16_CR10","DOI":"10.1016\/S0304-0208(08)73072-X"},{"doi-asserted-by":"publisher","unstructured":"Clemente, L., Lasota, S.: Timed pushdown automata revisited. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6\u201310 July 2015, pp. 738\u2013749. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/LICS.2015.73","key":"16_CR11","DOI":"10.1109\/LICS.2015.73"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s10703-014-0212-1","volume":"45","author":"G Geeraerts","year":"2014","unstructured":"Geeraerts, G., Raskin, J.-F., Sznajder, N.: On regions and zones for event-clock automata. Formal Methods Syst. Des. 45(3), 330\u2013380 (2014). https:\/\/doi.org\/10.1007\/s10703-014-0212-1","journal-title":"Formal Methods Syst. Des."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-30538-5_34","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"C L\u00f6ding","year":"2004","unstructured":"L\u00f6ding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408\u2013420. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_34"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","volume-title":"Automata, Languages and Programming","author":"K Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422\u2013435. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_89"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-31644-9_13","volume-title":"Languages Alive","author":"A Okhotin","year":"2012","unstructured":"Okhotin, A., Piao, X., Salomaa, K.: Descriptional complexity of input-driven pushdown automata. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 186\u2013206. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31644-9_13"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2636805.2636821","volume":"45","author":"A Okhotin","year":"2014","unstructured":"Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45(2), 47\u201367 (2014). https:\/\/doi.org\/10.1145\/2636805.2636821","journal-title":"SIGACT News"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-79416-3_21","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Okhotin","year":"2021","unstructured":"Okhotin, A., Selivanov, V.L.: Input-driven pushdown automata on well-nested infinite strings. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 349\u2013360. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_21"},{"doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14\u201317 July 2004, Turku, Finland, Proceedings, pp. 54\u201363. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/LICS.2004.1319600","key":"16_CR18","DOI":"10.1109\/LICS.2004.1319600"},{"key":"16_CR19","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 Van Tang","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). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_50"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:03:48Z","timestamp":1656284628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}