{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:10:21Z","timestamp":1739311821949,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044199"},{"type":"electronic","value":"9783642044205"}],"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-642-04420-5_13","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T02:17:25Z","timestamp":1251339445000},"page":"127-140","source":"Crossref","is-referenced-by-count":1,"title":["Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order"],"prefix":"10.1007","author":[{"given":"Denis","family":"Lugiez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BFb0014706","volume-title":"CONCUR\u201997: Concurrency Theory","author":"O. Maler","year":"1997","unstructured":"Maler, O., Bouajjani, A., Esparza, J.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 14\u201325. Springer, Heidelberg (1997)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Buchi, R.: Regular canonical systems. Archiv fur Matematische Logik und Grundlagenforschung\u00a06(91-111) (1964)","DOI":"10.1007\/BF01969548"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-46432-8_4","volume-title":"Foundation of Software Science and Computation Structures","author":"D. Caucal","year":"2000","unstructured":"Caucal, D.: On word rewriting systems having a rational derivation. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 48\u201362. Springer, Heidelberg (2000)"},{"key":"13_CR5","unstructured":"Comon, H., Dauchet, M., Jacquemard, F., Loeding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata on their application. Freeware Book (1999), http:\/\/tata.gforge.inria.fr\/"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre $^{\\mbox{*}}$ and post $^{\\mbox{*}}$ on interprocedural parallel flow graphs. In: POPL, pp. 1\u201311 (2000)","DOI":"10.1145\/325694.325697"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"13_CR8","first-page":"303","volume-title":"POPL","author":"V. Kahlon","year":"2007","unstructured":"Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 303\u2013314. ACM, New York (2007)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02658-4_39","volume-title":"Proc. of 21st Conf. on Computer Aided Verification (CAV)","author":"P. Lammich","year":"2009","unstructured":"Lammich, P., M\u00fcller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Proc. of 21st Conf. on Computer Aided Verification (CAV). LNCS, vol.\u00a05643, pp. 525\u2013539. Springer, Heidelberg (2009)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0055615","volume-title":"CONCUR \u201998 Concurrency Theory","author":"D. Lugiez","year":"1998","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on pa-processes. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 50\u201366. Springer, Heidelberg (1998)"},{"key":"13_CR11","unstructured":"Presburger, M.: Uber die vollstandigkeit eines gewissen system der arithmetik ganzer zahlen in welchem die addition als einzige operation hervortritt. In: Comptes Rendus du I Congres des Mathematiciens des Pays Slaves, Warszawa (1929)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44898-5_11","volume-title":"Static Analysis","author":"T.W. Reps","year":"2003","unstructured":"Reps, T.W., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 189\u2013213. Springer, Heidelberg (2003)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11532231_25","volume-title":"Automated Deduction \u2013 CADE-20","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 337\u2013352. Springer, Heidelberg (2005)"},{"issue":"5","key":"13_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00200-006-0016-7","volume":"17","author":"S.D. Zilio","year":"2006","unstructured":"Zilio, S.D., Lugiez, D.: XML schema, tree logic and sheaves automata. Applicable Algebra in Engineering, Communication and Computing\u00a017(5), 337\u2013377 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04420-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:47:27Z","timestamp":1739310447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04420-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044199","9783642044205"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04420-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}