Model checking optimal finite-horizon control for probabilistic gene regulatory networks

被引:5
作者
Wei, Ou [1 ]
Guo, Zonghao [1 ]
Niu, Yun [1 ]
Liao, Wenyuan [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Dept Comp Sci, Nanjing, Jiangsu, Peoples R China
[2] Univ Calgary, Dept Math & Stat, Calgary, AB, Canada
来源
BMC SYSTEMS BIOLOGY | 2017年 / 11卷
基金
中国国家自然科学基金;
关键词
Probabilistic Boolean networks; Context-sensitive; Perturbation; Optimal control; Model checking; INTERVENTION;
D O I
10.1186/s12918-017-0481-6
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页数:14
相关论文
共 19 条
  • [1] Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
  • [2] Molecular classification of cutaneous malignant melanoma by gene expression profiling
    Bittner, M
    Meitzer, P
    Chen, Y
    Jiang, Y
    Seftor, E
    Hendrix, M
    Radmacher, M
    Simon, R
    Yakhini, Z
    Ben-Dor, A
    Sampas, N
    Dougherty, E
    Wang, E
    Marincola, F
    Gooden, C
    Lueders, J
    Glatfelter, A
    Pollock, P
    Carpten, J
    Gillanders, E
    Leja, D
    Dietrich, K
    Beaudry, C
    Berens, M
    Alberts, D
    Sondak, V
    Hayward, N
    Trent, J
    [J]. NATURE, 2000, 406 (6795) : 536 - 540
  • [3] Ceska M, P 12 INT C COMP METH
  • [4] Cong Y, BMC SYST BIOL
  • [5] External control in Markovian Genetic Regulatory Networks
    Datta, A
    Choudhary, A
    Bittner, ML
    Dougherty, ER
    [J]. MACHINE LEARNING, 2003, 52 (1-2) : 169 - 191
  • [6] Symbolic approach to verification and control of deterministic/probabilistic Boolean networks
    Kobayashi, K.
    Hiraishi, K.
    [J]. IET SYSTEMS BIOLOGY, 2012, 6 (06) : 215 - 222
  • [7] Kobayashi K., 2014, SCI WORLD J, V2014, P295
  • [8] An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
    Kobayashi, Koichi
    Hiraishi, Kunihiko
    [J]. AUTOMATICA, 2011, 47 (06) : 1260 - 1264
  • [9] Kwiatkowska Marta, 2011, Computer Aided Verification. Proceedings 23rd International Conference, CAV 2011, P585, DOI 10.1007/978-3-642-22110-1_47
  • [10] Langmead CJ, 2009, J BIOINFORMA COMPUT, V7, P307