Branching Bisimilarity on Normed BPA Is EXPTIME-complete
Logic in Computer Science
2015-03-18 v2
Abstract
We put forward an exponential-time algorithm for deciding branching bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of branching (or weak) bisimilarity on normed BPA was once a long standing open problem which was closed by Yuxi Fu. The EXPTIME-hardness is an inference of a slight modification of the reduction presented by Richard Mayr. Our result claims that this problem is EXPTIME-complete.
Keywords
Cite
@article{arxiv.1501.04748,
title = {Branching Bisimilarity on Normed BPA Is EXPTIME-complete},
author = {Chaodong He and Mingzhang Huang},
journal= {arXiv preprint arXiv:1501.04748},
year = {2015}
}
Comments
We correct many typing errors, add several remarks and an interesting toy example