scientific article; zbMATH DE number 2086414
From MaRDI portal
Publication:4736869
zbMath1054.68096MaRDI QIDQ4736869
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850535.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
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems ⋮ Complexity of deciding bisimilarity between normed BPA and normed BPP ⋮ Normed BPA vs. Normed BPP Revisited ⋮ Undecidability of performance equivalence of Petri nets ⋮ Decidability of branching bisimulation on normed commutative context-free processes ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ On the computational complexity of bisimulation, redux ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Unnamed Item ⋮ Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ Bisimilarity on basic parallel processes ⋮ Non-interleaving bisimulation equivalences on basic parallel processes
