2000 character limit reached
Branching Bisimilarity on Normed BPA Is EXPTIME-complete (1501.04748v2)
Published 20 Jan 2015 in cs.LO
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.