{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:46:12Z","timestamp":1770813972129,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662488980","type":"print"},{"value":"9783662488997","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_18","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T03:59:28Z","timestamp":1448078368000},"page":"249-265","source":"Crossref","is-referenced-by-count":1,"title":["Synchronized Recursive Timed Automata"],"prefix":"10.1007","author":[{"given":"Yuya","family":"Uezato","sequence":"first","affiliation":[]},{"given":"Yasuhiko","family":"Minamide","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Atig, M., Stenman, J.: Dense-timed pushdown automata. In: LICS 2012, pp. 35\u201344. IEEE (2012)","DOI":"10.1109\/LICS.2012.15"},{"issue":"2","key":"18_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. TCS 126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines. In: TIME, pp. 61\u201368. IEEE (2010)","DOI":"10.1109\/TIME.2010.10"},{"issue":"2","key":"18_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundam. Inf. 36(2), 145\u2013182 (1998)","journal-title":"Fundam. Inf."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, j (eds.) CONCUR \u201997: Concurrency Theory. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"issue":"2\u20133","key":"18_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. TCS 321(2\u20133), 291\u2013345 (2004)","journal-title":"TCS"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.: Regular canonical systems. Arch. Math. Logik Grundlag 6, 91\u2013111 (1964)","journal-title":"Arch. Math. Logik Grundlag"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Clemente, L., Lasota, S.: Timed pushdown automata revisited. In: LICS 2015, pp. 738\u2013749. IEEE (2015)","DOI":"10.1109\/LICS.2015.73"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY 1997, pp. 27\u201337. Elsevier (1997)","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Krishna, S., Manasa, L., Trivedi, A.: What\u2019s decidable about recursive hybrid automata? In: HSCC 2015, pp. 31\u201340. ACM (2015)","DOI":"10.1109\/TIME.2015.27"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations. Inf. Comp. 121(2), 214\u2013233 (1995)","journal-title":"Inf. Comp."},{"key":"18_CR12","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":"18_CR13","unstructured":"Uezato, Y., Minamide, Y.: Synchronized recursive timed automata (2015). http:\/\/score.cs.tsukuba.ac.jp\/~uezato\/SRTA.pdf"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T17:22:18Z","timestamp":1599844938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}