Branching Bisimilarity of Normed BPA Processes is in NEXPTIME
Logic in Computer Science
2015-12-21 v2 Formal Languages and Automata Theory
Abstract
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that leads to a nondeterministic exponential-time algorithm; this is close to the known exponential-time lower bound.
Keywords
Cite
@article{arxiv.1407.0645,
title = {Branching Bisimilarity of Normed BPA Processes is in NEXPTIME},
author = {Wojciech Czerwiński and Petr Jančar},
journal= {arXiv preprint arXiv:1407.0645},
year = {2015}
}
Comments
This is the same text as in July 2014, but only with some acknowledgment added due to administrative needs