#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2013

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yangjia Li, Nengkun Yu, Mingsheng Ying
- Acta Informatica
- 2013

We define a language-independent model of nondeterministic quantum programs in which a quantum program consists of a finite set of quantum processes. These processes are represented by quantum Markov chains over the common state space, which formalize the quantum mechanical behaviors of the machine. An execution of a nondeterministic quantum program is… (More)

- Mingsheng Ying, Yangjia Li, Nengkun Yu, Yuan Feng
- ACM Trans. Comput. Log.
- 2014

We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain (closed) subspaces of state Hilbert spaces are used as the atomic propositions about the behavior of systems. We provide an algorithm for verifying invariants of quantum automata. Then, an… (More)

- Gaogao Yan, Li Jiao, Yangjia Li, Shuling Wang, Naijun Zhan
- FM
- 2016

Hybrid Communicating Sequential Processes (HCSP) is a powerful formal modeling language for hybrid systems, which is an extension of CSP by introducing differential equations for modeling continuous evolution and interrupts for modeling interaction between continuous and discrete dynamics. In this paper, we investigate the semantic foundation for HCSP from… (More)

- Yangjia Li, Mingsheng Ying
- CONCUR
- 2014

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often… (More)

- Yangjia Li, Mingsheng Ying
- ArXiv
- 2014

Yangjia Li and Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China Centre for Quantum Computation and Intelligent Systems (QCIS), Faculty of Engineering and Information… (More)

- Tao Liu, Yangjia Li, Shuling Wang, Mingsheng Ying, Naijun Zhan
- ArXiv
- 2016

Quantum Hoare Logic (QHL) was introduced in [36] to specify and reason about quantum programs. In this paper, we implement a theorem prover for QHL based on Isabelle/HOL. By applying the theorem prover, verifying a quantum program against a specification is transformed equivalently into an order relation between matrices. Due to the limitation of… (More)

- Bai Xue, Peter Nazier Mosaad, Martin Fränzle, Mingshuai Chen, Yangjia Li, Naijun Zhan
- FORMATS
- 2017

- Yangjia Li, Hui Lu, Naijun Zhan, Mingshuai Chen, Guohua Wu
- ArXiv
- 2015

In this paper, we investigate the termination problem of a family of polynomial programs, in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations. Our main result is that the non-terminating inputs of such a polynomial program is algorithmically computable according to a… (More)

- Ting Gan, Mingshuai Chen, Yangjia Li, Bican Xia, Naijun Zhan
- ECC
- 2016