Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time

Abstract

We prove that weak bisimilarity is decidable in polynomial time between BPA and finite-state processes, and between normed BPP and finite-state processes.To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity with infinite-state systems.KeywordsPolynomial TimeInduction HypothesisModel CheckPolynomial AlgorithmProcess ExpressionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.