Modular Verification of DNA Strand Displacement Networks via Serializability Analysis
From MaRDI portal
Publication:5168504
DOI10.1007/978-3-319-01928-4_10zbMath1409.68107OpenAlexW146945102MaRDI QIDQ5168504
Darko Stefanovic, Matthew R. Lakin, Andrew Phillips
Publication date: 7 July 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-01928-4_10
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40)
Related Items (4)
Modular verification of chemical reaction network encodings via serializability analysis ⋮ Leakless DNA Strand Displacement Systems ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Emulating cellular automata in chemical reaction-diffusion networks
Uses Software
Cites Work
- A simple population protocol for fast robust approximate majority
- Strand algebras for DNA computing
- Computation with finite stochastic chemical reaction networks
- The serializability of concurrent database updates
- Two-domain DNA strand displacement
- Deterministic Function Computation with Chemical Reaction Networks
- Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
This page was built for publication: Modular Verification of DNA Strand Displacement Networks via Serializability Analysis
