Josee Desharnais, Ph.D.
Affiliations: | 2000 | McGill University, Montreal, QC, Canada |
Google:
"Josee Desharnais"Parents
Sign in to add mentorPrakash Panangaden | grad student | 2000 | McGill | |
(Labelled Markov processes.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kozyri E, Schneider FB, Bedford A, et al. (2019) Beyond Labels: Permissiveness for Dynamic Information Flow Enforcement Cell Structure and Function. 351-366 |
Desharnais J, Laviolette F, Zhioua S. (2013) Testing probabilistic equivalence through Reinforcement Learning Information and Computation |
Desharnais J, Laviolette F, Turgeon A. (2011) A logical duality for underspecified probabilistic systems Information and Computation. 209: 850-871 |
Desharnais J, Gupta V, Jagadeesan R, et al. (2010) Weak bisimulation is sound and complete for pCTL* Information and Computation. 208: 203-219 |
Danos V, Desharnais J, Laviolette F, et al. (2006) Bisimulation and cocongruence for probabilistic systems Information and Computation. 204: 503-523 |
Desharnais J, Laviolette F, Moturu KPD, et al. (2006) Trace equivalence characterization through reinforcement learning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4013: 371-382 |
Desharnais J, Gupta V, Jagadeesan R, et al. (2004) Metrics for labelled Markov processes Theoretical Computer Science. 318: 323-354 |
Danos V, Desharnais J, Panangaden P. (2004) Labelled Markov Processes: Stronger and faster approximations Electronic Notes in Theoretical Computer Science. 87: 157-203 |
Desharnais J, Panangaden P. (2004) Electronic Notes in Theoretical Computer Science: Preface Electronic Notes in Theoretical Computer Science. 87: 1-3 |
Desharnais J, Panangaden P. (2003) Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes Journal of Logic and Algebraic Programming. 56: 99-115 |