On the computational complexity of verifying one-counter processes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 235-244

  GÖller, Stefan ^b   Mayr, Richard ^a   To, Anthony Widjaja ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Complexity theory; Logic

Indexed keywords

COMPLEXITY THEORY; DIRECTED ACYCLIC GRAPHS; FINITE SYSTEMS; LOGIC; MEMBERSHIP PROBLEM; PRESBURGER ARITHMETIC; PUSHDOWN SYSTEMS; VERIFICATION PROBLEMS; WEAK BISIMILARITY; WEAK BISIMULATION;

COMPUTER SCIENCE; MODEL CHECKING; TEMPORAL LOGIC;

COMPUTATIONAL COMPLEXITY;

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

References (29)

1. A. Bouajjani, J. Esparza and O. Maler. Reachability analysis of pushdown automata: application to model checking. In CONCUR'97, pages 135-150.
2. T. Cachat. Uniform Solution of Parity Games on Prefix- Recognizable Graphs. ENTCS 86(6): (2002
3. M. Chrobak. Finite Automata and Unary Languages, Theor. Comput. Sci. 47(3):149-158 (1986
4. J. Esparza, D. Hansel, P. Rossmanith and S. Schwoon. Efficient Algorithms for Model Checking Pushdown Systems. In CAV'00, pages 232-247.
5. M. Holzer. On emptiness and counting for alternating finite automata. In DLT'95, pages 88-97.
6. P. Jančar. Decidability of Bisimilarity for One-Counter Processes. Inf. Comput. 158(1): 1-17 (2000
7. P. Jančar and A. Kučera. Equivalence Checking on Infinite- State Systems: Techniques and Results. TPLP 6(3):227-264 (2006
8. P. Jančar, A. Kučera and R. Mayr. Deciding Bisimulation- Like Equivalences with Finite-State Processes. TCS 258(1- 2):409-433 (2001
9. P. Jančar, A. Kučera, F. Moller and Z. Sawa. DP Lower bounds for equivalence-checking and model-checking of onecounter automata. Inf. Comput. 188(1): 1-19 (2004
10. P. Jančar and Z. Sawa. A note on emptiness for alternating finite automata with a one-letter alphabet. IPL 104(5):164-167 (2007
11. A. Kučera. Efficient Verification Algorithms for One-Counter Processes. In ICALP'00, pages 317-328.
12. A. Kučera and R. Mayr. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. In MFCS'02, pages 433-445.
13. A. Martinez. Efficient computation of regular expressions from unary NFAs. In DCFS'02, pages 216-230.
14. R. Mayr. On the Complexity of Bisimulation Problems for Pushdown Automata. In IFIP TCS'00, pages 474-488.
15. R. Mayr. Undecidability of Weak Bisimulation Equivalence for 1-counter Processes. In ICALP'03, pages 570-583.
16. R. Milner. Communication and Concurrency. Prentice, 1989.
17. C. H. Papadimitriou. Computational Complexity. Addison- Wesley, 1994.
18. N. Piterman and M. Y. Vardi. Global Model-Checking of Infinite-State Systems. In CAV'04, pages 387-400.
19. G. Sénizergues. The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM J. Comput. 34(5):1025-1106 (2005
20. O. Serre. Parity games played on transition graphs of onecounter processes. In FOSSACS'06, pages 337-351.
21. p-Completeness: A Classical Approach for New Results. In FSTTCS'00, pages 348-360.
22. J. Srba. Undecidability of Weak Bisimilarity for Pushdown Processes. In CONCUR'02, pages 579-593.
23. J. Srba. Roadmap of Infinite results. Bulletin of the EATCS 78:163-175 (2002). http://www.brics.dk/~srba/roadmap
24. J. Srba. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. In CSL'06, pages 89- 103.
25. A. W. To. Unary finite automata vs. arithmetic progressions. Tech. report EDI-INF-RR-1306, Univ. of Edinburgh, 2008.
26. A. W. To. Model checking FO(R) over one-counter processes and beyond. To appear in CSL'09.
27. K. W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51(1-2):53-80 (1978
28. I. Walukiewicz. Model checking CTL Properties of Pushdown Systems. In FSTTCS'00, pages 127-138.
29. I. Walukiewicz. Pushdown Processes: Games and Model- Checking. Inf. Comput. 164(2):234-263 (2001