Comparing expressibility of normed BPA and normed BPP processes

DOI10.1007/s002360050159zbMath0947.68109OpenAlexW2059660155MaRDI 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

zbMATH Keywords

transition systems

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

This page was built for publication: Comparing expressibility of normed BPA and normed BPP processes