# Yuxin Deng

According to our database

^{1}, Yuxin Deng## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems.

Fuzzy Sets and Systems, 2018

2017

Probabilistic bisimilarity as testing equivalence.

Inf. Comput., 2017

Bisimulations for probabilistic linear lambda calculi.

Proceedings of the 11th International Symposium on Theoretical Aspects of Software Engineering, 2017

On Equivalence Checking of Nondeterministic Finite Automata.

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

An Algebraic Approach to Automatic Reasoning for NetKAT Based on Its Operational Semantics.

Proceedings of the Formal Methods and Software Engineering, 2017

2016

Relating reasoning methodologies in linear logic and process algebra.

Mathematical Structures in Computer Science, 2016

Logical characterizations of simulation and bisimulation for fuzzy transition systems.

Fuzzy Sets and Systems, 2016

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems.

Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2016

2015

Program equivalence in linear contexts.

Theor. Comput. Sci., 2015

Book Introduction by the Author: Semantics of Probabilistic Processes An Operational Approach.

Bulletin of the EATCS, 2015

Modal Characterisations of Behavioural Pseudometrics.

CoRR, 2015

On Coinduction and Quantum Lambda Calculi.

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Symbolic Bisimulation for Quantum Processes.

ACM Trans. Comput. Log., 2014

Real-reward testing for probabilistic processes.

Theor. Comput. Sci., 2014

Modal Characterisations of Probabilistic and Fuzzy Bisimulations.

Proceedings of the Formal Methods and Software Engineering, 2014

2013

Compositional reasoning for weighted Markov decision processes.

Sci. Comput. Program., 2013

On the semantics of Markov automata.

Inf. Comput., 2013

The Buffered π-Calculus: A Model for Concurrent Languages.

Proceedings of the Language and Automata Theory and Applications, 2013

2012

The Buffered π-Calculus: A Model for Concurrent Languages

CoRR, 2012

Relating Reasoning Methodologies in Linear Logic and Process Algebra

Proceedings of the Proceedings 2nd International Workshop on Linearity, 2012

Symbolic bisimulation for quantum processes

CoRR, 2012

Open Bisimulation for Quantum Processes

CoRR, 2012

Open Bisimulation for Quantum Processes.

Proceedings of the Theoretical Computer Science, 2012

2011

Real-Reward Testing for Probabilistic Processes (Extended Abstract)

Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

Program Equivalence in Linear Contexts

CoRR, 2011

Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation

CoRR, 2011

On the Semantics of Markov Automata.

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Compositional Reasoning for Markov Decision Processes - (Extended Abstract).

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

A Framework for Verifying Data-Centric Protocols.

Proceedings of the Formal Techniques for Distributed Systems, 2011

2010

Characterising Probabilistic Processes Logically

CoRR, 2010

Characterising Probabilistic Processes Logically - (Extended Abstract).

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

On Mobility and Communication.

Electr. Notes Theor. Comput. Sci., 2009

The Kantorovich Metric in Computer Science: A Brief Survey.

Electr. Notes Theor. Comput. Sci., 2009

Verifying Self-stabilizing Population Protocols with Coq.

Proceedings of the TASE 2009, 2009

A Local Algorithm for Checking Probabilistic Bisimilarity.

Proceedings of the Fourth International Conference on Frontier of Computer Science and Technology, 2009

Testing Finitary Probabilistic Processes.

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Verifying Anonymous Credential Systems in Applied Pi Calculus.

Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

2008

Characterising Testing Preorders for Finite Probabilistic Processes.

Logical Methods in Computer Science, 2008

On automatic verification of self-stabilizing population protocols.

Frontiers Comput. Sci. China, 2008

Characterising Testing Preorders for Finite Probabilistic Processes

CoRR, 2008

On Automatic Verification of Self-Stabilizing Population Protocols.

Proceedings of the Second IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering, 2008

A Simpler Framework Based on the Applied Pi Calculus and Its Application to Electronic Cash Protocol.

Proceedings of the 2008 International Symposium on Computer Science and Computational Technology, 2008

Game Characterizations of Process Equivalences.

Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007

Axiomatizations for probabilistic finite-state behaviors.

Theor. Comput. Sci., 2007

Weak Probabilistic Anonymity.

Electr. Notes Theor. Comput. Sci., 2007

Remarks on Testing Probabilistic Processes.

Electr. Notes Theor. Comput. Sci., 2007

Probabilistic Barbed Congruence.

Electr. Notes Theor. Comput. Sci., 2007

A Simple Completeness Proof for the Axiomatisations of Weak Behavioural Equivalences.

Bulletin of the EATCS, 2007

Towards Automatic Measurement of Probabilistic Processes.

Proceedings of the Seventh International Conference on Quality Software (QSIC 2007), 2007

Characterising Testing Preorders for Finite Probabilistic Processes.

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Scalar Outcomes Suffice for Finitary Probabilistic Testing.

Proceedings of the Programming Languages and Systems, 2007

Analyzing an Electronic Cash Protocol Using Applied Pi Calculus.

Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006

Towards an algebraic theory of typed mobile processes.

Theor. Comput. Sci., 2006

Ensuring termination by typability.

Inf. Comput., 2006

Metrics for Action-labelled Quantitative Transition Systems.

Electr. Notes Theor. Comput. Sci., 2006

Measuring Anonymity with Relative Entropy.

Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

2005

Axiomatisations and Types for Probabilistic and Mobile Processes. (Axiomatisations et types pour des processus probabilistes et mobiles).

PhD thesis, 2005

Axiomatizations for Probabilistic Finite-State Behaviors.

Proceedings of the Foundations of Software Science and Computational Structures, 2005

Compositional Reasoning for Probabilistic Finite-State Behaviors.

Proceedings of the Processes, 2005

2004

Ensuring Termination by Typability.

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Towards an Algebraic Theory of Typed Mobile Processes.

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004