A Computational Model Based on Random Boolean Networks

被引:0
|
作者
Dubrova, Elena [1 ]
Teslenko, Maxim [1 ]
Tenhunen, Hannu [1 ]
机构
[1] Royal Inst Technol, S-16446 Kista, Sweden
关键词
Random Boolean Network; attractor; Boolean function; fault-tolerance; carbon nanotubes;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For decades, the size of silicon CMOS transistors has decreased steadily while their performance has improved. As the devices approach their physical limits, the need for alternative materials, structures and computation schemes becomes evident. This paper considers a computation scheme based on an abstract model of gene regulatory networks called Random Boolean Networks. Our interest in Random Boolean Networks is due to their attractive fault-tolerant features. The parameters of a network can be tuned so that it exhibits a robust behavior in which minimal changes in network's connections, values of state variables, or associated functions, typically cause no variation in the network's dynamics. A computation scheme based on random networks also seems to be appealing for emerging technologies in which it is difficult to control the growth direction or precise alignment, e.g. carbon nanotubes.
引用
收藏
页码:23 / 30
页数:8
相关论文
共 50 条
  • [41] Attractors and Basins of Asynchronous Random Boolean Networks
    Yang Meng
    Chu Tianguang
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 6392 - 6397
  • [42] Properties of attractors of canalyzing random Boolean networks
    Paul, U
    Kaufman, V
    Drossel, B
    PHYSICAL REVIEW E, 2006, 73 (02):
  • [43] Searching for rhythms in asynchronous random Boolean networks
    Di Paolo, EA
    ARTIFICIAL LIFE VII, 2000, : 73 - 80
  • [44] Perturbation propagation in random and evolved Boolean networks
    Fretter, Christoph
    Szejka, Agnes
    Drossel, Barbara
    NEW JOURNAL OF PHYSICS, 2009, 11
  • [45] Scaling in ordered and critical random Boolean networks
    Socolar, JES
    Kauffman, SA
    PHYSICAL REVIEW LETTERS, 2003, 90 (06)
  • [46] Analysis of attractor distances in Random Boolean Networks
    Roli, Andrea
    Benedettini, Stefano
    Serra, Roberto
    Villani, Marco
    NEURAL NETS WIRN10, 2011, 226 : 201 - 208
  • [47] RANDOM BOOLEAN NETWORKS: ANALOGY WITH PERCOLATION.
    Stauffer, D.
    Philosophical Magazine B: Physics of Condensed Matter; Electronic, Optical and Magnetic Properties, 1987, 56 (06): : 901 - 916
  • [48] Finite size corrections to random Boolean networks
    Leone, Michele
    Pagnani, Andrea
    Parisi, Giorgio
    Zagordi, Osvaldo
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2006,
  • [49] An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks
    Giang Van Trinh
    Akutsu, Tatsuya
    Hiraishi, Kunihiko
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2022, 19 (02) : 806 - 818
  • [50] On a model-based design verification for combinatorial boolean networks
    Hiratsuka, S
    Fusaoka, A
    DEVELOPMENTS IN APPLIED ARTIFICAIL INTELLIGENCE, PROCEEDINGS, 2002, 2358 : 758 - 767