License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.20
URN: urn:nbn:de:0030-drops-77772
Go to the corresponding LIPIcs Volume Portal

Huang, Mingzhang ; Yin, Qiang

Two Lower Bounds for BPA

LIPIcs-CONCUR-2017-20.pdf (0.7 MB)


Branching bisimilarity of normed Basic Process Algebra (nBPA) was claimed to be EXPTIME-hard in previous papers without any explicit proof. Recently it has been pointed out by Petr Jancar that the claim lacked proper justification. In this paper, we develop a new complete proof for the EXPTIME-hardness of branching bisimilarity of nBPA. We also prove that the associated regularity problem of nBPA is PSPACE-hard. This improves previous P-hard result.

BibTeX - Entry

  author =	{Mingzhang Huang and Qiang Yin},
  title =	{{Two Lower Bounds for BPA}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{20:1--20:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-77772},
  doi =		{10.4230/LIPIcs.CONCUR.2017.20},
  annote =	{Keywords: BPA, branching bisimulation, regularity}

Keywords: BPA, branching bisimulation, regularity
Collection: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 01.09.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI