- A Local Algorithm for Checking Probabilistic Bisimilarity Shanghai Jiao Tong University, China
- A Framework for Verifying Data-Centric Protocols
- Preliminary Report. Final version to appear in: Proceedings QAPL 2011
- QAPL 2009 Submission Kantorovich Metric in Computer Science
- Towards an algebraic theory of typed mobile Yuxin Deng a and Davide Sangiorgi b
- College doctoral pour obtenir le grade de
- Compositional Reasoning for Markov Decision Processes (Extended Abstract)
- Measuring Anonymity with Relative Entropy Yuxin Deng 1 , Jun Pang 2 , Peng Wu 3
- A Local Algorithm for Checking Probabilistic Bisimilarity Shanghai Jiao Tong University, China
- Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
- QAPL 2005 Preliminary Version Metrics for Actionlabelled Quantitative
- Game Characterizations of Process Equivalences Xin Chen # and Yuxin Deng ##
- Verifying Anonymous Credential Systems in Applied Pi Xiangxi Li 1 , Yu Zhang 2 , and Yuxin Deng 1#
- Towards Automatic Measurement of Probabilistic Processes Lin Song, Yuxin Deng, Xiaojuan Cai
- Compositional Reasoning for Markov Decision Processes (Extended Abstract)
- On the Semantics of Markov Automata Yuxin Deng 1,3,4 # and Matthew Hennessy 2##
- On Automatic Verification of Selfstabilizing Population Protocols University of Luxembourg
- Axiomatizations for Probabilistic Finite-State Yuxin Deng 1? and Catuscia Palamidessi 2??
- ISDT 2009 Submission On Mobility and Communication
- Probabilistic Barbed Congruence Yuxin Deng a
- Analyzing an Electronic Cash Protocol Using Applied Pi Calculus #
- Verifying Self-stabilizing Population Protocols with Coq Yuxin Deng and Jean-Francois Monin
- Scalar Outcomes Suffice for Finitary Probabilistic Testing
- Ensuring Termination by Typability # Yuxin Deng 1 and Davide Sangiorgi 2
- Towards an algebraic theory of typed mobile Yuxin Deng a
- Ensuring Termination by Typability Yuxin Deng1
- Measuring Anonymity with Relative Entropy Yuxin Deng1
- A SIMPLE COMPLETENESS PROOF FOR THE AXIOMATISATIONS OF WEAK BEHAVIOURAL
- Axiomatizations for probabilistic finitestate behaviors #
- QAPL 2005 Preliminary Version Metrics for Action-labelled Quantitative
- Coll`ege doctoral pour obtenir le grade de
- CHARACTERISING TESTING PREORDERS FOR FINITE PROBABILISTIC PROCESSES
- ENSURING TERMINATION BY TYPABILITY Yuxin Deng 1 and Davide Sangiorgi 2
- Towards an algebraic theory of typed mobile processes #
- GDP Festschrift ENTCS, to appear Remarks on Testing Probabilistic Processes
- SecCo 2005 Preliminary Version Weak Probabilistic Anonymity 1
- College doctoral Axiomatisations and Types
- Kantorovich Metric in Computer Science: A Brief Survey
- Towards an algebraic theory of typed mobile Yuxin Deng1
- ENSURING TERMINATION BY TYPABILITY Yuxin Deng1 and Davide Sangiorgi2
- Characterising Testing Preorders for Finite Probabilistic Processes Jiao Tong University
- Axiomatizations for probabilistic finite-state Yuxin Deng a
- Coll`ege doctoral Axiomatisations and Types
- Verifying Selfstabilizing Population Protocols with Coq Yuxin Deng # and JeanFrancois Monin +
- Axiomatizations for Probabilistic Finite-State Yuxin Deng1
- Compositional Reasoning for Probabilistic Finite-State Behaviors
- GDP Festschrift ENTCS, to appear Remarks on Testing Probabilistic Processes
- ISDT 2009 Submission On Mobility and Communication
- SecCo 2005 Preliminary Version Weak Probabilistic Anonymity 1
- Characterising Probabilistic Processes Logically Yuxin Deng1,2
- Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
- A ###### ############ ##### ### ### Shanghai Jiaotong University
- Compositional Reasoning for Probabilistic FiniteState Behaviors
- A ###### ############ ##### ### ### Shanghai Jiaotong University
- Testing Finitary Probabilistic Processes (Extended Abstract)
- Verifying Anonymous Credential Systems in Applied Pi Xiangxi Li1
- Probabilistic Barbed Congruence Yuxin Deng a , Wenjie Du b
- Preliminary Report. Final version to appear in: Proceedings QAPL 2011
- CHARACTERISING TESTING PREORDERS FOR FINITE PROBABILISTIC PROCESSES
- Testing Finitary Probabilistic Processes (Extended Abstract)
- Game Characterizations of Process Equivalences and Yuxin Deng
- Characterising Probabilistic Processes Logically Yuxin Deng 1,2# and Rob van Glabbeek 3,4
- Characterising Testing Preorders for Finite Probabilistic Processes Yuxin Deng #
- On Automatic Verification of Self-stabilizing Population Protocols University of Luxembourg
- On the Semantics of Markov Automata Yuxin Deng 1,3,4 # Matthew Hennessy 2+
- Submitted to: LINEARITY 2012
