Synthesizing and tuning stochastic chemical reaction networks with specified behaviours

Methods from stochastic dynamical systems theory have been instrumental in understanding the behaviours of chemical reaction networks (CRNs) arising in natural systems. However, considerably less attention has been given to the inverse problem of synthesizing CRNs with a specified behaviour, which is important for the forward engineering of biological systems. Here, we present a method for generating discrete-state stochastic CRNs from functional specifications, which combines synthesis of reactions using satisfiability modulo theories and parameter optimization using Markov chain Monte Carlo. First, we identify candidate CRNs that have the possibility to produce correct computations for a given finite set of inputs. We then optimize the parameters of each CRN, using a combination of stochastic search techniques applied to the chemical master equation, to improve the probability of correct behaviour and rule out spurious solutions. In addition, we use techniques from continuous-time Markov chain theory to analyse the expected termination time for each CRN. We illustrate our approach by synthesizing CRNs for probabilistically computing majority, maximum and division, producing both known and previously unknown networks, including a novel CRN for probabilistically computing the maximum of two species. In future, synthesis techniques such as these could be used to automate the design of engineered biological circuits and chemical systems.

[1]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[2]  Abhyudai Singh,et al.  The Linear-Noise Approximation and moment-closure approximations for stochastic chemical kinetics , 2017, 1711.07383.

[3]  W. J. Anderson Continuous-Time Markov Chains , 1991 .

[4]  Luca Cardelli,et al.  Programmable chemical controllers made from DNA. , 2013, Nature nanotechnology.

[5]  Martin Vetterli,et al.  Interval consensus: From quantized gossip to voting , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[6]  Niall Murphy,et al.  Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours , 2015, DNA.

[7]  G. Seelig,et al.  DNA as a universal substrate for chemical kinetics , 2010, Proceedings of the National Academy of Sciences.

[8]  Jehoshua Bruck,et al.  Programmability of Chemical Reaction Networks , 2009, Algorithmic Bioprocesses.

[9]  Christopher A. Voigt,et al.  Genetic circuit design automation , 2016, Science.

[10]  Hillel Kugler,et al.  A method to identify and analyze biological programs through automated reasoning , 2016, npj Systems Biology and Applications.

[11]  Moez Draief,et al.  Convergence Speed of Binary Interval Consensus , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Nicola Paoletti,et al.  Precise Parameter Synthesis for Stochastic Biochemical Systems , 2014, CMSB.

[13]  Andrew Phillips,et al.  Functional Analysis of Large-Scale DNA Strand Displacement Circuits , 2013, DNA.

[14]  Dan Alistarh,et al.  Fast and Exact Majority in Population Protocols , 2015, PODC.

[15]  François Fages,et al.  Inferring reaction systems from ordinary differential equations , 2015, Theor. Comput. Sci..

[16]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[17]  Ho-Lin Chen,et al.  Rate-independent computation in continuous chemical reaction networks , 2014, ITCS.

[18]  Peter A. J. Hilbers,et al.  Computing Algebraic Functions with Biochemical Reaction Networks , 2009, Artificial Life.

[19]  Swen Jacobs,et al.  Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems , 2016, CAV.

[20]  Joost-Pieter Katoen,et al.  Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability , 2008, 2008 Real-Time Systems Symposium.

[21]  Hillel Kugler,et al.  Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains , 2014, QEST.

[22]  Francesco Amato,et al.  On the Realization of an Embedded Subtractor Module for the Control of Chemical Reaction Networks , 2016, IEEE Transactions on Automatic Control.

[23]  Jie-Hong Roland Jiang,et al.  Compiling program control flows into biochemical reactions , 2012, 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[24]  Paul G. Spirakis,et al.  Determining majority in networks with local interactions and very small local memory , 2014, Distributed Computing.

[25]  P. Donnelly,et al.  Finite particle systems and infection models , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[27]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[28]  Ho-Lin Chen,et al.  Deterministic function computation with chemical reaction networks , 2012, Natural Computing.

[29]  Thomas Wilhelm,et al.  The smallest chemical reaction system with bistability , 2009, BMC Systems Biology.

[30]  David Eisenstat,et al.  A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.

[31]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[32]  Sumit Gulwani,et al.  Synthesis of loop-free programs , 2011, PLDI '11.

[33]  Hitoshi Iba,et al.  An Effective Method for Evolving Reaction Networks in Synthetic Biochemical Systems , 2015, IEEE Transactions on Evolutionary Computation.

[34]  Luca Cardelli,et al.  Syntax-Guided Optimal Synthesis for Chemical Reaction Networks , 2017, CAV.

[35]  Andrew Phillips,et al.  Orthogonal intercellular signaling for programmed spatial behavior , 2016, Molecular systems biology.

[36]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[37]  Luca Cardelli,et al.  Morphisms of reaction networks that couple structure to function , 2014, BMC Systems Biology.

[38]  Christopher A. Voigt,et al.  Robust multicellular computing using genetically encoded NOR gates and chemical ‘wires’ , 2011, Nature.

[39]  Sebastian Bonhoeffer,et al.  Evolution of complexity in signaling pathways , 2006, Proceedings of the National Academy of Sciences.

[40]  T. Kurtz The Relationship between Stochastic and Deterministic Models for Chemical Reactions , 1972 .

[41]  Nicola Paoletti,et al.  Analyzing and Synthesizing Genomic Logic Functions , 2014, CAV.

[42]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.

[43]  Leqi Zhu A tight space bound for consensus , 2016, STOC.

[44]  Steven P. Lalley,et al.  Continuous-Time Markov Chains , 2021, World Scientific Series on Probability Theory and Its Applications.

[45]  Hoon Kim,et al.  Monte Carlo Statistical Methods , 2000, Technometrics.

[46]  Milan Vojnovic,et al.  Using Three States for Binary Consensus on Complete Graphs , 2009, IEEE INFOCOM 2009.

[47]  Dan Alistarh,et al.  Space-Optimal Majority in Population Protocols , 2017, SODA.

[48]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[49]  D. Gillespie Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .