A Cellular Automaton Approach for Efficient Computing on Surface Chemical Reaction Networks

被引:2
|
作者
Yu, Sihai [1 ]
Xu, Wenli [1 ]
Lee, Jia [1 ]
Isokawa, Teijiro [2 ]
机构
[1] Chongqing Univ, Coll Comp Sci, 174 Shazhengjie, Chongqing 400044, Shapingba, Peoples R China
[2] Univ Hyogo, Grad Sch Engn, 2167 Shosha, Himeji, Hyogo 6712280, Japan
基金
日本学术振兴会;
关键词
Molecular programming; Surface CRN; Cellular automata; Universal computation; Asynchronous circuit; DELAY-INSENSITIVE CIRCUITS; COMPUTATION; COMPLEXITY; LIMITS;
D O I
10.1007/s00354-024-00262-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A surface chemical reaction network (sCRN, Qian and Winfree in DNA Computing and Molecular Programming: 20th International Conference, DNA 20, Kyoto, Japan, September 22-26, 2014. Proceedings 20. Springer, 2014) is an emergent paradigm for molecular programming, in which a chemical molecule is placed at each site of a lattice, and each molecule may undergo either bi-molecular reactions associated with one of the nearest molecules or uni-molecular reactions autonomously. The lattice structure as well as the localized reactions between molecules facilitate an effective formalization of sCRNs in the framework of cellular automata. This formalism not only allows a systematic evaluation of the complexity of a sCRN, but also enables a formal approach to reduce the model's complexity for the sake of improving its effectiveness. To this end, this paper proposes a new sCRN model that has less complexity measured in terms of the numbers of both cell states and transition rules. Especially, universality of computations will be shown by implementing all asynchronous circuits, including the well-known full-adder, into the sCRN. The decreased complexity may enhance the feasibility of the proposed sCRN model for physical implementation.
引用
收藏
页码:217 / 235
页数:19
相关论文
共 50 条
  • [21] Reaction-diffusion path planning in a hybrid chemical and cellular-automaton processor
    Adamatzky, A
    Costello, BD
    CHAOS SOLITONS & FRACTALS, 2003, 16 (05) : 727 - 736
  • [22] A Network Emergent Computing Model Based on Cellular Automaton
    Tang, Hong
    Wang, Ying
    Wang, Haitao
    Wu, Yu
    2009 6TH IFIP INTERNATIONAL CONFERENCE ON NETWORK AND PARALLEL COMPUTING, 2009, : 240 - 245
  • [23] CELLULAR AUTOMATON APPROACH TO POLYMER SIMULATIONS
    BARYAM, Y
    RABIN, Y
    SMITH, MA
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1992, 203 : 144 - POLY
  • [24] Energy Efficient Mobile Edge Computing in Dense Cellular Networks
    Chen, Lixing
    Zhou, Sheng
    Xu, Jie
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [25] Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
    Errami, Hassan
    Seiler, Werner M.
    Eiswirth, Markus
    Weber, Andreas
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2012, 2012, 7442 : 84 - 97
  • [26] A Cellular Automaton Model for Wireless Sensor Networks
    Choudhury, Salimur
    Salomaa, Kai
    Akl, Selim G.
    JOURNAL OF CELLULAR AUTOMATA, 2012, 7 (03) : 223 - 241
  • [27] Emulating cellular automata in chemical reaction–diffusion networks
    Dominic Scalise
    Rebecca Schulman
    Natural Computing, 2016, 15 : 197 - 214
  • [28] CELLULAR-AUTOMATON FOR SURFACE-REACTIONS
    PECHATNIKOV, EL
    FRANKOWICZ, M
    DANIELAK, R
    ACTA PHYSICA POLONICA B, 1994, 25 (06): : 993 - 1004
  • [29] A general cellular automaton model for surface reactions
    Kortluke, O
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1998, 31 (46): : 9185 - 9197
  • [30] Conservative Computing in a One-dimensional Cellular Automaton with Memory
    Martinez, Genaro J.
    Morita, Kenichi
    JOURNAL OF CELLULAR AUTOMATA, 2018, 13 (04) : 325 - 346