scientific article
From MaRDI portal
Publication:2754155
zbMath0973.68166MaRDI QIDQ2754155
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Undecidable problems in unreliable computations. ⋮ Complexity of Weak Bisimilarity and Regularity for BPA and BPP ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
This page was built for publication:
