Abstract
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the PTIME-completeness result for deciding regularity (i.e. finiteness up to bisimilarity) of one-counter processes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balcázar, J.L., Gabarró, J., Santha, M.: Deciding Bisimilarity is P-Complete. Formal Asp. Comput. 4(6A), 638–648 (1992)
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)
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)
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)
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)
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)
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)
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)
Jančar, P.: Decidability of Bisimilarity for One-Counter Processes. Information Computation 158(1), 1–17 (2000)
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)
Kanellakis, P.C., Smolka, S.A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation 86(1), 43–68 (1990)
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)
Kučera, A., Mayr, R.: On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes. Inf. Comput. 208(7), 772–796 (2010)
Mayr, R.: Process Rewrite Systems. Information and Computation 156(1), 264–286 (2000)
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)
Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)
Moller, F., Rabinovich, A.M.: Counting on CTL\(^{\mbox{*}}\): on the expressive power of monadic path logic. Inf. Comput. 184(1), 147–159 (2003)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973–989 (1987)
Sénizergues, G.: The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM J. Comput. 34(5), 1025–1106 (2005)
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)
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)
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)
Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co., Singapore (2004), http://www.brics.dk/~srba/roadmap
Srba, J.: Beyond Language Equivalence on Visibly Pushdown Automata. Logical Methods in Computer Science 5(1:2) (2009)
Stirling, C.: Decidability of Bisimulation Equivalence for Pushdown Processes (2000) (unpublished manuscript)
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)
Valiant, L.G., Paterson, M.: Deterministic one-counter automata. J. Comput. Syst. Sci. 10(3), 340–350 (1975)
van Benthem, J.: Modal Correspondence Theory. PhD thesis, University of Amsterdam (1976)
Yen, H.-C.: Complexity Analysis of Some Verification Problems for One-Counter Machines (20xx) (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böhm, S., Göller, S., Jančar, P. (2010). Bisimilarity of One-Counter Processes Is PSPACE-Complete. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)