Performing CTL model checking via DNA computing
The computation using deoxyribonucleic acid (DNA) molecules provides an enormous parallel method that breaks through the limitations of the efficiency of traditional electronic computers. Model checking is a standard formal verification technique, which has been widely used in many fields of computation. It is also a well-known complex problem in computing theory. Until now, there is only one basic formula in the computation tree logic (CTL), for which model checking via DNA computing can be conducted. To this end, Adleman’s model based on DNA computing is used in this paper, based on which a series of DNA-computing-based model-checking algorithms to check the four basic CTL formulas are proposed. As a result, a core of the DNA version of the CTL model-checking problem is solved. The simulated experimental results show that the new algorithms are valid and can be properly implemented in molecular biology.
KeywordsDNA computing Model checking Computation tree logic DNA molecules
This study was partially funded by the National Natural Science Foundation of China under Grant Nos. U1204608 and 61572444 and China Postdoctoral Science Foundation under Grant No. 2015M572120.
Compliance with ethical standards
Conflict of interest
The authors of this paper declare that they have no conflicts of interest.
This article does not contain any studies with human participants or animals performed by the authors.
- Bhat G, Cleaveland R, Grumberg O (2002) Efficient on-the-fly model checking for CTL. In: IEEE symposium on logic in computer science, p 388Google Scholar
- Camilli M, Bellettini C, Capra L, Monga M (2015) CTL Model checking in the cloud using MapReduce. In: International symposium on symbolic and numeric algorithms for scientific computing, pp 333–340Google Scholar
- Edmund MC, Doron AP, Orna G (1999) Model checking. MIT, MassachusettsGoogle Scholar
- Iwashita H, Nakata T, Hirose F(1997) CTL model checking based on forward state traversal. In: IEEE/ACM international conference on computer-aided design, pp 82–87Google Scholar
- Li YM, Huang SB, Lin JY (2015a) Data flow analysis and formal method. In: International conference of young computer scientists, engineers and educators, ICYCSEE 2015, intelligent computation in big data era, volume 503 of the series communications in computer and information science, Harbin, China, pp 398–406Google Scholar
- NUPACK (2015) http://www.nupack.org/partition/new
- Pnueli A (1977) The temporal logic of programs. In: Symposium on foundations of computer science, Washington, DC, USA, pp 46–57Google Scholar
- Roberto C (2011) LTL model-checking for security protocols. AI Commun 24(3):281–283Google Scholar
- Wang YF, Cui GZ (2013) The design and optimization of DNA coding sequence. Publishing House of Electronics Industry, BeijingGoogle Scholar
- Xu J (2013) The development programme of the Zhongzhou I DNA computer. Technical report TR-12. Beijing University, Beijing (in Chinese) Google Scholar
- Xu J (2014) Forthcoming era of biological computer. Bull Chin Acad Sci 29(1):42–54 (in Chinese)Google Scholar