scientific article; zbMATH DE number 1136071

zbMath0919.03012MaRDI QIDQ4381382

Stéphane P. Demri, Philippe Schnoebelen

Publication date: 19 August 1999

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

zbMATH Keywords

complexitymodel checkingsatisfiabilitylinear-time temporal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (4)

A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Specification in CTL + past for verification in CTL. ⋮ The complexity of propositional linear temporal logics in simple cases ⋮ Is your model checker on time? On the complexity of model checking for timed modal logics

This page was built for publication: