Cellular automata application on chemical computing logic circuits

Tsompanas, Michail-Antisthenis; Chatzinikolaou, Theodoros Panagiotis; Sirakoulis, Georgios Ch

Abstract

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.

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022
• Start Date: Sep 12, 2022
• End Date: Sep 15, 2022
• Acceptance Date: May 31, 2022
• Online Publication Date: Aug 13, 2022
• Publication Date: 2022
• Deposit Date: Feb 9, 2023
• Publicly Available Date: Aug 14, 2024
• Publisher: Springer Verlag (Germany)
• Pages: 3-14
• Series Title: Part of the Lecture Notes in Computer Science book series (LNCS,volume 13402)
• Edition: Bastien Chopard, Stefania Bandini, Alberto Dennunzio, Mira Arabi Haddad
• Book Title: International Conference on Cellular Automata for Research and Industry: ACRI 2022: Cellular Automata
• ISBN: 9783031149252; 9783031149269
• DOI: https://doi.org/10.1007/978-3-031-14926-9_1
• Public URL: https://uwe-repository.worktribe.com/output/10442874
• Publisher URL: https://link.springer.com/chapter/10.1007/978-3-031-14926-9_1