| Characterising testing preorders for finite probabilistic processes Y Deng, M Hennessy, R van Glabbeek, C Morgan Logical Methods in Computer Science 4, 2008 | 125 | 2008 |
| On the semantics of Markov automata Y Deng, M Hennessy Information and Computation 222, 139-168, 2013 | 101 | 2013 |
| Shanghai Jiao Tong University Y Feng China, 0 | 98 | |
| Metrics for action-labelled quantitative transition systems Y Deng, T Chothia, C Palamidessi, J Pang Electronic Notes in Theoretical Computer Science 153 (2), 79-96, 2006 | 96 | 2006 |
| Measuring anonymity with relative entropy Y Deng, J Pang, P Wu Formal Aspects in Security and Trust: Fourth International Workshop, FAST …, 2007 | 95 | 2007 |
| Testing finitary probabilistic processes Y Deng, Y Deng Semantics of Probabilistic Processes: An Operational Approach, 149-231, 2014 | 83 | 2014 |
| Ensuring termination by typability Y Deng, D Sangiorgi Information and Computation 204 (7), 1045-1082, 2006 | 75 | 2006 |
| The Kantorovich metric in computer science: A brief survey Y Deng, W Du Electronic Notes in Theoretical Computer Science 253 (3), 73-82, 2009 | 72 | 2009 |
| Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time P Wang, H Fu, K Chatterjee, Y Deng, M Xu Proceedings of the ACM on Programming Languages 4 (POPL), 1-30, 2019 | 64 | 2019 |
| Logical characterizations of simulation and bisimulation for fuzzy transition systems H Wu, Y Deng Fuzzy Sets and Systems 301, 19-36, 2016 | 60 | 2016 |
| Symbolic bisimulation for quantum processes Y Feng, Y Deng, M Ying ACM Transactions on Computational Logic (TOCL) 15 (2), 1-32, 2014 | 51 | 2014 |
| Remarks on testing probabilistic processes Y Deng, R van Glabbeek, M Hennessy, C Morgan, C Zhang Electronic Notes in Theoretical Computer Science 172, 359-397, 2007 | 49 | 2007 |
| Open bisimulation for quantum processes Y Deng, Y Feng IFIP International Conference on Theoretical Computer Science, 119-133, 2012 | 46 | 2012 |
| Weak probabilistic anonymity Y Deng, C Palamidessi, J Pang Electronic Notes in Theoretical Computer Science 180 (1), 55-76, 2007 | 46 | 2007 |
| Compositional reasoning for probabilistic finite-state behaviors Y Deng, C Palamidessi, J Pang Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated …, 2005 | 45 | 2005 |
| Logical, metric, and algorithmic characterisations of probabilistic bisimulation Y Deng, W Du arXiv preprint arXiv:1103.4577, 2011 | 44 | 2011 |
| Semantics of Probabilistic Processes: An Operational Approach Y Deng Springer, 2015 | 42 | 2015 |
| Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems H Wu, Y Chen, T Bu, Y Deng Fuzzy Sets and Systems 333, 106-123, 2018 | 38 | 2018 |
| Scalar outcomes suffice for finitary probabilistic testing Y Deng, R van Glabbeek, C Morgan, C Zhang Programming Languages and Systems: 16th European Symposium on Programming …, 2007 | 37 | 2007 |
| Axiomatizations for probabilistic finite-state behaviors Y Deng, C Palamidessi International Conference on Foundations of Software Science and Computation …, 2005 | 37 | 2005 |
Rob van GlabbeekUNSWVerified email at cs.stanford.edu
