{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:04:58Z","timestamp":1746079498509},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071503"},{"type":"electronic","value":"9783319071510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07151-0_21","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T23:30:14Z","timestamp":1400715014000},"page":"336-352","source":"Crossref","is-referenced-by-count":4,"title":["Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Xiaojuan","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mizuhito","family":"Ogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0054179","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"1998","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 298\u2013312. Springer, Heidelberg (1998)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, F.: Dense-Timed Pushdown Automata. In: IEEE LICS 2012, pp. 35\u201344 (2012)","DOI":"10.1109\/LICS.2012.15"},{"issue":"1-2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, C., Yih-Kuen, T.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical time processes. Theoretical Computer Science\u00a0290(1), 241\u2013264 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR5","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. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","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":"21_CR7","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 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Cai, X., Ogawa, M.: Well-Structured Pushdown Systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol.\u00a08052, pp. 121\u2013136. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40184-8_10"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-74407-8_10","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"R. Chadha","year":"2007","unstructured":"Chadha, R., Viswanathan, M.: Decidability results for well-structured transition systems with auxiliary storage. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 136\u2013150. Springer, Heidelberg (2007)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","volume":"302","author":"Z. Dang","year":"2003","unstructured":"Dang, Z.: Pushdown timed automata:a binary reachability characterization and safety verification. Theoretical Computer Science\u00a0302, 93\u2013121 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","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)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J. Esparza","year":"2003","unstructured":"Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Information and Computation\u00a0186(2), 355\u2013376 (2003)","journal-title":"Information and Computation"},{"issue":"1-2","key":"21_CR14","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! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems (extended abstract). In: INFINITY 1997. ENTCS, vol.\u00a09 (1997)","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-40229-6_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G. Li","year":"2013","unstructured":"Li, G., Cai, X., Ogawa, M., Yuen, S.: Nested Timed Automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol.\u00a08053, pp. 168\u2013182. Springer, Heidelberg (2013)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"1999","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156, 264\u2013286 (1999)","journal-title":"Information and Computation"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: IEEE LICS 2004, pp. 54\u201363 (2004)","DOI":"10.1109\/LICS.2004.1319600"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07151-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T18:23:39Z","timestamp":1558895019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07151-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319071503","9783319071510"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07151-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}