Comparing expressibility of normed BPA and normed BPP processes
From MaRDI portal
Publication:1306565
DOI10.1007/s002360050159zbMath0947.68109MaRDI QIDQ1306565
Mojmír Křetínský, Ivana Černá, Antonín Kučera
Publication date: 29 November 1999
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050159
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Deciding bisimulation-like equivalences with finite-state processes, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Complexity of deciding bisimilarity between normed BPA and normed BPP, Selected Ideas Used for Decidability and Undecidability of Bisimilarity, Normed BPA vs. Normed BPP Revisited