Weak bisimilarity and regularity of context-free processes is EXPTIME-hard

Authors:
Richard Mayr
Affiliations:
Computer Science Department, North Carolina State University, 900 Main Campus Drive, Venture III Building, Room 184, Campus Box 8207, Raleigh, NC
Venue:
Theoretical Computer Science - Expressiveness in concurrency
Year:
2005

Citing 16
Cited 4

Communication and concurrency

Communication and concurrency
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
Decidability of bisimulation equivalence for normed pushdown processes

Theoretical Computer Science
Alternation

Journal of the ACM (JACM)
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Theoretical Computer Science
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Joys of Bisimulation

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
High Undecidability of Weak Bisimilarity for Petri Nets

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Undecidability of Weak Bisimilarity for Pushdown Processes

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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

Equivalence-checking on infinite-state systems: Techniques and results

Theory and Practice of Logic Programming
Refining the Undecidability Border of Weak Bisimilarity

Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

Information and Computation
BPA bisimilarity is EXPTIME-hard

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that checking weak bisimulation equivalence of two context-free processes (also called BPA-processes) is EXPTIME-hard, even under the condition that the processes are normed. Furthermore, checking weak regularity (finiteness up to weak bisimilarity) for context-free processes is EXPTIME-hard as well. Adding a finite control of the minimal non-trivial size of 2 to the BPA process already makes weak bisimilarity undecidable.