scientific article; zbMATH DE number 1927561
From MaRDI portal
Publication:4484486
zbMath1012.68123MaRDI QIDQ4484486
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210161.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) 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 (4)
Hardness of preorder checking for basic formalisms ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system ⋮ Hardness of equivalence checking for composed finite-state systems
This page was built for publication:
