The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

KŘETÍNSKÝ, Jan a Alexej ROTAR. The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL. In 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. Dagstuhl, 2018, s. 1-16. ISBN 9783959770873. Dostupné z: https://doi.org/10.4230/LIPICS.CONCUR.2018.32.

Základní údaje

Originální název

The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

Autoři

KŘETÍNSKÝ, Jan a Alexej ROTAR

Vydání

29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, od s. 1-16, 16 s. 2018

Nakladatel

Dagstuhl

---

Další údaje

Typ výsledku

Stať ve sborníku

Označené pro přenos do RIV

Ne

Organizační jednotka

Fakulta informatiky

ISBN

9783959770873

ISSN

DOI

https://doi.org/10.4230/LIPICS.CONCUR.2018.32

---

Anotace

V originále

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 di culties arising in more complex fragments where the decidability remains open.