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

面向目标的自动机网络约简

Goal-Oriented Reduction of Automata Networks

Loïc Paulevé

摘要:

我们考虑网络的有限状态机具有本地的过渡条件的当前状态的其他自动机。在本文中,我们描述了一个针对给定的可达性性质量身定制的归约过程,其形式为“从全局状态s存在一系列转换,导致自动机g处于局部状态T”的状态。通过利用因果关系分析的个别自动机内的过渡,建议减少删除本地的过渡,同时保留所有的最小的痕迹,满足可达性。该过程的复杂性是多项式的本地状态和转换的总数,和指数的本地状态的数量在一个自动机。应用于自动机网络建模动态的生物系统,我们观察到,减少显着缩小了可达的状态空间,提高了大型网络的模型检查的易处理性。

英文摘要:

We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is polynomial in the total number of local states and transitions, and exponential in the number of local states within one automaton. Applied to automata networks modelling dynamics of biological systems, we observe that the reduction shrinks down significantly the reachable state space, enhancing the tractability of the model-checking of large networks.

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

↑