Modular verification of chemical reaction network encodings via serializability analysis

DOI10.1016/j.tcs.2015.06.033zbMath1339.92105DBLPjournals/tcs/LakinSP16OpenAlexW2251260883WikidataQ37015209 ScholiaQ37015209MaRDI QIDQ288812

Darko Stefanovic, Andrew Phillips, Matthew R. Lakin

Publication date: 27 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.033

zbMATH Keywords

chemical reaction networksserializabilityDNA strand displacementmodular verification

Mathematics Subject Classification ID

Classical flows, reactions, etc. in chemistry (92E20)

Related Items (6)

Verifying chemical reaction network implementations: a bisimulation approach ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Verifying polymer reaction networks using bisimulation ⋮ Verifying Chemical Reaction Network Implementations: A Bisimulation Approach ⋮ Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model

Uses Software

• PRISM
• PoplMark
• Visual DSD

Cites Work

• A simple population protocol for fast robust approximate majority
• Computation with finite stochastic chemical reaction networks
• Probabilistic model checking of complex biological pathways
• Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
• Efficient Turing-Universal Computation with DNA Polymers
• Localized Hybridization Circuits
• Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
• The serializability of concurrent database updates
• Two-domain DNA strand displacement
• DNA Walker Circuits: Computational Potential, Design, and Verification
• Modular Verification of DNA Strand Displacement Networks via Serializability Analysis
• Functional Analysis of Large-Scale DNA Strand Displacement Circuits
• Deterministic Function Computation with Chemical Reaction Networks
• Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
• Theorem Proving in Higher Order Logics
• Unnamed Item

This page was built for publication: Modular verification of chemical reaction network encodings via serializability analysis