Strong bisimilarity of simple process algebras: complexity lower bounds

@article{Srba2003StrongBO,
  title={Strong bisimilarity of simple process algebras: complexity lower bounds},
  author={Jir{\'i} Srba},
  journal={Acta Informatica},
  year={2003},
  volume={39},
  pages={469-499}
}
We study bisimilarity and regularity problems of simple process algebras. In particular, we show PSPACE-hardness of the following problems: (i) strong bisimilarity of Basic Parallel Processes (BPP), (ii) strong bisimilarity of Basic Process Algebra (BPA), (iii) strong regularity of BPP, and (iv) strong regularity of BPA. We also demonstrate NL-hardness of strong regularity problems for the normed subclasses of BPP and BPA. Bisimilarity problems of simple process algebras are introduced in a… CONTINUE READING