On the expressiveness of QCTL

DOI10.4230/LIPICS.CONCUR.2016.28zbMATH Open1392.68245OpenAlexW2528077643MaRDI QIDQ4608680FDOQ4608680

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

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

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)

Cited In (8)

• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• Title not available (Why is that?)
• QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
• Quantified CTL: expressiveness and model checking (extended abstract)
• Branching-depth hierarchies
• From quantified CTL to QBF
• On the Expressive Power of QLTL
• Quantified CTL: expressiveness and complexity

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)