论文标题
耦合多值逻辑网络的近似同步
Approximate synchronization of coupled multi-valued logical networks
论文作者
论文摘要
本文介绍了两个耦合的多价逻辑网络的近似同步。根据两个系统启动的初始状态集，首次提出了两种类型的近似同步问题，局部近似同步和全局近似同步。三个新概念：介绍和分析近似同步状态集（ASS），最大近似同步盆地（MASB）和最短的近似同步时间（SAST）。基于屁股，获得了几种必要和足够的条件以进行近似同步。 MASB是所有可能的初始状态的集合，系统近似同步，并研究了最大不变子集的结合。并提出了与瞬时相关的SAST的计算方法。根据MASB，研究了固定控制方案，以使两个耦合系统实现全球近似同步。此外，相关理论还应用于$ k $值（$ k \ geq2 $）逻辑网络的完整同步问题。最后，给出了四个示例以说明获得的结果。
This article deals with the approximate synchronization of two coupled multi-valued logical networks. According to the initial state set from which both systems start, two kinds of approximate synchronization problem, local approximate synchronization and global approximate synchronization, are proposed for the first time. Three new notions: approximate synchronization state set (ASSS), the maximum approximate synchronization basin (MASB) and the shortest approximate synchronization time (SAST) are introduced and analyzed. Based on ASSS, several necessary and sufficient conditions are obtained for approximate synchronization. MASB, the set of all possible initial states, from which the systems are approximately synchronous, is investigated combining with the maximum invariant subset. And the calculation method of the SAST, associated with transient period, is presented. By virtue of MASB, pinning control scheme is investigated to make two coupled systems achieve global approximate synchronization. Furthermore, the related theories are also applied to the complete synchronization problem of $k$-valued ($k\geq2$) logical networks. Finally, four examples are given to illustrate the obtained results.
