4 search results - page 1 / 1 » Complexity of Weak Bisimilarity and Regularity for BPA and B... |
ENTCS
2000
13 years 4 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
IANDC
2010
13 years 3 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
ENTCS
2006
13 years 4 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
APLAS
2009
ACM
13 years 9 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...