arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1501.04748cs.LO
收藏

赋范BPA上的分支双相似性是EXPTIME-完全的

Branching Bisimilarity on Normed BPA Is EXPTIME-complete

Chaodong He, Mingzhang Huang

摘要:

提出了一种判定赋范BPA(Bacis Process Algebra)系统分支双相似性的指数时间算法。赋范BPA上的分支(或弱)双相似性的判定问题是一个长期存在的未解决的问题。EXPTIME硬度是对Richard Mayr提出的约化的轻微修改的推论。我们的结果表明,这个问题是EXPTIME-完全的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑