The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

Jan Křetínský, Alexej Rotar

We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establ…