Branching bisimilarity of normed BPA processes as a rational monoid

DOI10.23638/LMCS-13(4:17)2017MaRDI QIDQ4596795zbMATH OpenFDO

Authors Petr Jančar

Publication date 11 December 2017

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

zbMATH Keywords

basic process algebrabranching bisimulation equivalence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Branching bisimilarity of normed BPA processes is in NExpTime
• Branching bisimilarity on normed BPA is EXPTIME-complete
• Complexity of deciding bisimilarity between normed BPA and normed BPP
• scientific article; zbMATH DE number 1231554
• Two lower bounds for BPA

Cited in

(5)

• scientific article; zbMATH DE number 1231554 (Why is no real title available?)
• Branching bisimilarity on normed BPA is EXPTIME-complete
• Branching bisimilarity of normed BPA processes is in NExpTime
• Two lower bounds for BPA
• Bisimilarity on basic parallel processes

This page was built for publication: Branching bisimilarity of normed BPA processes as a rational monoid

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