Reachability problem for weak multi-pushdown automata

Logical Methods in Computer Science

Volumn 9, Issue 3, 2013, Pages

  Czerwiński, Wojciech ^a   Hofman, Piotr ^b   Lasota, Sławomir ^b  

^a UNIVERSITY OF BAYREUTH   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Multi pushdown automata; Pushdown automata; Reachability; Regular sets

Indexed keywords

BACKWARD REACHABILITY; MULTI-PUSHDOWN AUTOMATA; PUSH-DOWN AUTOMATA; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY PROBLEM; REGULAR SETS; VECTOR ADDITION SYSTEMS;

COMMUNICATION; COMPUTABILITY AND DECIDABILITY; PETRI NETS; VECTORS;

AUTOMATA THEORY;

EID: 84884855038     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-9(3:13)2013     Document Type: Article

References (28)

1. M. Faouzi Atig. From multi to single stack automata. In CONCUR, pages 117-131, 2010.
2. M. Faouzi Atig and A. Bouajjani. On the reachability problem for dynamic networks of concurrent pushdown systems. In RP, pages 1-2, 2009.
3. M. Faouzi Atig, A. Bouajjani, and S. Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science, 7(4), 2011.
4. Pablo Barcelo, Diego Figueira, and Leonid Libkin. Graph logics with rational relations and the generalized intersection problem. In LICS, pages 115-124, 2012.
5. J. Berstel. Transductions and Context-Free Languages. Teubner Verlag, 1979.
6. A. Bouajjani and M. Emmi. Analysis of recursively parallel programs. In POPL, pages 203-214, 2012.
7. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, pages 135-150, 1997.
8. A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejcek. Reachability analysis of multithreaded software with asynchronous communication. In Software Verification: Infinite-State Model Checking and Static Program Analysis, 2006.
9. A. Bouajjani, M. Muller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR, pages 473-487, 2005.
10. O. Burkart, D. Caucal, F Moller, and B. Steffen. Verification of infinite structures. In Handbook of Process Algebra, pages 545-623. Elevier, 2001.
11. R. Chadha, P. Madhusudan, and M. Viswanathan. Reachability under contextual locking. In TACAS, pages 437-450, 2012.
12. S. Christensen. Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK, 1993.
13. W. Czerwiński. Partially-commutative context-free graphs. PhD thesis, Dept. of Mathematics, Informatics and Mechanics, University of Warsaw, 2013.
14. W. Czerwiński, S. Froschle, and S. Lasota. Partially-commutative context-free processes. In Proc. CON-CUR'09, volume 5710 of LNCS, pages 259-273. Springer-Verlag, 2009.
15. W. Czerwiński, S. Froschle, and S. Lasota. Partially-commutative context-free processes: expressibility and tractability. Information and Computation, 209:782-798, 2011.
16. W. Czerwiński, P. Hofman, and S. Lasota. Reachability problem for weak multi-pushdown automata. In CONCUR, pages 53-68, 2012.
17. W. Czerwiński and S. Lasota. Partially-commutative context-free languages. In DCM, pages 35-48, 2012.
18. V. Diekert and G. Rozenberg. The book of traces. World Scientific, 1995.
19. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform., 31(1):13-25, 1997.
20. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
21. Dung T. Huynh. Commutative grammars: The complexity of uniform word problems. Information and Control, 57(1):21-39, 1983.
22. V. Kahlon. Reasoning about threads with bounded lock chains. In CONCUR, pages 450-465, 2011.
23. V. Kahlon, F. Ivancic, and A. Gupta. Reasoning about threads communicating via locks. In CAV, pages 505-518, 2005.
24. M. Kretinsky, V. Rehak, and J. Strejcek. Reachability is decidable for weakly extended process rewrite systems. Inf. Comput., 207(6):671-680, 2009.
25. A. Lal and T. W. Reps. Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design, 35(1):73-97, 2009.
26. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. Theor. Comput. Sci., 274(1-2):89-115, 2002.
27. R. Mayr. Process rewrite systems. Inf. Comput., 156(1-2):264-286, 2000.
28. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, pages 93-107, 2005.