Model checking optimal finite-horizon control for probabilistic gene regulatory networks
Ou Wei1, Zonghao Guo2, Yun Niu2
1Department of Computer Science, Nanjing University of Aeronautics and Astronautics, Nanjing, China. owei@nuaa.edu.cn.
Background:
Probabilistic Boolean networks (PBNs) have been proposed for analyzing external control in gene regulatory networks with incorporation of uncertainty. A context-sensitive PBN with perturbation (CS-PBNp), extending a PBN with context-sensitivity to reflect the inherent biological stability and random perturbations to express the impact of external stimuli, is considered to be more suitable for modeling small biological systems intervened by conditions from the outside. In this paper, we apply probabilistic model checking, a formal verification technique, to optimal control for a CS-PBNp that minimizes the expected cost over a finite control horizon.
Results:
We first describe a procedure of modeling a CS-PBNp using the language provided by a widely used probabilistic model checker PRISM. We then analyze the reward-based temporal properties and the computation in probabilistic model checking; based on the analysis, we provide a method to formulate the optimal control problem as minimum reachability reward properties. Furthermore, we incorporate control and state cost information into the PRISM code of a CS-PBNp such that automated model checking a minimum reachability reward property on the code gives the solution to the optimal control problem. We conduct experiments on two examples, an apoptosis network and a WNT5A network. Preliminary experiment results show the feasibility and effectiveness of our approach.
Conclusions:
The approach based on probabilistic model checking for optimal control avoids explicit computation of large-size state transition relations associated with PBNs. It enables a natural depiction of the dynamics of gene regulatory networks, and provides a canonical form to formulate optimal control problems using temporal properties that can be automated solved by leveraging the analysis power of underlying model checking engines. This work will be helpful for further utilization of the advances in formal verification techniques in system biology.
Related Concept Videos
Cis-regulatory Sequences
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Drug Control Governance: Regulatory Bodies and Their Impact
Schwarzschild Radius and Event Horizon
The minimum speed required to launch a projectile from the surface of an object to which it is gravitationally bound so that it eventually escapes the object’s gravitational field is called the escape velocity. The escape velocity is independent of the mass of the object. Merging the idea of escape...
Impact of Pharmacokinetic–Pharmacodynamic Models: Regulatory Decisions
Protein Folding Quality Check in the RER


