We show that difficulties in regulating cellular behavior with synthetic biological circuits may be circumvented using in silico feedback control. By tracking a circuit's output in Saccharomyces cerevisiae in real time, we precisely control its behavior using an in silico feedback algorithm to compute regulatory inputs implemented through a genetically encoded light-responsive module. Moving control functions outside the cell should enable more sophisticated manipulation of cellular processes whenever real-time measurements of cellular variables are possible.

No abstract

No abstract

No abstract

Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking. In this paper, we consider PCTL for noncountable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of Dynamic Programming. We prove some basic properties of the solutions to the latter. We also provide two examples and demonstrate how recovery strategies in practical applications, which are naturally stated as reach-avoid problems, can be viewed as particular cases of PCTL formulas

In stochastic models of chemically reacting systems that contain bimolecular reactions, the dynamics of the moments of order up to n of the species populations do not form a closed system, in the sense that their time-derivatives depend on moments of order n + 1. To close the dynamics, the moments of order n + 1 are generally approximated by nonlinear functions of the lower order moments. If the molecule counts of some of the species have a high probability of becoming zero, such approximations may lead to imprecise results and stochastic simulation is the only viable alternative for system analysis. Stochastic simulation can produce exact realizations of chemically reacting systems, but tends to become computationally expensive, especially for stiff systems that involve reactions at different time scales. Further, in some systems, important stochastic events can be very rare and many simulations are necessary to obtain accurate estimates. The computational cost of stochastic simulation can then be prohibitively large. In this paper, we propose a novel method for estimating the moments of chemically reacting systems. The method is based on closing the moment dynamics by replacing the moments of order n + 1 by estimates calculated from a small number of stochastic simulation runs. The resulting stochastic system is then used in an extended Kalman filter, where estimates of the moments of order up to n, obtained from the same simulation, serve as outputs of the system. While the initial motivation for the method was improving over the performance of stochastic simulation and moment closure methods, we also demonstrate that it can be used in an experimental setting to estimate moments of species that cannot be measured directly from time course measurements of the moments of other species.

Abstract-In this paper, an algorithm is introduced based on classical wavelet multiresolution analysis that returns a low complexity explicit model predictive control law built on a hierarchy of second order interpolating wavelets. It is proven that the resulting interpolation is everywhere feasible. Further, tests to confirm stability and to compute a bound on the performance loss are introduced. Since the controller approximation is built on a gridded hierarchy, the evaluation of the control law in real-time systems is naturally fast and runs in a bounded logarithmic time. A simple example is provided which both illustrates the approach and motivates further research in this direction.

Abstract-A model predictive control law is given by the solution to a parametric optimization problem that can be precomputed offline and provides an explicit map from state to control input. In this paper, an algorithm is introduced based on wavelet multiresolution analysis that returns a low complexity explicit model predictive control law built on a hierarchy of second order interpolets. The resulting interpolation is shown to be everywhere feasible and continuous. Further, tests to confirm stability and to compute a bound on the performance loss are introduced. Since the controller approximation is built on a grid hierarchy, convergence to a stabilizing control law is guaranteed and the evaluation of the control law in real-time systems is naturally fast and runs in a bounded logarithmic time. Two examples are provided; A two-dimensional example with an evaluation speed of 31 ns and a four-dimensional example with an evaluation speed of 119 ns.