scientific article; zbMATH DE number 2086665
From MaRDI portal
Publication:4737202
zbMath1057.68071MaRDI QIDQ4737202
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800716.htm
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
Bisimulation equivalence and regularity for real-time one-counter automata ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Complexity of deciding bisimilarity between normed BPA and normed BPP ⋮ Normed BPA vs. Normed BPP Revisited ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ On the computational complexity of bisimulation, redux ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Unnamed Item
