BPA bisimilarity is EXPTIME-hard

Authors:
Stefan Kiefer
Affiliations:
University of Oxford, UK
Venue:
Information Processing Letters
Year:
2013

Citing 13
Cited 3

Bisimulation equivalence is decidable for all context-free processes

Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes

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
On the Complexity of Bisimulation Problems for Pushdown Automata

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard

Theoretical Computer Science - Expressiveness in concurrency
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
On the complexity of computing probabilistic bisimilarity

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures

Checking equality and regularity for normed BPA with silent moves

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Bisimulation equivalence and regularity for real-time one-counter automata

Journal of Computer and System Sciences
Bisimilarity of Pushdown Automata is Nonelementary

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a basic process algebra (BPA) and two stack symbols, the BPA bisimilarity problem asks whether the two stack symbols are bisimilar. We show that this problem is EXPTIME-hard.