scientific article; zbMATH DE number 1759489
From MaRDI portal
Publication:4536443
zbMath0998.68088MaRDI QIDQ4536443
Publication date: 25 November 2002
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 (5)
The complexity of bisimilarity-checking for one-counter processes. ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Simulation preorder over simple process algebras
This page was built for publication:
