DeepAI
Log In Sign Up

From Quantified CTL to QBF

06/24/2019
by   Akash Hossain, et al.
0

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 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 the SMT-solver Z3) on several examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/06/2020

QCTL model-checking with QBF solvers

Quantified CTL (QCTL) extends the temporal logic CTL with quantification...
01/17/2019

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

This paper presents an approximation approach to verifying counter syste...
04/13/2021

Good-for-Game QPTL: An Alternating Hodges Semantics

An extension of QPTL is considered where functional dependencies among t...
06/28/2022

A quantitative extension of Interval Temporal Logic over infinite words

Model checking for Halpern and Shoham's interval temporal logic HS has b...
01/18/2022

Robust Computation Tree Logic

It is widely accepted that every system should be robust in that "small"...
09/12/2014

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...