Cellular Automata Application on Chemical Computing Logic Circuits

被引:2
|
作者
Tsompanas, Michail-Antisthenis [1 ]
Chatzinikolaou, Theodoros Panagiotis [2 ]
Sirakoulis, Georgios Ch [2 ]
机构
[1] Univ West England, Unconvent Comp Lab, Bristol BS16 1QY, Avon, England
[2] Democritus Univ Thrace, Dept Elect & Comp Engn, Xanthi, Greece
来源
CELLULAR AUTOMATA (ACRI 2022) | 2022年 / 13402卷
关键词
Cellular automata; Belousov-Zabotinsky reaction; Unconventional computing; Chemical computing; MODEL; PROPAGATION;
D O I
10.1007/978-3-031-14926-9_1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cellular Automata (CAs) have been proved to be a robust tool for mimicking a plethora of biological, physical and chemical systems. CAs can be used as an alternative to partial differential equations, in order to illustrate the evolution in time of the aforementioned systems. However, CAs are preferred due to their formulation simplicity and their ability to portray the emerging of complex dynamics. Their simplicity is attributed to the fact that they are composed by simple elementary components, whereas their complexity capacities are the result of emerging behaviors from the local interactions of these elementary components. Here, the utilization of CAs on mimicking of physio-chemical reactions is presented. In specific, the implementation of chemical-based logic circuits with the use of the Belousov-Zhabotinsky (BZ) class reactions was illustrated. The BZ reaction can demonstrate non-linear oscillations that have been utilized in different scenarios as a computational substrate, whereas its photo-sensitivity have been exploited as an additional factor of manipulating the computations. A common method to mathematically represent the BZ dynamics is the Oregonator equations, which are a set of PDEs. In this work the approximation of the Oregonator equations is performed with CAs to simulate logic circuits (from classic logic gates like AND to combinatorial ones). The proposed tool has been proved to be in agreement with results produced in the lab from the actual chemical reactions. Moreover, the tool is used to design novel computing architectures in a trivial manner, without the need of specialized knowledge on chemistry, without the need to handle dangerous chemicals and alleviating unnecessary costs for equipment and consumables. The main advantage of this method can be summarized as the acceleration achieved in current implementations (serial computers), but also towards potential future implementations in massively parallel computational systems (like Field-Programmable Gate Array hardware and mainly nano-neuromorphic circuits) that have been proved to be good substrates for accelerating the implemented CA models.
引用
收藏
页码:3 / 14
页数:12
相关论文
共 50 条
  • [41] Some applications of propositional logic to cellular automata
    Cavagnetto, Stefano
    MATHEMATICAL LOGIC QUARTERLY, 2009, 55 (06) : 605 - 616
  • [42] Realizability of Parity Logic in Finite Cellular Automata
    Lawrence, Celestine P.
    COMPLEX SYSTEMS, 2024, 33 (01): : 125 - 132
  • [43] Application of cellular automata for cryptography
    Bouvry, P
    Seredynski, F
    Zomaya, AY
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 447 - 454
  • [44] Algorithms for computing preimages of cellular automata configurations
    Jeras, Iztok
    Dobnikar, Andrej
    PHYSICA D-NONLINEAR PHENOMENA, 2007, 233 (02) : 95 - 111
  • [45] Computing the periods of preimages in surjective cellular automata
    Luca Mariot
    Alberto Leporati
    Alberto Dennunzio
    Enrico Formenti
    Natural Computing, 2017, 16 : 367 - 381
  • [46] Computing by Temporal Order: Asynchronous Cellular Automata
    Vielhaber, Michael
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (90): : 166 - 176
  • [47] Computing with cellular automata: Three cases for nonuniformity
    Sipper, M
    PHYSICAL REVIEW E, 1998, 57 (03): : 3589 - 3592
  • [48] On computing the Lyapunov exponents of reversible cellular automata
    Johan Kopra
    Natural Computing, 2021, 20 : 273 - 286
  • [49] Collision-Based Computing with Cellular Automata
    Martinez, Genaro J.
    CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2020, 2020, 12286 : XIII - XV
  • [50] On computing the Lyapunov exponents of reversible cellular automata
    Kopra, Johan
    NATURAL COMPUTING, 2021, 20 (02) : 273 - 286