Bisimilarity of Pushdown Automata is Nonelementary

Authors:
Michael Benedikt;Stefan Goller;Stefan Kiefer;Andrzej S. Murawski
Affiliations:
-;-;-;-
Venue:
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Year:
2013

Citing 14
Cited 0

The linear time-branching time spectrum (extended abstract)

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
L(A) = L(B)? decidability results from complete formal systems

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

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
The Bisimulation Problem for Equational Graphs of Finite Out-Degree

SIAM Journal on Computing
Equivalence-checking on infinite-state systems: Techniques and results

Theory and Practice of Logic Programming
Undecidability of bisimilarity by defender's forcing

Journal of the ACM (JACM)
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

Information and Computation
Bisimilarity of one-counter processes is PSPACE-complete

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Decidability of DPDA Language Equivalence via First-Order Grammars

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
BPA bisimilarity is EXPTIME-hard

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIME-hardness, which was the best previously known lower bound for this problem. Our lower bound result holds for normed pushdown automata as well.