scientific article; zbMATH DE number 1927588

zbMath1012.68140MaRDI QIDQ4484513

Richard Mayr, Antonín Kučera

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210594.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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 (6)

Simulation relations and applications in formal methods ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ Exploring the tractability border in epistemic tasks ⋮ 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

This page was built for publication: