Josée Desharnais
Josée Desharnais
Professor of Computer Science, Laval university
Подтвержден адрес электронной почты в домене ift.ulaval.ca
Название
Процитировано
Процитировано
Год
Metrics for labelled Markov processes
J Desharnais, V Gupta, R Jagadeesan, P Panangaden
Theoretical computer science 318 (3), 323-354, 2004
3352004
Bisimulation for labelled Markov processes
J Desharnais, A Edalat, P Panangaden
Information and Computation 179 (2), 163-193, 2002
3172002
Metrics for labeled Markov systems
J Desharnais, V Gupta, R Jagadeesan, P Panangaden
1912001
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
1862002
Approximating labelled Markov processes
J Desharnais, V Gupta, R Jagadeesan, P Panangaden
Information and Computation 184 (1), 160-200, 2003
1402003
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
1221997
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
1132003
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
1051998
Bisimulation and cocongruence for probabilistic systems
V Danos, J Desharnais, F Laviolette, P Panangaden
Information and Computation 204 (4), 503-523, 2006
1042006
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
952008
Labelled markov processes
J Desharnais
791999
Weak bisimulation is sound and complete for PCTL
J Desharnais, V Gupta, R Jagadeesan, P Panangaden
International Conference on Concurrency Theory, 355-370, 2002
452002
Computing distances between probabilistic automata
M Tracol, J Desharnais, A Zhioua
arXiv preprint arXiv:1107.1206, 2011
422011
Approximating labeled Markov processes
J Desharnais, R Jagadeesan, V Gupta, P Panangaden
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000
422000
Labeled Markov processes: stronger and faster approximations
V Danos, J Desharnais
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
342003
Weak bisimulation is sound and complete for pCTL∗
J Desharnais, V Gupta, R Jagadeesan, P Panangaden
Information and Computation 208 (2), 203-219, 2010
312010
Conditional expectation and the approximation of labelled Markov processes
V Danos, J Desharnais, P Panangaden
International Conference on Concurrency Theory, 477-491, 2003
212003
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 356, 478-489, 1998
181998
Logical characterization of simulation for Markov chains
J ee Desharnais
131999
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
112017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20