{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:30:48Z","timestamp":1725701448113},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_6","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:47:02Z","timestamp":1346532422000},"page":"53-68","source":"Crossref","is-referenced-by-count":3,"title":["Reachability Problem for Weak Multi-Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Hofman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-15375-4_9","volume-title":"CONCUR 2010 - Concurrency Theory","author":"M.F. Atig","year":"2010","unstructured":"Atig, M.F.: From Multi to Single Stack Automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 117\u2013131. Springer, Heidelberg (2010)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04420-5_1","volume-title":"Reachability Problems","author":"M.F. Atig","year":"2009","unstructured":"Atig, M.F., Bouajjani, A.: On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. In: Bournez, O., Potapov, I. (eds.) RP 2009. LNCS, vol.\u00a05797, pp. 1\u20132. Springer, Heidelberg (2009)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science\u00a07(4) (2011)","DOI":"10.2168\/LMCS-7(4:4)2011"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: POPL, pp. 203\u2013214 (2012)","DOI":"10.1145\/2103621.2103681"},{"key":"6_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 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Software Verification: Infinite-State Model Checking and Static Program Analysis (2006)","DOI":"10.1007\/11590156_28"},{"key":"6_CR7","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":"6_CR8","doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification of infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28756-5_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Chadha","year":"2012","unstructured":"Chadha, R., Madhusudan, P., Viswanathan, M.: Reachability under Contextual Locking. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol.\u00a07214, pp. 437\u2013450. Springer, Heidelberg (2012)"},{"key":"6_CR10","unstructured":"Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science. University of Edinburgh, UK (1993)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-04081-8_18","volume-title":"CONCUR 2009 - Concurrency Theory","author":"W. Czerwi\u0144ski","year":"2009","unstructured":"Czerwi\u0144ski, W., Fr\u00f6schle, S., Lasota, S.: Partially-Commutative Context-Free Processes. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 259\u2013273. Springer, Heidelberg (2009)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ic.2010.12.003","volume":"209","author":"W. Czerwi\u0144ski","year":"2011","unstructured":"Czerwi\u0144ski, W., Fr\u00f6schle, S., Lasota, S.: Partially-commutative context-free processes: expressibility and tractability. Information and Computation\u00a0209, 782\u2013798 (2011)","journal-title":"Information and Computation"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Lasota, S.: Partially-commutative context-free languages (submitted, 2012)","DOI":"10.4204\/EPTCS.89.4"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G.: The book of traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"issue":"1","key":"6_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"Huynh, D.T.: Commutative grammars: The complexity of uniform word problems. Information and Control\u00a057(1), 21\u201339 (1983)","journal-title":"Information and Control"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-23217-6_30","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"V. Kahlon","year":"2011","unstructured":"Kahlon, V.: Reasoning about Threads with Bounded Lock Chains. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 450\u2013465. Springer, Heidelberg (2011)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/11513988_49","volume-title":"Computer Aided Verification","author":"V. Kahlon","year":"2005","unstructured":"Kahlon, V., Ivan\u010di\u0107, F., Gupta, A.: Reasoning About Threads Communicating via Locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 505\u2013518. Springer, Heidelberg (2005)"},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.ic.2009.01.003","volume":"207","author":"M. Kret\u00ednsk\u00fd","year":"2009","unstructured":"Kret\u00ednsk\u00fd, M., Reh\u00e1k, V., Strejcek, J.: Reachability is decidable for weakly extended process rewrite systems. Inf. Comput.\u00a0207(6), 671\u2013680 (2009)","journal-title":"Inf. Comput."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10703-009-0078-9","volume":"35","author":"A. Lal","year":"2009","unstructured":"Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design\u00a035(1), 73\u201397 (2009)","journal-title":"Formal Methods in System Design"},{"issue":"1-2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. Theor. Comput. Sci.\u00a0274(1-2), 89\u2013115 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput.\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-Bounded Model Checking of Concurrent Software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 93\u2013107. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:42Z","timestamp":1620128982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}