DeepAI AI Chat

The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

06/29/2018

∙

by Jan Křetínský, et al.

∙

Technische Universität München

∙

∙

We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing quantitative operators and pinpoint the difficulties arising in more complex fragments where the decidability remains open.

Jan Křetínský
35 publications
Alexej Rotar
2 publications

page 1

page 2

page 3

page 4

∙ 01/21/2021

Finite Model Theory of the Triguarded Fragment and Related Logics

The Triguarded Fragment (TGF) is among the most expressive decidable fra...

0 Emanuel Kieronski, et al. ∙

∙ 09/21/2022

On the Existential Fragments of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carr...

0 Benedikt Bollig, et al. ∙

∙ 07/08/2021

The Satisfiability Problem for a Quantitative Fragment of PCTL

We give a sufficient condition under which every finite-satisfiable form...

0 Miroslav Chodil, et al. ∙

∙ 06/28/2018

Polynomial-time probabilistic reasoning with partial observations via implicit learning in probability logics

Standard approaches to probabilistic reasoning require that one possesse...

0 Brendan Juba, et al. ∙

∙ 05/30/2022

Deciding Hyperproperties Combined with Functional Specifications

We study satisfiability for HyperLTL with a ∀^*∃^* quantifier prefix, kn...

0 Raven Beutner, et al. ∙

∙ 07/15/2020

Tractable Fragments of Temporal Sequences of Topological Information

In this paper, we focus on qualitative temporal sequences of topological...

0 Quentin Cohen-Solal, et al. ∙

∙ 07/11/2019

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, i...

0 Corto Mascle, et al. ∙