Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆

DOI10.1142/S012905411592001XzbMath1405.68130MaRDI QIDQ2800418

No author found.

Publication date: 15 April 2016

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

Mathematics Subject Classification ID

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

Related Items (2)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ The model checking fingerprints of CTL operators

This page was built for publication: Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆