An architecture for investigating the dynamical behaviour of biological systems is proposed by using the concepts of "behaviour" and "observer". The behaviour of a biological system is the sequence of states traversed as time passes; the observer is a device translating this behaviour into a readable output. As an instance of this architecture we investigate P/O systems constituted by a membrane system and a multiset finite automaton observer. We first characterize the infinite behaviours of conservative systems, i.e., systems whose number of objects is constant. These systems behave very regularly. For more sophisticated systems we then use also more complicated multiset automata as observers: they map the configurations into an output alphabet and thus we obtain words describing the entire computations. Even for seemingly simple membrane systems using only non-cooperative rules and regular-like observers through this combination a great power emerges, in our case computational universality. © Springer-Verlag Berlin Heidelberg 2004.
Evolution and observation: A new way to look at membrane systems / Cavaliere, M.; Leupold, P.. - 2933:(2004), pp. 70-87. (Intervento presentato al convegno Workshop on Membrane Computing tenutosi a Spain nel 2003) [10.1007/978-3-540-24619-0_6].
Evolution and observation: A new way to look at membrane systems
Cavaliere M.;
2004
Abstract
An architecture for investigating the dynamical behaviour of biological systems is proposed by using the concepts of "behaviour" and "observer". The behaviour of a biological system is the sequence of states traversed as time passes; the observer is a device translating this behaviour into a readable output. As an instance of this architecture we investigate P/O systems constituted by a membrane system and a multiset finite automaton observer. We first characterize the infinite behaviours of conservative systems, i.e., systems whose number of objects is constant. These systems behave very regularly. For more sophisticated systems we then use also more complicated multiset automata as observers: they map the configurations into an output alphabet and thus we obtain words describing the entire computations. Even for seemingly simple membrane systems using only non-cooperative rules and regular-like observers through this combination a great power emerges, in our case computational universality. © Springer-Verlag Berlin Heidelberg 2004.Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris