Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME
From MaRDI portal
Publication:4635801
DOI10.1109/LICS.2015.25zbMath1392.68292arXiv1407.0645OpenAlexW1481270617MaRDI QIDQ4635801
Wojciech Czerwiński, Petr Jančar
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/1407.0645
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
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 of Normed BPA Processes Is in NEXPTIME