Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems

  • Matthew R. Lakin
  • Andrew Phillips
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6937)

Abstract

We demonstrate how the DSD programming language can be used to design a DNA stack machine and to analyse its behaviour. Stack machines are of interest because they can efficiently simulate a Turing machine. We extend the semantics of the DSD language to support operations on DNA polymers and use our stack machine design to implement a non-trivial example: a ripple carry adder which can sum two binary numbers of arbitrary size. We use model checking to verify that the ripple carry adder executes correctly on a range of inputs. This provides the first opportunity to assess the correctness and kinetic properties of DNA strand displacement systems performing Turing-powerful symbolic computation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Matthew R. Lakin
    • 1
  • Andrew Phillips
    • 1
  1. 1.Microsoft ResearchCambridgeUK

Personalised recommendations