Erratum to: ``The complexity of satisfiability for fragments of CTL and CTL^

DOI10.1142/S012905411592001XMaRDI QIDQ2800418zbMATH OpenFDO

Authors Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk

Publication date 15 April 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905411592001X

Mathematics Subject Classification ID

Temporal logic (03B44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
• The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)
• Erratum/correction to: ``On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
• Erratum to ``Revisiting global constraint satisfaction
• Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
• Corrigendum to: ``Iterated stack automata and complexity classes
• The satisfiability problem for a quantitative fragment of PCTL
• The satisfiability problem for unbounded fragments of probabilistic CTL
• Erratum to: Kolmogorov complexity arguments in combinatorics

Cited in

(3)

• The model checking fingerprints of CTL operators
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
• Parametrised complexity of satisfiability in temporal logic

This page was built for publication: Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)

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