arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.06157cs.DMcs.LO
收藏

离散调控网络的参数空间抽象与展开语义

Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks

Juraj Kolčák, David Šafránek, Stefan Haar, Loïc Paulevé

摘要:

离散调节网络的建模结合了指定系统变量之间的成对影响的图,以及可以导出离散过渡系统的参数化。仅考虑影响图,由于参数化和可达状态空间的组合爆炸,对可允许的参数化和它们所能实现的行为的探索在计算上要求很高。本文介绍了一个抽象的参数化空间及其细化帐户的存在,给定的过渡,并为约束的影响的符号和可观测性。抽象使用一个凸子格包含具体的参数化空间指定的下确界和上确界参数化。它表明,计算的抽象是最佳的,即,不存在更小的凸子格。虽然抽象可能会引入过度近似,但它已被证明是保守的状态可达性。然后,参数调控网络的展开语义的定义,利用转换之间的并发性,提供一个紧凑的表示可达的过渡。提供了一个原型实现:它已被应用到几个例子的布尔和多值网络,显示其易处理的网络与众多组件。

英文摘要:

The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. This article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions, and for constraints on the sign and observability of influences. The abstraction uses a convex sublattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations. It is shown that the computed abstractions are optimal, i.e., no smaller convex sublattice exists. Although the abstraction may introduce over-approximation, it has been proven to be conservative with respect to reachability of states. Then, an unfolding semantics for Parametric Regulatory Networks is defined, taking advantage of concurrency between transitions to provide a compact representation of reachable transitions. A prototype implementation is provided: it has been applied to several examples of Boolean and multi-valued networks, showing its tractability for networks with numerous components.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑