Library Header Image
LSE Research Online LSE Library Services

Algebraic analysis of the computation in the Belousov-Zhabotinksy reaction

Dini, Paolo, Nehaniv, Chrystopher L., Egri-Nagy, Attila and Schilstra, Maria J. (2012) Algebraic analysis of the computation in the Belousov-Zhabotinksy reaction. In: Lones, Michael A., Smith, Stephen L., Teichmann, Sarah, Naef, Felix, Walker, James A. and Trefzer, Martin A., (eds.) Information Processing in Cells and Tissues: 9th International Conference, Ipcat 2012, Cambridge, Uk, March 31 – April 2, 2012:. Lecture notes in computer science (7223). Springer Berlin / Heidelberg, pp. 216-224. ISBN 9783642287916

PDF - Accepted Version
Download (926kB) | Preview
Identification Number: 10.1007/978-3-642-28792-3_27


We analyse two very simple Petri nets inspired by the Oregonator model of the Belousov-Zhabotinsky reaction using our stochastic Petri net simulator. We then perform the Krohn-Rhodes holonomy decomposition of the automata derived from the Petri nets. The simplest case shows that the automaton can be expressed as a cascade of permutation-reset cyclic groups, with only 2 out of the 12 levels having only trivial permutations. The second case leads to a 35-level decomposition with 5 different simple non-abelian groups (SNAGs), the largest of which is A 9. Although the precise computational significance of these algebraic structures is not clear, the results suggest a correspondence between simple oscillations and cyclic groups, and the presence of SNAGs indicates that even extremely simple chemical systems may contain functionally complete algebras.

Item Type: Book Section
Official URL:
Additional Information: © 2012 Springer-Verlag.
Divisions: Media and Communications
Subjects: Q Science > QA Mathematics
Date Deposited: 19 Apr 2012 07:46
Last Modified: 16 May 2024 05:30

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics