Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Information and Computation - Special issue on EXPRESS 1997
Decidability of bisimilarity for one-counter processes
Information and Computation
Communication and Concurrency
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Efficient Verification Algorithms for One-Counter Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
On the Computational Complexity of Verifying One-Counter Processes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Deterministic one-counter automata
Journal of Computer and System Sciences
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Information and Computation
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
One-counter Markov decision processes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
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.