软件定义光网络创新实验环境.docxVIP

Molecular model checking for a branching time logic ZHU Weijun (School of Information Engineering, Zhengzhou University, Zhengzhou, 450001, China) Abstract: The computation using Deoxyribonucleic Acid (DNA) molecules provides a huge parallel way that break through the limitations of efficiency of traditional electronic computers. The Model checking is a popular formal verification technique which has been widely used in many fields of computations, and it is also a famous complex problem in the computing theory. Up to now, the branching-time logics seems hardly to be conducted model checking via DNA computing. To this end, Adleman’s model based on DNA computing is employed in this paper. On the basis of it, a series of DNA-computing-based model checking algorithms for checking some basic formulas in a representative branching-time logic is proposed. As a result, a core of the DNA version of this model checking problem is solved in this way. The simulated experimental results show that the new algorithms are valid in computational logic, and they can be properly implemented in molecular biology. Key words: DNA Computing; Model Checking; Branching Time Logic; DNA Molecules 0 Introduction Model Checking (MC) was proposed by Turing Award winner Prof. Clarke et al [1]. The MC algorithms answer automatically the question whether a system satisfies the given property or not. The model checking is widely used in the fields of hardware verification [1], data flow analysis [2], network protocol verification, security protocol verification [3], software verification [4] and biological system [5] et al. The general principles of MC can be given as follows. A system model is constructed with an automaton, a property which the system should satisfies is described by a temporal logic formula. If the automaton is a model of the formula, then the system model satisfies the properties, otherwise, the system doesn’t satisfy the properties. Turing Award winner Prof. Pnuelis Linear Tem