...
首页> 外文期刊>Mathematical structures in computer science >Static analysis of Biological Regulatory Networks dynamics using abstract interpretation
【24h】

Static analysis of Biological Regulatory Networks dynamics using abstract interpretation

机译:使用抽象解释对生物调控网络动力学进行静态分析

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The analysis of the dynamics of Biological Regulatory Networks (BRNs) requires innovative methods to cope with the state-space explosion. This paper settles an original approach for deciding reachability properties based on Process Hitting, which is a framework suitable for modelling dynamical complex systems. In particular, Process Hitting has been shown to be of interest in providing compact models of the dynamics of BRNs with discrete values. Process Hitting splits a finite number of processes into so-called sorts and describes the way each process is able to act upon (that is, to 'hit') another one (or itself) in order to 'bounce' it as another process of the same sort with further actions. By using complementary abstract interpretations of the succession of actions in Process Hitting, we build a very efficient static analysis to over- and under-approximate reachability properties, which avoids the need to build the underlying states graph. The analysis is proved to have a low theoretical complexity, in particular when the number of processes per sorts is limited, while a very large number of sorts can be managed. This makes such an approach very promising for the scalable analysis of abstract complex systems. We illustrate this through the analysis of a large BRN of 94 components. Our method replies quasi-instantaneously to reachability questions, while standard model-checking techniques regularly fail because of the combinatoric explosion of behaviours.
机译:对生物调节网络(BRN)动力学的分析需要创新的方法来应对状态空间爆炸。本文提出了一种基于过程命中来确定可达性的原始方法,该方法是适用于对动态复杂系统进行建模的框架。特别是,在提供具有离散值的BRN动力学的紧凑模型方面,过程击中已显示出其重要性。流程击中将有限数量的流程分为所谓的类别,并描述了每个流程能够对另一流程(或自身)采取行动(即“命中”)另一个流程(以“反弹”)为另一个流程的方式。同样,还有其他动作。通过使用对流程击中中的动作连续性的补充抽象解释,我们建立了一个非常有效的静态分析,以评估过高和过低的可达性,从而避免了构建基础状态图的需要。事实证明,该分析的理论复杂度较低,尤其是当每种类别的处理数量受到限制时,可以管理非常多种类别。这使得这种方法对于抽象复杂系统的可伸缩分析非常有前途。我们通过分析94个组件的大型BRN来说明这一点。我们的方法几乎即时地回答了可达性问题,而标准的模型检查技术通常由于行为的组合爆炸而经常失败。

著录项

  • 来源
    《Mathematical structures in computer science》 |2012年第4期|651-685|共35页
  • 作者单位

    LUNAM University, Ecole Centrale de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernetique de Nantes), 1 rue de la Noee - B.P. 92101 - 44321 Nantes Cedex 3, France and LIX, Ecole Poly'technique, 91128 Palaiseau Cedex, France;

    LUNAM Universite, Ecole Centrale de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernetique de Nantes), 1 rue de la Noe - B.P. 92101 - 44321 Nantes Cedex 3, France;

    LUNAM Universite, Ecole Centrale de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernetique de Nantes), 1 rue de la Noe - B.P. 92101 - 44321 Nantes Cedex 3, France;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号