大规模自动机网络中可达性的割集下近似
Under-approximating Cut Sets for Reachability in Large Scale Automata Networks
AI总结:
提出一种基于局部因果图(Graph of Local Causality)的算法,用于识别组件局部状态集合(割集),这些集合的禁用会阻止给定局部状态的可达性,并在包含9000多个组件的布尔模型中验证了其可扩展性。
摘要:
在交互组件的离散有限状态模型范围内,我们提出了一种新算法,用于识别组件的局部状态集合,这些组件的活动对于给定局部状态的可达性是必要的。如果模型中的所有局部状态都被禁用,则相关的可达性是不可能的。这些集合被称为割集,并通过一种特定的抽象因果结构(即局部因果图)计算得到,该结构受先前工作启发并在此推广到有限自动机网络。提取的局部状态集合构成了动态的完全最小割集的下近似:对于给定的可达性,可能存在更小或额外的割集。应用于生物系统的定性模型时,此类割集提供了潜在的治疗靶点,这些靶点被证明可以阻止感兴趣的分子变得活跃,前提是模型正确。我们的新方法使得对超大规模网络的形式化分析变得可行,正如在包含9000多个组件的生物通路相互作用的布尔模型中计算割集所展示的那样。
英文摘要:
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous work and generalised here to finite automata networks. The extracted sets of local states form an under-approximation of the complete minimal cut sets of the dynamics: there may exist smaller or additional cut sets for the given reachability. Applied to qualitative models of biological systems, such cut sets provide potential therapeutic targets that are proven to prevent molecules of interest to become active, up to the correctness of the model. Our new method makes tractable the formal analysis of very large scale networks, as illustrated by the computation of cut sets within a Boolean model of biological pathways interactions gathering more than 9000 components.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。