Synchronizing Boolean networks asynchronously

被引:1
|
作者
Aracena, Julio [1 ,2 ]
Richard, Adrien [3 ,4 ]
Salinas, Lilian [2 ,5 ]
机构
[1] Univ Concepcion, CI2MA, Concepcion, Chile
[2] Univ Concepcion, CI2MA, Concepcion, Chile
[3] Univ Cote dAzur, CNRS, I3S, Sophia Antipolis, France
[4] Univ Chile, CMM, Santiago, Chile
[5] Univ Concepcion, Dept Comp Sci, Concepcion, Chile
关键词
Boolean network; Synchronizing automaton; Positive and negative cycles; Asynchronous dynamics; Interaction graph; FIXED-POINTS; REGULATORY NETWORKS; COMPUTATION; MULTISTATIONARITY; AUTOMATA; MEMORY; SETS;
D O I
10.1016/j.jcss.2023.04.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The asynchronous automatonof a Boolean network f:{0, 1}(n) -> {0, 1}(n), considered in many applications, is the finite deterministic automaton where the set of states is {0, 1}(n), the alphabet is [n], and the action of letter ion a state xconsists in either switching the ith component if f(i)(x) not equal x(i) or doing nothing otherwise. In this paper, we ask for the existence of synchronizing words for this automaton, and their minimal length, when f is the and net over an arc-signed digraph G on [n]: for every i is an element of[n], f(i)(x) = 1 if and only if x(j)= 1( xj not equal 0) for every positive (negative) arc from j to i. Our main result is that if G is strongly connected and has no positive cycles, then either there exists a synchronizing word of length at most 10(root 5+ 1)(n) or G is a cycle and there are no synchronizing words. We also give complexity results showing that the situation is much more complexif one of the two hypothesis made on G is removed. (c) 2023 Elsevier Inc. All rights reserved.
引用
收藏
页码:249 / 279
页数:31
相关论文
共 50 条
  • [11] Towards Intelligent Biological Control: Controlling Boolean Networks with Boolean Networks
    Taou, Nadia S.
    Corne, David W.
    Lones, Michael A.
    APPLICATIONS OF EVOLUTIONARY COMPUTATION, EVOAPPLICATIONS 2016, PT I, 2016, 9597 : 351 - 362
  • [12] Asynchronously enhanced spiking activity of ischemic neuronal networks
    Ujita, Sakiko
    Mizunuma, Mika
    Matsuki, Norio
    Ikegaya, Yuji
    JOURNAL OF PHARMACOLOGICAL SCIENCES, 2011, 115 : 140P - 140P
  • [13] Identification of edge removal fault in Boolean networks and disjunctive Boolean networks
    Li, Wenrong
    Li, Haitao
    Yang, Xinrong
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2024, 361 (06):
  • [14] From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
    Shmulevich, I
    Dougherty, ER
    Mang, W
    PROCEEDINGS OF THE IEEE, 2002, 90 (11) : 1778 - 1792
  • [15] Synchronizing Edits in Distributed Storage Networks
    El Rouayheb, Salim
    Goparaju, Sreechakra
    Kiah, Han Mao
    Milenkovic, Olgica
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1472 - 1476
  • [16] SYNCHRONIZING HYPERCUBE NETWORKS IN THE PRESENCE OF FAULTS
    HARRINGTON, M
    SOMANI, AK
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (10) : 1175 - 1183
  • [17] Asynchronously Enhanced Spiking Activity of Ischemic Neuronal Networks
    Ujita, Sakiko
    Mizunuma, Mika
    Matsuki, Norio
    Ikegaya, Yuji
    BIOLOGICAL & PHARMACEUTICAL BULLETIN, 2011, 34 (05) : 764 - 767
  • [18] SYNCHRONIZING ASYNCHRONOUS BOUNDED DELAY NETWORKS
    CHOU, CT
    CIDON, I
    GOPAL, IS
    ZAKS, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 312 : 212 - 218
  • [19] Synchronizing seismic networks with ambient noise
    Sens-Schoenfelder, Christoph
    GEOPHYSICAL JOURNAL INTERNATIONAL, 2008, 174 (03) : 966 - 970
  • [20] SYNCHRONIZING ASYNCHRONOUS BOUNDED DELAY NETWORKS
    CHOU, CT
    CIDON, I
    GOPAL, IS
    ZAKS, S
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (02) : 144 - 147