"The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL."

Jan Kretínský, Alexej Rotar (2018)
a service of  Schloss Dagstuhl - Leibniz Center for Informatics