Good-for-Game QPTL: An Alternating Hodges Semantics

04/13/2021
by   Dylan Bellier, et al.
0

An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the future values of the other variables. This restriction is tightly connected to the notion of behavioral strategies in game-theory and allows the resulting logic to naturally express game-theoretic concepts. The fragment where only restricted quantifications are considered, called behavioral quantifications, can be decided, for both model checking and satisfiability, in 2ExpTime and is expressively equivalent to QPTL, though significantly less succinct.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2020

QCTL model-checking with QBF solvers

Quantified CTL (QCTL) extends the temporal logic CTL with quantification...
research
06/24/2019

From Quantified CTL to QBF

QCTL extends the temporal logic CTL with quantifications over atomic pro...
research
12/25/2018

On Verifying Timed Hyperproperties

We study the satisfiability and model-checking problems for timed hyperp...
research
04/23/2023

Alternating (In)Dependence-Friendly Logic

Hintikka and Sandu originally proposed Independence Friendly Logic (IF) ...
research
07/22/2020

Differential games, locality and model checking for FO logic of graphs

We introduce differential games for FO logic of graphs, a variant of Ehr...
research
12/16/2019

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...
research
02/21/2018

Playing with Repetitions in Data Words Using Energy Games

We introduce two-player games which build words over infinite alphabets,...

Please sign up or login with your details

Forgot password? Click here to reset