scientific article; zbMATH DE number 1136071

MaRDI QIDQ4381382zbMATH OpenFDO

Authors Stéphane Demri, Philippe Schnoebelen

Publication date 19 August 1999

zbMATH Keywords

complexitylinear-time temporal logicmodel checkingsatisfiability

Mathematics Subject Classification ID

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

Recommendations

• The complexity of propositional linear temporal logics in simple cases
• The complexity of propositional linear temporal logics
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The Complexity of Generalized Satisfiability for Linear Temporal Logic

Cited in

(12)

• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
• 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
• Implicates and reduction techniques for temporal logics
• The complexity of dual models problem of propositional linear temporal logics
• The complexity of propositional linear temporal logics
• scientific article; zbMATH DE number 1114359 (Why is no real title available?)
• scientific article; zbMATH DE number 1950255 (Why is no real title available?)
• Propositional temporal proving with reductions to a SAT problem
• Simple interpretations among complicated theories

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381382)