Log In Sign Up

QCTL model-checking with QBF solvers

by   A. Hossain, et al.

Quantified CTL (QCTL) extends the temporal logic CTL with quantifications over atomic propositions. This extension is known to be very expressive: QCTL allows us to express complex properties over Kripke structures (it is as expressive as 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 QCTL based on a reduction to QBF. We consider several reduction strategies and we compare them with a prototype (based on several QBF solvers) on different examples.


page 1

page 2

page 3

page 4


From Quantified CTL to QBF

QCTL extends the temporal logic CTL with quantifications over atomic pro...

Good-for-Game QPTL: An Alternating Hodges Semantics

An extension of QPTL is considered where functional dependencies among t...

Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic

This paper presents an approximation approach to verifying counter syste...

B Maude: A formal executable environment for Abstract Machine Notation Descriptions

We propose B Maude, a prototype executable environment for the Abstract ...

A Formal Methods Approach to Pattern Synthesis in Reaction Diffusion Systems

We propose a technique to detect and generate patterns in a network of l...

CTL* synthesis via LTL synthesis

We reduce synthesis for CTL* properties to synthesis for LTL. In the con...

Robust Computation Tree Logic

It is widely accepted that every system should be robust in that "small"...