Show simple item record

dc.contributor.authorEgri-Nagy, A.
dc.contributor.authorNehaniv, C.L.
dc.date.accessioned2012-12-17T14:59:36Z
dc.date.available2012-12-17T14:59:36Z
dc.date.issued2008
dc.identifier.citationEgri-Nagy , A & Nehaniv , C L 2008 , ' Algebraic properties of automata associated to Petri nets and applications to computation in biological systems ' , Biosystems , vol. 94 , no. 1-2 , pp. 135-144 . https://doi.org/10.1016/j.biosystems.2008.05.019
dc.identifier.issn0303-2647
dc.identifier.otherPURE: 88906
dc.identifier.otherPURE UUID: b0028767-971e-4231-8610-d69c3a4ba0e1
dc.identifier.otherdspace: 2299/3293
dc.identifier.otherScopus: 53749094275
dc.identifier.urihttp://hdl.handle.net/2299/9424
dc.descriptionOriginal article can be found at: http://www.sciencedirect.com/science/journal/03032647 Copyright Elsevier Ireland Ltd. DOI: 10.1016/j.biosystems.2008.05.019
dc.description.abstractBiochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modelling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore there are several different ways to turn a Petri net into a state-transition automaton. Here we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures.We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.en
dc.language.isoeng
dc.relation.ispartofBiosystems
dc.titleAlgebraic properties of automata associated to Petri nets and applications to computation in biological systemsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.description.statusPeer reviewed
rioxxterms.versionofrecordhttps://doi.org/10.1016/j.biosystems.2008.05.019
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record