1. Model checking continuous-time Markov chains;Aziz;ACM Trans. Comput. Log.,2000
2. Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes;Baier,2004
3. Comparative branching-time semantics for Markov chains;Baier;Inf. Comput.,2005
4. Least upper bounds for probability measures and their applications to abstractions;Chadha,2008
5. Abstract interpretation: A unified lattice model for static analysis of programs;Cousot,1977