Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable

Hongfei Fu. Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. In Zhenjiang Hu, editor, Programming Languages and Systems, 7th Asian Symposium, APLAS 2009, Seoul, Korea, December 14-16, 2009. Proceedings. Volume 5904 of Lecture Notes in Computer Science, pages 327-342, Springer, 2009. [doi]

Abstract

Abstract is missing.