Bisimilarity of one-counter processes is PSPACE-complete

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

Volumn 6269 LNCS, Issue , 2010, Pages 177-191

  Böhm, Stanislav ^a   Göller, Stefan ^b   Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; COUNTER AUTOMATA; LOWER BOUNDS; PUSH-DOWN AUTOMATA;

COMPUTABILITY AND DECIDABILITY; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 78249268812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_13     Document Type: Conference Paper

References (29)

1. Balcázar, J.L., Gabarró, J., Santha, M.: Deciding Bisimilarity is P-Complete. Formal Asp. Comput. 4(6A), 638-648 (1992)
2. Brázdil, T., Brozek, V., Etessami, K., Kučera, A., Wojtczak, D.: One-Counter Markov Decision Processes. In: Proc. of SODA, pp. 863-874. IEEE, Los Alamitos (2010)
3. Demri, S., Sangnier, A.: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 176-190. Springer, Heidelberg (2010)
4. Glabbeek, R.v.: The Linear Time - Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, ch. 1, pp. 3-99. Elsevier, Amsterdam (2001)
5. Göller, S., Mayr, R., To, A.W.: On the Computational Complexity of Verifying One-Coúnter Processes. In: Proc. of LICS, pp. 235-244. IEEE Computer Society Press, Los Alamitos (2009)
6. Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369-383. Springer, Heidelberg (2009)
7. Hirshfeld, Y., Jerrum, M.: Bisimulation Equivalence Is Decidable for Normed Process Algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 412-421. Springer, Heidelberg (1999)
8. Janin, D., Walukiewicz, I.: On the Expressive Completeness of the Propositional mu- Calculus with Respect to Monadic Second Order Logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 263-277. Springer, Heidelberg (1996)
9. Jančar, P.: Decidability of Bisimilarity for One-Counter Processes. Information Computation 158(1), 1-17 (2000)
10. Jančar, P.: Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. In: Proc. of LICS, pp. 218-227. IEEE Computer Society, Los Alamitos (2003)
11. Kanellakis, P.C., Smolka, S.A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation 86(1), 43-68 (1990)
12. Kučera, A.: Efficient Verification Algorithms for One-Counter Processes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 317-328. Springer, Heidelberg (2000)
13. Kučera, A., Mayr, R.: On the Complexity of Checking Semantic Equivalences between Push-down Processes and Finite-state Processes. Inf. Comput. 208(7), 772-796 (2010)
14. Mayr, R.: Process Rewrite Systems. Information and Computation 156(1), 264-286 (2000)
15. Mayr, R.: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 570-583. Springer, Heidelberg (2003)
16. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)
17. Moller, F., Rabinovich, A.M.: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1), 147-159 (2003)
18. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973-989 (1987)
19. Sénizergues, G.: The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM J. Comput. 34(5), 1025-1106 (2005)
20. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 337-351. Springer, Heidelberg (2006)
21. Srba, J.: Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 716-727. Springer, Heidelberg (2002)
22. Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 197-208. Springer, Heidelberg (2003)
23. Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co., Singapore (2004), http://www.brics.dk/~srba/ roadmap
24. Srba, J.: Beyond Language Equivalence on Visibly Pushdown Automata. Logical Methods in Computer Science 5(1:2) (2009)
25. Stirling, C.: Decidability of Bisimulation Equivalence for Pushdown Processes (2000) (unpublished manuscript)
26. To, A.W.: Model Checking FO(R) over One-Counter Processes and beyond. In: Grädel, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 485-499. Springer, Heidelberg (2009)
27. Valiant, L.G., Paterson, M.: Deterministic one-counter automata. J. Comput. Syst. Sci. 10(3), 340-350 (1975)
28. van Benthem, J.: Modal Correspondence Theory. PhD thesis, University of Amsterdam (1976)
29. Yen, H.-C.: Complexity Analysis of Some Verification Problems for One-Counter Machines (20xx) (unpublished manuscript)