论文标题
优化布尔自动机网络中的吸引子计算
Optimising attractor computation in Boolean automata networks
论文作者
论文摘要
本文详细介绍了一种优化布尔自动机网络大小的方法，以便在并行更新时间表下计算其吸引子。这种方法依赖于最近引入的模块的形式主义，该模块允许（DE）组成此类网络。我们通过探索示例来讨论这种方法的实用性。我们还提出了结果，可以确定过程的大部分部分的复杂性，而问题的一部分的复杂性则被打开。
This paper details a method for optimising the size of Boolean automata networks in order to compute their attractors under the parallel update schedule. This method relies on the formalism of modules introduced recently that allows for (de)composing such networks. We discuss the practicality of this method by exploring examples. We also propose results that nail the complexity of most parts of the process, while the complexity of one part of the problem is left open.
