Yuxin Deng
Yuxin Deng
Professor, East China Normal University
Verified email at sei.ecnu.edu.cn - Homepage
Title
Cited by
Cited by
Year
Characterising testing preorders for finite probabilistic processes
Y Deng, R Van Glabbeek, M Hennessy, C Morgan, C Zhang
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 313-325, 2007
1152007
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
852006
Measuring anonymity with relative entropy
Y Deng, J Pang, P Wu
International Workshop on Formal Aspects in Security and Trust, 65-79, 2006
792006
Testing finitary probabilistic processes
Y Deng, R Van Glabbeek, M Hennessy, C Morgan
International Conference on Concurrency Theory, 274-288, 2009
752009
On the semantics of Markov automata
Y Deng, M Hennessy
Information and Computation 222, 139-168, 2013
692013
Chinese Academy of Sciences
Y Deng, M Hennessy
662012
The Kantorovich metric in computer science: A brief survey
Y Deng, W Du
Electronic Notes in Theoretical Computer Science 253 (3), 73-82, 2009
632009
Ensuring termination by typability
Y Deng, D Sangiorgi
Information and Computation 204 (7), 1045-1082, 2006
562006
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
472007
Compositional reasoning for probabilistic finite-state behaviors
Y Deng, C Palamidessi, J Pang
Processes, Terms and Cycles: Steps on the Road to Infinity, 309-337, 2005
432005
Weak probabilistic anonymity
Y Deng, C Palamidessi, J Pang
Electronic Notes in Theoretical Computer Science 180 (1), 55-76, 2007
422007
Logical, metric, and algorithmic characterisations of probabilistic bisimulation
Y Deng, W Du
arXiv preprint arXiv:1103.4577, 2011
392011
Scalar outcomes suffice for finitary probabilistic testing
Y Deng, R Van Glabbeek, C Morgan, C Zhang
European Symposium on Programming, 363-378, 2007
362007
Axiomatizations for probabilistic finite-state behaviors
Y Deng, C Palamidessi
International Conference on Foundations of Software Science and Computation …, 2005
342005
On the semantics of Markov automata
Y Deng, M Hennessy
International Colloquium on Automata, Languages, and Programming, 307-318, 2011
332011
Symbolic bisimulation for quantum processes
Y Feng, Y Deng, M Ying
ACM Transactions on Computational Logic (TOCL) 15 (2), 1-32, 2014
322014
Logical characterizations of simulation and bisimulation for fuzzy transition systems
H Wu, Y Deng
Fuzzy Sets and Systems 301, 19-36, 2016
302016
Verifying self-stabilizing population protocols with coq
Y Deng, JF Monin
2009 Third IEEE International Symposium on Theoretical Aspects of Software …, 2009
302009
Axiomatizations for probabilistic finite-state behaviors
Y Deng, C Palamidessi
Theoretical Computer Science 373 (1-2), 92-114, 2007
292007
Open bisimulation for quantum processes
Y Deng, Y Feng
IFIP International Conference on Theoretical Computer Science, 119-133, 2012
282012
The system can't perform the operation now. Try again later.
Articles 1–20