Skip to main content
SpringerLink
Log in

Exploring Computation Tree Logic with Past-Time Operator Model Checking Using DNA Computing

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1160))

  • 881 Accesses

Abstract

Computation tree logic (CTL) model checking is a verification technique that is important to safety-critical systems. DNA computing provides new ideas for improving the efficiency and solving the state space explosion problem of CTL model checking. However, existing research mainly focuses on DNA computing methods for checking CTL with future-time operators and has not addressed CTL with past-time operators (CTLP). In this paper, we propose a DNA computing method for CTLP model checking. First, a system to be checked and a CTLP formula are encoded by DNA strands. Next, all the strands are mixed into a test tube. Then, the complementary strands in the test tube hybridize and form fully or partially double-stranded DNA molecules. Finally, a series of biochemical operations are performed to detect the double-stranded DNA molecules, and whether the system satisfies the CTLP formula is determined. Simulations show the validity and effectiveness of the method. Our new method enhances the power and lays the foundation for the completeness of CTL model checking.

This work was supported by the National Natural Science Fund of China under Grant 61572444 and Science and Technology Research Plan of Henan province (International Scientific Cooperation Projects) under Grant 172102410065.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Xu, J., Tan, G., Fan, Y., Guo, Y.: DNA computer principle, advances and difficulties (IV): on the models of DNA computer. Chin. J. Comput. 30(6), 881–893 (2007). (In Chinese)

    MathSciNet  Google Scholar 

  2. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1023 (1994)

    Article  Google Scholar 

  3. Lipton, R.: DNA solution of hard computational problems. Science 268(5210), 542–545 (1995)

    Article  Google Scholar 

  4. Roweis, S., et al.: A sticker-based model for DNA computation. J. Comput. Biol. 5(4), 615–629 (1998)

    Article  Google Scholar 

  5. Ouyang, Q., Peter, D., Liu, S., Libchaber, A.: DNA solution of the maximal clique problem. Science 278(5337), 446–449 (1997)

    Article  Google Scholar 

  6. Pan, L., Xu, J., Liu, Y.: A surface-based DNA algorithm for the minimal vertex cover problem. Prog. Nat. Sci. 12(1), 78–80 (2003)

    MathSciNet  MATH  Google Scholar 

  7. Li, K., Yao, F., Xu, J., Li, R.: An O(1.414n) volume molecular solutions for the subset-sum problem on DNA-based supercomputing. Chin. J. Comput. 30(11), 1947–1953 (2007). (in Chinese)

    Google Scholar 

  8. Xu, J., Qiang, X., Yang, Y., Wang, B.: An unenumerative DNA computing model for vertex coloring problem. IEEE Trans. Nanobiosci. 10(2), 94–98 (2011)

    Article  Google Scholar 

  9. Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288(5469), 1223–1226 (2000)

    Article  Google Scholar 

  10. Xu, J., Qiang, X., Zhang, K., Zhang, C., Yang, J.: A DNA computing model for the graph vertex coloring problem based on a probe graph. Engineering 4(1), 61–77 (2018)

    Article  Google Scholar 

  11. Yang, J., Yin, Z., Huang, K., Cui, J.: The maximum matching problem based on self-assembly model of molecular beacon. Nanosci. Nanotechnol. Lett. 10, 213–218 (2018)

    Article  Google Scholar 

  12. Yin, P., Turberfield, A.J., Sahu, S., Reif, J.H.: Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 426–444. Springer, Heidelberg (2005). https://doi.org/10.1007/11493785_37

    Chapter  Google Scholar 

  13. Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and self-assembly of two-dimensional DNA crystals. Nature 394(6693), 539–544 (1998)

    Article  Google Scholar 

  14. Martínez-Pérez, I., Zimmermann, K., Ignatova, Z.: An autonomous DNA model for finite state automata. Int. J. Bioinform. Res. Appl. 5(1), 81–96 (2009)

    Article  Google Scholar 

  15. Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405–1416 (2016)

    Article  MathSciNet  Google Scholar 

  16. Shi, X., Wu, X., Song, T., Li, X.: Construction of DNA nanotubes with controllable diameters and patterns by using hierarchical DNA sub-tiles. Nanoscale 8(31), 14785–14792 (2016)

    Article  Google Scholar 

  17. Pan, L., Wang, Z., Li, Y., Zhang, C.: Nicking enzyme-controlled toehold regulation for DNA logic circuits. Nanoscale 9(46), 18223–18228 (2017)

    Article  Google Scholar 

  18. Yang, J., et al.: Entropy-driven DNA logic circuits regulated by DNAzyme. Nucleic Acids Res. 46(16), 8532–8541 (2018)

    Article  Google Scholar 

  19. Yang, J., Jiang, S., Liu, X., Pan, L., Zhang, C.: Aptamer-binding directed DNA origami pattern for logic gates. ACS Appl. Mater. Interfaces 8(49), 34054–34060 (2016)

    Article  Google Scholar 

  20. Yang, J., Song, Z., Liu, S., Zhang, Q., Zhang, C.: Dynamically arranging gold nanoparticles on DNA origami for molecular logic gates. ACS Appl. Mater. Interfaces 8(34), 22451–22456 (2016)

    Article  Google Scholar 

  21. Zhang, C., Yang, J., Jiang, S., Liu, Y., Yan, H.: DNAzyme-mediated DNA origami pattern for logic gates. Nano Lett. 16(1), 736–741 (2016)

    Article  Google Scholar 

  22. Zhang, C., Shen, L., Liang, C., Dong, Y., Yang, J., Xu, J.: DNA sequential logic gate using two-ring DNA. ACS Appl. Mater. Interfaces 8(14), 9370–9376 (2016)

    Article  Google Scholar 

  23. Wang, Y., Han, Q., Cui, G., Sun, J.: Hiding messages based on DNA sequence and recombinant DNA technique. IEEE Trans. Nanotechnol. 18, 299–307 (2019)

    Article  Google Scholar 

  24. Benenson, Y., Gil, B., Ben-Dor, U., Adar, R., Shapiro, E.: An autonomous molecular computer for logical control of gene expression. Nature 429(27), 1–6 (2004)

    Google Scholar 

  25. Nakagawa, H., Sakamoto, K., Sakakibara, Y.: Development of an In Vivo computer based on Escherichia coli. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 203–212. Springer, Heidelberg (2006). https://doi.org/10.1007/11753681_16

    Chapter  Google Scholar 

  26. Martínez-Pérez, I.M., Zhang, G., Ignatova, Z., Zimmermann, K.H.: Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype. BMC Bioinform. 8(1), 365–365 (2007)

    Article  Google Scholar 

  27. Rinaudo, K., Bleris, L., Maddamsetti, R., Subramanian, S., Weiss, R., Benenson, Y.: A universal RNAi-based logic evaluator that operates in mammalian cells. Nat. Biotechnol. 25(7), 795–801 (2007)

    Article  Google Scholar 

  28. Xie, Z., Wroblewska, L., Prochazka, L., Weiss, R., Benenson, Y.: Multi-input RNAi-based logic circuit for identification of specific cancer cells. Science 333(6047), 1307–1311 (2011)

    Article  Google Scholar 

  29. Clarke, E., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  30. Burch, J.R., Clarke, E.M., Long, D.E., McMillan, K.L., David, L.D.: Symbolic model checking for sequential circuit verification. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(4), 401–424 (1994)

    Article  Google Scholar 

  31. Clarke, E.M., et al.: Verification of the futurebus+ cache coherence protocol. Formal Methods Syst. Des. 6(2), 217–232 (1995). https://doi.org/10.1007/BF01383968

    Article  Google Scholar 

  32. Chan, W., et al.: Model checking large software specifications. IEEE Trans. Softw. Eng. 24(7), 498–520 (1998)

    Article  Google Scholar 

  33. Fu, S., Tayssir, T.: Efficient CTL model-checking for pushdown systems. Theoret. Comput. Sci. 549(3), 127–145 (2014)

    MathSciNet  MATH  Google Scholar 

  34. Brim, L., Češka, M., Šafránek, D.: Model checking of biological systems. In: Bernardo, M., de Vink, E., Di Pierro, A., Wiklicky, H. (eds.) SFM 2013. LNCS, vol. 7938, pp. 63–112. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38874-3_3

    Chapter  MATH  Google Scholar 

  35. Emerson, E.A., Hager, K.D., Konieczka, J.H.: Molecular model checking. Int. J. Found. Comput. Sci. 17(4), 733–742 (2006)

    Article  MathSciNet  Google Scholar 

  36. Zhu, W., Wang, Y., Zhou, Q., Nie, K.: Model checking computational tree logic using sticker automata. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds.) BIC-TA 2016. CCIS, vol. 681, pp. 12–20. Springer, Singapore (2016). https://doi.org/10.1007/978-981-10-3611-8_2

    Chapter  Google Scholar 

  37. Han, Y., Zhou, Q., Jiao, L., Nie, K., Zhang, C., Zhu, W.: Model checking for computation tree logic with past based on DNA computing. In: He, C., Mo, H., Pan, L., Zhao, Y. (eds.) BIC-TA 2017. CCIS, vol. 791, pp. 131–147. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-7179-9_11

    Chapter  Google Scholar 

  38. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196–218. Springer, Heidelberg (1985). https://doi.org/10.1007/3-540-15648-8_16

    Chapter  MATH  Google Scholar 

  39. Kupferman, O., Pnueli, A.: Once and for all. J. Comput. Syst. Sci. 78(2012), 981–996 (1995)

    MathSciNet  MATH  Google Scholar 

  40. Laroussinie, F., Schnoebelen, P.: Specification in CTL+Past for verification in CTL. Inf. Comput. 156(1–2), 236–263 (2000)

    Article  MathSciNet  Google Scholar 

  41. NUPACK. http://www.nupack.org. Accessed 9 Aug 2019

Download references

Author information

Authors and Affiliations

  1. School of Information Engineering, Zhengzhou University, Zhengzhou, 450001, China

    Ying-Jie Han, Xiao-Fei Nan, Shao-Huan Ban & Qing-Lei Zhou

Authors
  1. Ying-Jie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Fei Nan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shao-Huan Ban
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qing-Lei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qing-Lei Zhou .

Editor information

Editors and Affiliations

  1. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  2. Zhengzhou University, Zhengzhou, China

    Jing Liang

  3. Zhongyuan University of Technology, Zhengzhou, China

    Boyang Qu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, YJ., Nan, XF., Ban, SH., Zhou, QL. (2020). Exploring Computation Tree Logic with Past-Time Operator Model Checking Using DNA Computing. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1160. Springer, Singapore. https://doi.org/10.1007/978-981-15-3415-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3415-7_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3414-0

  • Online ISBN: 978-981-15-3415-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation