Efficient verification algorithms for one-counter processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 317-328

  Kučera, Antonìn ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMILARITY; CO-NP HARDNESS; COUNTER AUTOMATA; FINITE STATE PROCESS; HARD INSTANCES; TIGHT BOUND; VERIFICATION ALGORITHMS; WEAK BISIMILARITY;

AUTOMATA THEORY;

EID: 84974588235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_28     Document Type: Conference Paper

References (18)

1. P.A. Abdulla and K. Čerāns. Simulation is decidable for one-counter nets. In Proceedings of CONCUR’98, volume 1466 of LNCS, pages 253–268. Springer, 1998.
2. E. Bach and J. Shallit. Algorithmic Number Theory. Vol. 1, Efficient Algorithms. The MIT Press, 1996.
3. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121:143–148, 1995.
4. J. Esparza and P. Rossmanith. An automata approach to some problems on context-free grammars. In Foundations of Computer Science, Potential – Theory – Cognition, volume 1337 of LNCS, pages 143–152. Springer, 1997.
5. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
6. P. Jančar. Bisimulation equivalence is decidable for one-counter processes. In Proceedings of ICALP’97, volume 1256 of LNCS, pages 549–559. Springer, 1997.
7. P. Jančar, A. Kučera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. In Proceedings of ICALP’98, volume 1443 of LNCS, pages 200–211. Springer, 1998.
8. P. Jančar, A. Kučera, and F. Moller. Simulation and bisimulation over one-counter processes. In Proceedings of STACS 2000, volume 1770 of LNCS, pages 334–345. Springer, 2000.
9. P. Jančar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In Proceedings of SOFSEM’99, volume 1725 of LNCS, pages 404–413. Springer, 1999.
10. A. Kučera. Efficient verification algorithms for one-counter processes. Technical report FIMU-RS-2000-03, Faculty of Informatics, Masaryk University, 2000.
11. A. Kučera and R. Mayr. Weak bisimilarity with infinite-state systems can be decided in polynomial time. In Proceedings of CONCUR’99, volume 1664 of LNCS, pages 368–382. Springer, 1999.
12. R. Mayr. Private communication. 1999.
13. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
14. Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
15. th GI Conference, volume 104 of LNCS, pages 167–183. Springer, 1981.
16. W. Reisig. Petri Nets—An Introduction. Springer, 1985.
17. G. Sènizergues. Decidability of bisimulation equivalence for equational graphs of finite outdegree. In Proceedings of 39th Annual Symposium on Foundations of Computer Science, pages 120–129. IEEE Computer Society Press, 1998.
18. R.J. van Glabbeek. The linear time—branching time spectrum. In Proceedings of CONCUR’ 90, volume 458 of LNCS, pages 278–297. Springer, 1990.