Skip to main content

Functional Analysis of Large-Scale DNA Strand Displacement Circuits

  • Conference paper
DNA Computing and Molecular Programming (DNA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8141))

Included in the following conference series:

Abstract

We present a method for the analysis of functional properties of large-scale DNA strand displacement (DSD) circuits based on Satisfiability Modulo Theories that enables us to prove the functional correctness of DNA circuit designs for arbitrary inputs, and provides significantly improved scalability and expressivity over existing methods. We implement this method as an extension to the Visual DSD tool, and use it to formalize the behavior of a 4-bit square root circuit, together with the components used for its construction. We show that our method successfully verifies that certain designs function as required and identifies erroneous computations in others, even when millions of copies of a circuit are interacting with each other in parallel. Our method is also applicable in the verification of properties for more general chemical reaction networks.

The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-01928-4_15

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Chandran, H., Gopalkrishnan, N., Phillips, A., Reif, J.: Localized hybridization circuits. In: Cardelli, L., Shih, W. (eds.) DNA 17. LNCS, vol. 6937, pp. 64–83. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic Function Computation with Chemical Reaction Networks. In: Stefanovic, D., Turberfield, A. (eds.) DNA 18. LNCS, vol. 7433, pp. 25–42. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Condon, A., Kirkpatrick, B., Maňuch, J.: Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems. In: Stefanovic, D., Turberfield, A. (eds.) DNA 2012. LNCS, vol. 7433, pp. 43–57. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252. ACM (1977)

    Google Scholar 

  6. de Moura, L.M., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Dong, Q.: A bisimulation approach to verification of molecular implementations of formal chemical reaction networks. Master’s thesis, Stony Brook University (2012)

    Google Scholar 

  8. Doty, D., Hajiaghayi, M.: Leaderless deterministic chemical reaction networks. arXiv:1304.4519 (2013)

    Google Scholar 

  9. Famili, I., Palsson, B.O.: The convex basis of the left null space of the stoichiometric matrix leads to the definition of metabolically meaningful pools. Biophysical Journal 85(1), 16–26 (2003)

    Article  Google Scholar 

  10. Fränzle, M., Hermanns, H., Teige, T.: Stochastic satisfiability modulo theory: A novel technique for the analysis of probabilistic hybrid systems. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 172–186. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Heiner, M., Gilbert, D., Donaldson, R.: Petri Nets for Systems and Synthetic Biology. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol. 5016, pp. 215–264. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Kaivola, R., Ghughal, R., Narasimhan, N., Telfer, A., Whittemore, J., Pandav, S., Slobodová, A., Taylor, C., Frolov, V., Reeber, E., Naik, A.: Replacing Testing with Formal Verification in Intel® CoreTM i7 Processor Execution Engine Validation. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 414–429. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Lakin, M.R., Parker, D., Cardelli, L., Kwiatkowska, M., Phillips, A.: Design and analysis of DNA strand displacement devices using probabilistic model checking. Journal of the Royal Society, Interface 9(72), 1470–1485 (2012)

    Article  Google Scholar 

  14. Lakin, M.R., Youssef, S., Polo, F., Emmott, S., Phillips, A.: Visual DSD: A design and analysis tool for DNA strand displacement systems. Bioinformatics 27(22), 3211–3213 (2011)

    Article  Google Scholar 

  15. Lakin, M.R., Phillips, A.: Modelling, simulating and verifying turing-powerful strand displacement systems. In: Cardelli, L., Shih, W. (eds.) DNA 17. LNCS, vol. 6937, pp. 130–144. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Manna, Z., Pnueli, A.: Temporal verification of reactive systems: safety, vol. 2. Springer (1995)

    Google Scholar 

  17. Qian, L., Winfree, E.: Scaling up digital circuit computation with DNA strand displacement cascades. Science 332(6034), 1196–1201 (2011)

    Article  Google Scholar 

  18. Shin, S.W.: Compiling and verifying DNA-based chemical reaction network implementations. Master’s thesis, California Institute of Technology (2012)

    Google Scholar 

  19. Thachuk, C., Condon, A.: Space and Energy Efficient Computation with DNA Strand Displacement Systems. In: Stefanovic, D., Turberfield, A. (eds.) DNA 18. LNCS, vol. 7433, pp. 135–149. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Wintersteiger, C.M., Hamadi, Y., de Moura, L.: Efficiently solving quantified bit-vector formulas. Formal Methods in System Design 42(1), 3–23 (2013)

    Article  MATH  Google Scholar 

  21. Yordanov, B., Wintersteiger, C.M., Hamadi, Y., Kugler, H.: SMT-based analysis of biological computation. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 78–92. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  22. Z34Bio at rise4fun Software Engineering Tools from Microsoft Research (2013), http://rise4fun.com/z34biology

  23. Zavattaro, G., Cardelli, L.: Termination problems in chemical kinetics. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 477–491. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Zhang, D.Y., Seelig, G.: Dynamic DNA nanotechnology using strand-displacement reactions. Nat. Chem. 3(2), 103–113 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yordanov, B., Wintersteiger, C.M., Hamadi, Y., Phillips, A., Kugler, H. (2013). Functional Analysis of Large-Scale DNA Strand Displacement Circuits. In: Soloveichik, D., Yurke, B. (eds) DNA Computing and Molecular Programming. DNA 2013. Lecture Notes in Computer Science, vol 8141. Springer, Cham. https://doi.org/10.1007/978-3-319-01928-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01928-4_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01927-7

  • Online ISBN: 978-3-319-01928-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics