scientific article; zbMATH DE number 2038755
From MaRDI portal
Publication:4449220
zbMath1039.68076MaRDI QIDQ4449220
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190790.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 (7)
Efficient timed model checking for discrete-time systems ⋮ Model checking interval temporal logics with regular expressions ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Unnamed Item ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ Choice logics and their computational properties
This page was built for publication:
