Quantified $\mathsf{CTL}$ ($\mathsf{QCTL}$) extends the temporal logic $\mathsf{CTL}$ with quantifications over atomic propositions. This extension is known to be very expressive: $\mathsf{QCTL}$ allows us to express complex properties over Kripke structures (it is as expressive as $\mathsf{MSO}$). Several semantics exist for the quantifications: here, we work with the structure semantics, where the extra propositions label the Kripke structure (and not its execution tree), and the model-checking problem is known to be PSPACE-complete in this framework. We propose a new model-checking algorithm for $\mathsf{QCTL}$ based on a reduction to $\mathsf{QBF}$. We consider several reduction strategies and we compare them with a prototype (based on several $\mathsf{QBF}$ solvers) on different examples.

量化 $\mathsf{CTL}$ ($\mathsf{QCTL}$) 扩展时间逻辑 $\mathsf{CTL}$对原子命题进行量化。众所周知，此扩展非常具有表现力：$\mathsf{QCTL}$ 允许我们在 Kripke 结构上表达复杂的属性（它与 $\mathsf{移动运营商}$）。量化存在几种语义：在这里，我们使用结构语义，其中额外的命题标记 Kripke 结构（而不​​是其执行树），并且模型检查问题在此框架中已知为PSPACE -complete。我们提出了一种新的模型检查算法$\mathsf{QCTL}$ 基于减少到 $\mathsf{QBF}$. 我们考虑了几种减少策略，并将它们与原型进行比较（基于几个$\mathsf{QBF}$ 求解器）在不同的例子上。