Branching Bisimilarity on Normed BPA Is EXPTIME-Complete

DOI10.1109/LICS.2015.26zbMATH Open1392.68302arXiv1501.04748MaRDI QIDQ4635802FDOQ4635802

Chaodong He, Mingzhang Huang

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1501.04748

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• Complexity of weak bisimilarity and regularity for BPA and BPP
• Title not available (Why is that?)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
• BPA bisimilarity is EXPTIME-hard
• Bisimilarity on basic parallel processes

This page was built for publication: Branching Bisimilarity on Normed BPA Is EXPTIME-Complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635802)