Show simple item record

dc.contributor.authorDini, Paolo
dc.contributor.authorNehaniv, C.L.
dc.contributor.authorEgri-Nagy, Attila
dc.contributor.authorSchilstra, M.
dc.date.accessioned2013-09-24T12:45:09Z
dc.date.available2013-09-24T12:45:09Z
dc.date.issued2013-05
dc.identifier.citationDini , P , Nehaniv , C L , Egri-Nagy , A & Schilstra , M 2013 , ' Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction ' , Biosystems , vol. 112 , no. 2 , pp. 145-162 . https://doi.org/10.1016/j.biosystems.2013.03.003
dc.identifier.issn0303-2647
dc.identifier.otherPURE: 2140315
dc.identifier.otherPURE UUID: 3469eb4f-52f8-4f1e-af3b-75c580a4f547
dc.identifier.otherWOS: 000320355000012
dc.identifier.otherScopus: 84877924104
dc.identifier.urihttp://hdl.handle.net/2299/11634
dc.description.abstractInteraction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn. (C) 2013 Elsevier Ireland Ltd. All rights reserved.en
dc.format.extent18
dc.language.isoeng
dc.relation.ispartofBiosystems
dc.subjectInteraction
dc.subjectDiscrete dynamical systems
dc.subjectNon-linear dynamics
dc.subjectAlgebraic automata theory
dc.subjectAlgebraic invariance
dc.subjectSystems biology
dc.subjectOpen non-equilibrium systems
dc.subjectFunctional completeness
dc.subjectCOUPLED CHEMICAL-REACTIONS
dc.subjectP53-MDM2 FEEDBACK LOOP
dc.subjectSTOCHASTIC SIMULATION
dc.subjectSYSTEMS
dc.subjectOSCILLATIONS
dc.subjectEVOLUTION
dc.subjectCOMPUTATION
dc.subjectSEMIGROUPS
dc.subjectCOMPLEXITY
dc.subjectMACHINES
dc.titleExploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reactionen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.contributor.institutionAdaptive Systems
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Computer Science
dcterms.dateAccepted2013-05
rioxxterms.versionofrecordhttps://doi.org/10.1016/j.biosystems.2013.03.003
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record