#### Filter Results:

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Formal semantics of programming languages Y. Deng@SJTU 2 Why formal semantics? • To understand how programs behave • To build a mathematical model useful for program analysis and verification Formal semantics of programming languages Y. Deng@SJTU 3 Three kinds of semantics (1/3) • Operational semantics: describing the meaning of a programming language by… (More)

- Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun Pang
- Electr. Notes Theor. Comput. Sci.
- 2006

This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric corresponds to a bisimulation and that the greatest… (More)

- Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan
- 22nd Annual IEEE Symposium on Logic in Computer…
- 2007

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both… (More)

- Yuxin Deng, Davide Sangiorgi
- Inf. Comput.
- 2004

A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtained by successive refinements of the types of the simply typed π-calculus. For all (but one of) the type systems we also present upper bounds to the number of steps well-typed… (More)

- Yuxin Deng, Jun Pang, Peng Wu
- Formal Aspects in Security and Trust
- 2006

Anonymity is the property of maintaining secret the identity of users performing a certain action. Anonymity protocols often use random mechanisms which can be described probabilistically. In this paper , we propose a probabilistic process calculus to describe protocols for ensuring anonymity, and we use the notion of relative entropy from information… (More)

- Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
- Electr. Notes Theor. Comput. Sci.
- 2007

We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer… (More)

- Yuxin Deng, Wenjie Du
- ArXiv
- 2011

Many behavioural equivalences or preorders for probabilistic processes involve a lifting operation that turns a relation on states into a relation on distributions of states. We show that several existing proposals for lifting relations can be reconciled to be different presentations of essentially the same lifting operation. More interestingly, this… (More)

- Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang
- ESOP
- 2007

The question of equivalence has long vexed research in con-currency, leading to many different denotational-and bisimulation-based approaches; a breakthrough occurred with the insight that tests expressed within the concurrent framework itself, based on a special " success action " , yield equivalences that make only inarguable distinctions. When… (More)

- Yuxin Deng, Yuan Feng
- IFIP TCS
- 2012

Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between quantum processes. We also give a modal characterisation of open… (More)

- Yuxin Deng, Matthew Hennessy
- Inf. Comput.
- 2011

Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a natural ex-tensional behavioural equivalence between such systems, a… (More)