The complexity of verifying ground tree rewrite systems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 279-288

  Göller, Stefan ^a   Lin, Anthony Widjaja ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; FINITE SYSTEMS; FOLLOWING PROBLEM; INFINITE SYSTEM; PROCESS REWRITE SYSTEMS; PUSHDOWN SYSTEMS; REWRITE SYSTEMS; THREE PROBLEMS; UPPER BOUND; WEAK BISIMILARITY;

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; PLANT EXTRACTS;

MODEL CHECKING;

EID: 80052181488     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.36     Document Type: Conference Paper

References (26)

1. E. Allender, M. Koucky, D. Ronneburger and S. Roy. The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. To appear at JCSS'10.
2. A. Bouajjani, J. Esparza and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In CONCUR'97, p. 135-150.
3. A. Bouajjani, M. Müller-Olm and T. Touili. Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In CONCUR'05, p. 473-487.
4. W. S. Brainerd. Tree Generating Regular Systems. Information and Control, 14(2):217-231, 1969.
5. D. Caucal. On infinite transition graphs having a decidable monadic theory. TCS 290(1):79-115, 2003. (Pubitemid 35264419)
6. H. Comon et al. Tree Automata Techniques and Applications. Available at: http://www.grappa.univ-lille3.fr/tata.
7. J.-L. Coquidé, M. Dauchet, R. Gilleron and S. Vágvö lgyi. Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theor. Comput. Sci., 127(1):69-98, 1994.
8. M. Dauchet, T. Heuillard, P. Lescanne and S. Tison. Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Inf. Comput., 88(2):187-201, 1990. (Pubitemid 20735593)
9. M. Dauchet and S. Tison. The Theory of Ground Rewrite Systems is Decidable. In LICS'90, p. 242-248.
10. * on interprocedural parallel flow graphs. In POPL'00, p. 1-11.
11. P. Jancar, A. Kucera and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci., 258(1-2):409-433, 2001. (Pubitemid 32676684)
12. V. Kahlon and A. Gupta. On the analysis of interacting pushdown systems. In POPL'07, p. 303-314.
13. A. Kucera and R. Mayr. On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes. Inf. Comput., 208(7):772-796, 2010.
14. C. Löding. Infinite Graphs Generated by Tree Rewriting. PhD Thesis, RWTH Aachen, 2003.
15. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. Theor. Comput. Sci., 274(1-2):89-115, 2002. (Pubitemid 34189251)
16. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, TU-Munich, 1998.
17. D. E. Muller and P. E. Schupp. The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci., 37:51-75, 1985.
18. C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
19. S. Qadeer and J. Rehof. Context-Bounded Model Checking of Concurrent Software. In TACAS'05, p. 93-107.
20. J. Srba. Roadmap of Infinite Results. Bulletin of the EATCS, 78:163-175, 2002. Updated version: http://www.brics.dk/~srba/roadmap/
21. L. J. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD Thesis, MIT, 1974.
22. S. Tison. Fair Termination is Decidable for Ground Systems. In RTA'89, p. 462-476.
23. A. W. To and L. Libkin. Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. In FoSSaCS'10, p. 221-236.
24. A. W. To. Model Checking Infinite-State Systems: Generic and Specific Approaches. PhD Thesis, University of Edinburgh, 2010.
25. I. Walukiewicz. Pushdown Processes: Games and Model Checking. In CAV'96, pages 62-74.
26. I. Walukiewicz. Model Checking CTL Properties of Pushdown Systems. In FSTTCS'00, p.127-138.