Modular verification of chemical reaction network encodings via serializability analysis.
Chemical reaction networks are a powerful means of specifying the intended behaviour of synthetic biochemical systems. A high-level formal specification, expressed as a chemical reaction network, may be compiled into a lower-level encoding, which can be directly implemented in wet chemistry and may itself be expressed as a chemical reaction network. Here we present conditions under which a lower-level encoding correctly emulates the sequential dynamics of a high-level chemical reaction network. We require that encodings are transactional, such that their execution is divided by a "commit reaction" that irreversibly separates the reactant-consuming phase of the encoding from the product-generating phase. We also impose restrictions on the sharing of species between reaction encodings, based on a notion of "extra tolerance", which defines species that may be shared between encodings without enabling unwanted reactions. Our notion of correctness is serializability of interleaved reaction encodings, and if all reaction encodings satisfy our correctness properties then we can infer that the global dynamics of the system are correct. This allows us to infer correctness ofanysystem constructed using verified encodings. As an example, we show how this approach may be used to verify two- and four-domain DNA strand displacement encodings of chemical reaction networks, and we generalize our result to the limit where the populations of helper species are unlimited.
Department of Computer Science, University of New Mexico, Albuquerque, NM, USA.
Matthew R
MR
Lakin
Department of Computer Science, University of New Mexico, Albuquerque, NM, USA; Center for Biomedical Engineering, University of New Mexico, Albuquerque, NM, USA.
Darko
D
Stefanovic
Microsoft Research, Cambridge, UK.
Andrew
A
Phillips
Chemical reaction networks; DNA strand displacement; Modular verification; Serializability