The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL.

Jan Kretnsk, Alexej Rotar

Browse the full CONCUR paper archive.