DeepAI AI Chat
Log In Sign Up

The Satisfiability Problem for a Quantitative Fragment of PCTL

by   Miroslav Chodil, et al.

We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in 2-EXPSPACE). The condition is semantic and it is based on enforcing a form of “progress” in non-bottom SCCs contributing to the satisfaction of a given PCTL formula. We show that the condition is satisfied by PCTL fragments beyond the reach of existing methods.


page 1

page 2

page 3

page 4


The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

We investigate the satisfiability and finite satisfiability problem for ...

One-dimensional guarded fragments

We call a first-order formula one-dimensional if its every maximal block...

Complexity of Reasoning with Cardinality Minimality Conditions

Many AI-related reasoning problems are based on the problem of satisfiab...

Decidable Fragments of LTLf Modulo Theories (Extended Version)

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfM...

OTFS – Predictability in the Delay-Doppler Domain and its Value to Communication and Radar Sensing

In our first paper [2] we explained why the Zak-OTFS input-output (I/O) ...