Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
From MaRDI portal
Publication:4635802
DOI10.1109/LICS.2015.26zbMath1392.68302arXiv1501.04748MaRDI QIDQ4635802
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04748
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Unnamed Item ⋮ Bisimilarity on basic parallel processes
This page was built for publication: Branching Bisimilarity on Normed BPA Is EXPTIME-Complete