Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems

DOI10.1007/978-3-642-23638-9_12zbMath1347.68139OpenAlexW2135010822MaRDI QIDQ3092338

Andrew Phillips, Matthew R. Lakin

Publication date: 16 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23638-9_12

Mathematics Subject Classification ID

Related Items (9)

Modular verification of chemical reaction network encodings via serializability analysis ⋮ A strand graph semantics for DNA-based computation ⋮ Performance limits and trade-offs in entropy-driven biochemical computers ⋮ An RNA-based theory of natural universal computation ⋮ Stochastic simulation of multiple process calculi for biology ⋮ Formal semantics and verification of network-based biocomputation circuits ⋮ Functional Analysis of Large-Scale DNA Strand Displacement Circuits ⋮ Verifying polymer reaction networks using bisimulation ⋮ Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model

Uses Software

• PRISM

Cites Work

• Computation with finite stochastic chemical reaction networks
• Efficient Turing-Universal Computation with DNA Polymers
• Turing universality of the Biochemical Ground Form
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems