DP lower bounds for equivalence-checking and model-checking of one-counter automata

Information and Computation

Volumn 188, Issue 1, 2004, Pages 1-19

  Jančar, Petr ^a   Kučera, Antonín ^b   Moller, Faron ^c   Sawa, Zdeněk ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b MASARYK UNIVERSITY   (Czech Republic)

^c SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Equivalence checking; Model checking; One counter machines

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; FINITE AUTOMATA; OPTIMIZATION; PROBLEM SOLVING; SEMIOTICS;

ONE-COUNTER MACHINES; TRANSITION SYSTEMS;

COMPUTER SCIENCE;

EID: 17344374950     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00171-8     Document Type: Article

References (24)

1. P. Abdulla, K. Čerãns, Simulation is decidable for one-counter nets, in: Proceedings of CONCUR'98, Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 253-268.
2. E. Bach, J. Shallit, Algorithmic number theory, Efficient Algorithms, The MIT Press, Cambridge, MA, 1996.
3. J. Bergstra, J. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science 37 (1985) 77-121.
4. A. Bouajjani,P. Habermehl, R. Mayr, Automatic verification of recursive procedures with one integer parameter, in: Proceedings of MFCS 2001, Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, pp. 198-211.
5. S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis, University of Edinburgh, 1993.
6. E. Emerson, Temporal and modal logic, Handbook of Theoretical Computer Science B (1991) 995-1072.
7. J. Esparza, J. Knoop, An automata-theoretic approach to interprocedural data-flow analysis, in: Proceedings of FoSSaCS'99, Lecture Notes in Computer Science, vol. 1578, Springer, Berlin, 1999, pp. 14-30.
8. P. Jančar, Decidability of bisimilarity for one-counter processes, Information and Computation 158 (1) (2000) 1-17.
9. P. Jančar, A. Kučera, R. Mayr, Deciding bisimulation-like equivalences with finite-state processes, Theoretical Computer Science 258 (1-2) (2001) 409-433.
10. P. Jančar, A. Kučera, F. Moller, Simulation and bisimulation over one-counter processes, Proceedings of STACS 2000, Lecture Notes in Computer Science, vol. 1770, springer, Berlin, 2000, pp. 334-345.
11. P. Jančar, A. Kučera, F. Moller, Z. Sawa. Equivalence-checking with one-counter automata: a generic method for proving lower bounds, in: Proceedings of FoSSaCS 2002, Lecture Notes in Computer Science, vol. 2303, Springer, Berlin, 2002, pp. 172-186.
12. P. Jančar, F. Moller, Z. Sawa. Simulation problems for one-counter machines, in: Proceedings of SOFSEM'99, Lecture Notes in Computer Science, vol. 1725, Springer, Berlin, 1999, pp. 404-413.
13. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science 27 (1983) 333-354.
14. A. Kučera, Efficient verification algorithms for one-counter processes, in: Proceedings of ICALP 2000, Lecture Notes in Computer Science, vol. 1853, Springer, Berlin, 2000, pp. 317-328.
15. A. Kučera, On simulation-checking with sequential systems, in: Proceedings of ASIAN 2000, Lecture Notes in Computer Science, vol. 1961, Springer, Berin, 2000, pp. 133-148.
16. A. Kučera, R. Mayr, Simulation preorder over simple process algebras, Information and Computation 173 (2) (2002) 184-198.
17. R. Mayr, Strict lower bounds for model checking BPA, ENTCS 18 (1998).
18. R. Mayr, Undecidability of weak bisimulation equivalence for 1-counter processes, in: Proceedings of ICALP 2003, Lecture Notes in Computer Science, vol. 2719, Springer, Berlin, 2003, pp. 570-583.
19. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
20. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
21. D. Park, Concurrency and automata on infinite sequences, in: Proceedings of the 5th GI Conference, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
22. C. Stirling, Modal and temporal logics, Handbook of Logic in Computer Science 2 (1992) 477-563.
23. R. van Glabbeek, The linear time - branching time spectrum, Handbook of Process Algebra (1999) 3-99.
24. I. Walukiewicz, Pushdown processes: games and model-checking, Information and Computation 164 (2) (2001) 234-263.