In this paper we study time-bounded verification of a finite continuous-time Markov chain (CTMC) C against a real-time specification, provided either as a metric temporal logic (MTL) property Φ, or as a timed automaton (TA) A. The key question is: what is the probability of the set ...