Metrics for labelled Markov processes J Desharnais, V Gupta, R Jagadeesan, P Panangaden Theoretical computer science 318 (3), 323-354, 2004 | 322 | 2004 |

Bisimulation for labelled Markov processes J Desharnais, A Edalat, P Panangaden Information and Computation 179 (2), 163-193, 2002 | 311 | 2002 |

The metric analogue of weak bisimulation for probabilistic processes J Desharnais, R Jagadeesan, V Gupta, P Panangaden Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 413-422, 2002 | 184 | 2002 |

Metrics for labeled Markov systems J Desharnais, V Gupta, R Jagadeesan, P Panangaden | 183 | 2001 |

Approximating labelled Markov processes J Desharnais, V Gupta, R Jagadeesan, P Panangaden Information and Computation 184 (1), 160-200, 2003 | 137 | 2003 |

Bisimulation for labelled Markov processes R Blute, J Desharnais, A Edalat, P Panangaden Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997 | 120 | 1997 |

Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes J Desharnais, P Panangaden The Journal of Logic and Algebraic Programming 56 (1-2), 99-115, 2003 | 108 | 2003 |

A logical characterization of bisimulation for labeled Markov processes J Desharnais, A Edalat, P Panangaden Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 101 | 1998 |

Bisimulation and cocongruence for probabilistic systems V Danos, J Desharnais, F Laviolette, P Panangaden Information and Computation 204 (4), 503-523, 2006 | 100 | 2006 |

Approximate analysis of probabilistic processes: Logic, simulation and games J Desharnais, F Laviolette, M Tracol 2008 Fifth International Conference on Quantitative Evaluation of Systems …, 2008 | 90 | 2008 |

Labelled markov processes J Desharnais McGill University, 1999 | 73 | 1999 |

Approximating labeled Markov processes J Desharnais, R Jagadeesan, V Gupta, P Panangaden Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 60 | 2000 |

Weak bisimulation is sound and complete for PCTL J Desharnais, V Gupta, R Jagadeesan, P Panangaden International Conference on Concurrency Theory, 355-370, 2002 | 45 | 2002 |

Computing distances between probabilistic automata M Tracol, J Desharnais, A Zhioua arXiv preprint arXiv:1107.1206, 2011 | 42 | 2011 |

Labeled Markov processes: stronger and faster approximations V Danos, J Desharnais 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 34 | 2003 |

Weak bisimulation is sound and complete for pCTL∗ J Desharnais, V Gupta, R Jagadeesan, P Panangaden Information and Computation 208 (2), 203-219, 2010 | 30 | 2010 |

Conditional expectation and the approximation of labelled Markov processes V Danos, J Desharnais, P Panangaden International Conference on Concurrency Theory, 477-491, 2003 | 22 | 2003 |

A logical characterization of bisimulation for labelled Markov processes. In proceedings of the 13th IEEE Symposium On Logic In Computer Science, Indianapolis J Desharnais, A Edalat, P Panangaden IEEE Press, June 356, 1-28, 1998 | 19 | 1998 |

Logical characterization of simulation for Markov chains J ee Desharnais | 12 | 1999 |

Testing probabilistic equivalence through reinforcement learning J Desharnais, F Laviolette, S Zhioua International Conference on Foundations of Software Technology and …, 2006 | 9 | 2006 |