{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:04:33Z","timestamp":1746079473203,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_50","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T01:19:21Z","timestamp":1232587161000},"page":"558-569","source":"Crossref","is-referenced-by-count":8,"title":["Event-Clock Visibly Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Nguyen","family":"Van Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mizuhito","family":"Ogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1007\/11523468_88","volume-title":"Automata, Languages and Programming","author":"P.A. Abdulla","year":"2005","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and complexity results for timed automata via channel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1089\u20131101. Springer, Heidelberg (2005)"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"A. Alur","year":"1994","unstructured":"Alur, A., Dill, D.: A theory of timed automata. Theor. Comp. Sci.\u00a0126, 183\u2013235 (1994)","journal-title":"Theor. Comp. Sci."},{"key":"#cr-split#-50_CR3.1","doi-asserted-by":"crossref","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. Theor. Comp. Sci??211, 253???273 (1999);","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"#cr-split#-50_CR3.2","unstructured":"A preliminary version appeared In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.??818, pp. 1???13. Springer, Heidelberg (1994)"},{"key":"50_CR4","first-page":"202","volume-title":"STOC 2004","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, June 13-15, 2004, pp. 202\u2013211. ACM Press, New York (2004)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-60472-3_4","volume-title":"Hybrid Systems 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. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol.\u00a0999, pp. 64\u201385. Springer, Heidelberg (1995)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Laroussinie, F.: Model Checking Timed Automata. In: Modeling and Verification of Real-Time Systems, pp. 111\u2013140. ISTE Ltd. - John Wiley & Sons, Ltd. (2008)","DOI":"10.1002\/9780470611012.ch4"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Model Checking One-clock Priced Timed Automata. Logical Methods in Computer Science 4(2:9) (2008)","DOI":"10.2168\/LMCS-4(2:9)2008"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11730637_17","volume-title":"Hybrid Systems: Computation and Control","author":"M. Emmi","year":"2006","unstructured":"Emmi, M., Majumdar, R.: Decision Problems for the Verification of Real-time Software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.\u00a03927, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"50_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theor. Comp. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comp. Sci."},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Raskin, J., Schobbens, P.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013598. Springer, Heidelberg (1998)"},{"key":"50_CR11","first-page":"54","volume-title":"LICS 2004","author":"J. Ouaknine","year":"2004","unstructured":"Ouaknine, J., Worrell, J.: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: LICS 2004, pp. 54\u201363. IEEE Press, Los Alamitos (2004)"},{"issue":"4","key":"50_CR12","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. International Journal of Foundation for Computer Science\u00a014(4), 625\u2013640 (2003)","journal-title":"International Journal of Foundation for Computer Science"},{"key":"50_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 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 68\u201383. Springer, Heidelberg (2004)"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-77505-8_20","volume-title":"Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues","author":"N.V. Tang","year":"2008","unstructured":"Tang, N.V., Hung, D.V., Ogawa, M.: Modeling Urgency in Component-Based Real-time Systems. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol.\u00a04435, pp. 248\u2013255. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T08:22:12Z","timestamp":1558081332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}