Publication:4484513
From MaRDI portal
zbMath1012.68140MaRDI QIDQ4484513
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210594.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
Simulation relations and applications in formal methods, Exploring the tractability border in epistemic tasks, Generalizing the Paige-Tarjan algorithm by abstract interpretation, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, An efficient simulation algorithm based on abstract interpretation