On the expressiveness of QCTL

DOI10.4230/LIPICS.CONCUR.2016.28MaRDI QIDQ4608680zbMATH OpenOpenAlexFDO

Authors Amélie David, François Laroussinie, Nicolas Markey

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2016.28

zbMATH Keywords

verificationspecificationtree automataexpressivenesstemporal logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Quantified CTL: expressiveness and complexity
• Quantified CTL: expressiveness and model checking (extended abstract)
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• From quantified CTL to QBF
• Quantified computation tree logic

Cited in

(8)

• Quantified CTL: expressiveness and complexity
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• From quantified CTL to QBF
• Branching-depth hierarchies
• QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
• Quantified CTL: expressiveness and model checking (extended abstract)
• On the Expressive Power of QLTL
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)

This page was built for publication: On the expressiveness of QCTL

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