Stochastic reachability analysis in complex biological networks

被引:3
|
作者
El-Samad, H. [1 ,2 ]
Fazel, M. [3 ]
Liu, X. [3 ]
Papachristodoulou, A. [4 ]
Prajna, S. [3 ]
机构
[1] Univ Calif San Francisco, Dept Biochem Biophys, San Francisco, CA 94143 USA
[2] Calif Inst Quantitat Biomed Res, Berkeley, CA USA
[3] CALTECH, Control & Dynam Syst, Pasadena, CA 91125 USA
[4] Univ Oxford, Dept Engn Sci, Oxford OX1 3PJ, England
来源
2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12 | 2006年 / 1-12卷
关键词
D O I
10.1109/ACC.2006.1657471
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The impact of noise on cellular networks and its interplay with their rich dynamics are increasingly being characterized as important phenomena that must be thoroughly investigated for a useful understanding of biological dynamics. At the same time, the mathematical modeling and analysis of these networks in a stochastic setting presents a number of challenges, such as the need for a large number of computationally expensive stochastic simulations to collect statistics about the occurrence of important events or correlate their occurrence with the noise intensity. In this paper, we demonstrate the use of new techniques of stochastic reachability analysis to address these problems. Specifically, we study the problem of computing bounds on the probability of a biological stochastic process to reach certain parts of the state space in a finite time. The techniques presented are based on the algorithmic construction of barrier certificates using convex optimization, and are illustrated through the use of a biologically important system: the bacteriophage lambda genetic
引用
收藏
页码:4748 / +
页数:2
相关论文
共 50 条
  • [21] Dealing with Stochastic Reachability
    Bujorianu, Manuela L.
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 2935 - 2940
  • [22] On formal reachability analysis in networks with dynamic behavior
    Gayan de Silva
    Ondřej Ryšavý
    Petr Matoušek
    Miroslav Švéda
    Telecommunication Systems, 2013, 52 : 919 - 929
  • [23] TReX: A tool for reachability analysis of complex systems
    Annichini, A
    Bouajjani, A
    Sighireanu, M
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2001, 2102 : 368 - 372
  • [24] Reachability Analysis of Neural Networks with Uncertain Parameters
    Meyer, Pierre-Jean
    IFAC PAPERSONLINE, 2023, 56 (02): : 4822 - 4827
  • [25] Reachability Analysis for Time Dynamic Pushdown Networks
    Qian J.-Y.
    Xu L.
    Gu T.-L.
    Zhao L.-Z.
    Cai G.-Y.
    Zhao, Ling-Zhong (zhaolingzhong163@163.com), 1600, Chinese Institute of Electronics (45): : 2241 - 2249
  • [26] Reachability analysis of complex planar hybrid systems
    Hansen, Hallstein A.
    Schneider, Gerardo
    Steffen, Martin
    SCIENCE OF COMPUTER PROGRAMMING, 2013, 78 (12) : 2511 - 2536
  • [27] Variability analysis of complex networks measures based on stochastic distances
    Cabral, Raquel S.
    Frery, Alejandro C.
    Ramirez, Jaime A.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 415 : 73 - 86
  • [28] Reachability Analysis for AWS-Based Networks
    Backes, John
    Bayless, Sam
    Cook, Byron
    Dodge, Catherine
    Gacek, Andrew
    Hu, Alan J.
    Kahsai, Temesghen
    Kocik, Bill
    Kotelnikov, Evgenii
    Kukovec, Jure
    McLaughlin, Sean
    Reed, Jason
    Rungta, Neha
    Sizemore, John
    Stalzer, Mark
    Srinivasan, Preethi
    Subotic, Pavle
    Varming, Carsten
    Whaley, Blake
    COMPUTER AIDED VERIFICATION, CAV 2019, PT II, 2019, 11562 : 231 - 241
  • [29] On the reachability analysis of acyclic networks of pushdown systems
    Atig, Mohamed Faouzi
    Bouajjani, Ahmed
    Touili, Tayssir
    CONCUR 2008 - CONCURRENCY THEORY, PROCEEDINGS, 2008, 5201 : 356 - +
  • [30] On formal reachability analysis in networks with dynamic behavior
    de Silva, Gayan
    Rysavy, Ondrej
    Matousek, Petr
    Sveda, Miroslav
    TELECOMMUNICATION SYSTEMS, 2013, 52 (02) : 919 - 929