Cargando…

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

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 stabilit...

Descripción completa

Detalles Bibliográficos
Autores principales: Wei, Ou, Guo, Zonghao, Niu, Yun, Liao, Wenyuan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751526/
https://www.ncbi.nlm.nih.gov/pubmed/29297345
http://dx.doi.org/10.1186/s12918-017-0481-6
_version_ 1783289963915247616
author Wei, Ou
Guo, Zonghao
Niu, Yun
Liao, Wenyuan
author_facet Wei, Ou
Guo, Zonghao
Niu, Yun
Liao, Wenyuan
author_sort Wei, Ou
collection PubMed
description 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.
format Online
Article
Text
id pubmed-5751526
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-57515262018-01-05 Model checking optimal finite-horizon control for probabilistic gene regulatory networks Wei, Ou Guo, Zonghao Niu, Yun Liao, Wenyuan BMC Syst Biol Methodology 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. BioMed Central 2017-12-14 /pmc/articles/PMC5751526/ /pubmed/29297345 http://dx.doi.org/10.1186/s12918-017-0481-6 Text en © The Author(s) 2017 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Methodology
Wei, Ou
Guo, Zonghao
Niu, Yun
Liao, Wenyuan
Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title_full Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title_fullStr Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title_full_unstemmed Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title_short Model checking optimal finite-horizon control for probabilistic gene regulatory networks
title_sort model checking optimal finite-horizon control for probabilistic gene regulatory networks
topic Methodology
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751526/
https://www.ncbi.nlm.nih.gov/pubmed/29297345
http://dx.doi.org/10.1186/s12918-017-0481-6
work_keys_str_mv AT weiou modelcheckingoptimalfinitehorizoncontrolforprobabilisticgeneregulatorynetworks
AT guozonghao modelcheckingoptimalfinitehorizoncontrolforprobabilisticgeneregulatorynetworks
AT niuyun modelcheckingoptimalfinitehorizoncontrolforprobabilisticgeneregulatorynetworks
AT liaowenyuan modelcheckingoptimalfinitehorizoncontrolforprobabilisticgeneregulatorynetworks