The complexity of dual models problem of propositional linear temporal logics

MaRDI QIDQ3610994zbMATH OpenFDO

Authors Zhilin Wu, Wenhui Zhang

Publication date 6 March 2009

zbMATH Keywords

computational complexitydual modelpropositional linear temporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The complexity of propositional linear temporal logics
• scientific article; zbMATH DE number 1136071
• The complexity of propositional linear temporal logics in simple cases
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The complexity of the temporal logic with ``until over general linear time

This page was built for publication: The complexity of dual models problem of propositional linear temporal logics

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