scientific article; zbMATH DE number 2087435
From MaRDI portal
Publication:4738230
zbMath1077.68690MaRDI QIDQ4738230
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2303/23030250.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On hierarchically developing reactive systems ⋮ Three notes on the complexity of model checking fixpoint logic with chop ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition
This page was built for publication:
