We prove that weak bisimilarity is decidable in polynomial time between nite-state systems and several classes of in nite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the rst polynomial algorithms for weak bisimilarity problems involving in nite-state systems.
Strong and weak bisimilarity between BPA and finite-state processes is decidable in polynomial time REF .
Weak Bisimilarity between Finite-State Systems and BPA or Normed BPP is Decidable in Polynomial Time
Theoretical Computer Science
Computer Science Mathematics