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

离散动力系统方程求解(扩展版)

Solving Equations on Discrete Dynamical Systems (Extended version)

Alberto Dennunzio, Enrico Formenti, Luciano Margara, Valentin Montmirail, Sara Riva

摘要:

布尔自动机网络、遗传调节网络和代谢网络只是离散动力系统(DDS)生物建模的几个例子。建模中的一个主要问题是根据实验数据验证模型或在数据不确定的情况下导出模型。有限离散动力系统具有交换半环的代数结构,为DDS动力学的假设验证提供了一个合适的背景。实际上,对系统的假设可以通过DDS转化为多项式方程。这些方程的解验证了初始假设。不幸的是,在DDS上找到一般方程的解是不可判定的。在这篇文章中,我们想进一步推动信封,提出了一个实用的方法,在一个合适的配置,我们称之为假设检查一些可判定的情况。我们证明,许多可判定的方程都归结为一个“简单”的方程。然而,问题不是判定简单方程是否有解,而是枚举所有解,以验证关于真实不可判定系统的假设。我们实验评估我们的方法,并表明它具有良好的可扩展性。

英文摘要:

Boolean automata networks, genetic regulation networks, and metabolic networks are just a few examples of biological modelling by discrete dynamical systems (DDS). A major issue in modelling is the verification of the model against the experimental data or inducing the model under uncertainties in the data. Equipping finite discrete dynamical systems with an algebraic structure of commutative semiring provides a suitable context for hypothesis verification on the dynamics of DDS. Indeed, hypothesis on the systems can be translated into polynomial equations over DDS. Solutions to these equations provide the validation to the initial hypothesis. Unfortunately, finding solutions to general equations over DDS is undecidable. In this article, we want to push the envelope further by proposing a practical approach for some decidable cases in a suitable configuration that we call the Hypothesis Checking. We demonstrate that for many decidable equations all boils down to a "simpler" equation. However, the problem is not to decide if the simple equation has a solution, but to enumerate all the solutions in order to verify the hypothesis on the real and undecidable systems. We evaluate experimentally our approach and show that it has good scalability properties.

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

↑