Publication:4736869
From MaRDI portal
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Undecidability of performance equivalence of Petri nets, On the computational complexity of bisimulation, redux, Reachability is decidable for weakly extended process rewrite systems, Non-interleaving bisimulation equivalences on basic parallel processes, Weak bisimilarity and regularity of context-free processes is EXPTIME-hard, Complexity of deciding bisimilarity between normed BPA and normed BPP, Bisimilarity on basic parallel processes, Decidability of branching bisimulation on normed commutative context-free processes, Decidability of performance equivalence for basic parallel processes, Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Normed BPA vs. Normed BPP Revisited