Metrics for labelled Markov processes J Desharnais, V Gupta, R Jagadeesan, P Panangaden Theoretical computer science 318 (3), 323-354, 2004 | 402 | 2004 |
Bisimulation for labelled Markov processes J Desharnais, A Edalat, P Panangaden Information and Computation 179 (2), 163-193, 2002 | 368 | 2002 |
Metrics for labeled Markov systems J Desharnais, V Gupta, R Jagadeesan, P Panangaden CONCUR’99 Concurrency Theory: 10th International Conference Eindhoven, The …, 1999 | 211 | 1999 |
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 | 204 | 2002 |
Approximating labelled Markov processes J Desharnais, V Gupta, R Jagadeesan, P Panangaden Information and Computation 184 (1), 160-200, 2003 | 144 | 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 | 142 | 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 | 124 | 2003 |
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 | 121 | 2008 |
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 | 121 | 1998 |
Bisimulation and cocongruence for probabilistic systems V Danos, J Desharnais, F Laviolette, P Panangaden Information and Computation 204 (4), 503-523, 2006 | 116 | 2006 |
Labelled markov processes J Desharnais McGill University, 1999 | 90 | 1999 |
Approximating labeled Markov processes J Desharnais, R Jagadeesan, V Gupta, P Panangaden Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 55 | 2000 |
Computing distances between probabilistic automata M Tracol, J Desharnais, A Zhioua arXiv preprint arXiv:1107.1206, 2011 | 50 | 2011 |
Weak Bisimulation is Sound and Complete for PCTL* J Desharnais, V Gupta, R Jagadeesan, P Panangaden International Conference on Concurrency Theory, 355-370, 2002 | 46 | 2002 |
Labeled Markov processes: stronger and faster approximations V Danos, J Desharnais 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 35 | 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 | 33 | 2010 |
Conditional expectation and the approximation of labelled Markov processes V Danos, J Desharnais, P Panangaden CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 21 | 2003 |
Logical characterization of simulation for Markov chains J ee Desharnais | 14 | 1999 |
A progress-sensitive flow-sensitive inlined information-flow control monitor (extended version) A Bedford, S Chong, J Desharnais, E Kozyri, N Tawbi Computers & Security 71, 114-131, 2017 | 13 | 2017 |
Enforcing information flow by combining static and dynamic analysis A Bedford, J Desharnais, TG Godonou, N Tawbi International Symposium on Foundations and Practice of Security, 83-101, 2013 | 10 | 2013 |