Genetic Systems without Inhibition Rules
- 193 Downloads
Genetic Systems are a formalism inspired by genetic regulatory networks, suitable for modeling the interactions between genes and proteins, acting as regulatory products. The evolution is driven by genetic gates: a new object (representing a protein) is produced when all activator objects are available in the system, and no inhibitor object is present. Activators are not consumed by the application of such a rule. Objects disappear because of degradation: each object is equipped with a lifetime, and the object decays when such a lifetime expires.
It is known that such systems are Turing powerful, either when we consider interleaving semantics (a single action is executed in each computational step) as well as if we consider maximal parallel semantics (all the rules that can be applied at a computational step must be applied). In this paper we investigate the power of inhibiting rules.
KeywordsGenetic System Computational Step Program Counter Genetic Regulatory Network Applicable Rule
Unable to display preview. Download preview PDF.
- 2.Busi, N., Pinna, G.M.: A Causal Semantics for Contextual P/T nets. In: Proc. ICTCS 1995, pp. 311–325. World Scientific, Singapore (1995)Google Scholar
- 5.Busi, N., Zandron, C.: Computational expressiveness of Genetic Systems (submitted)Google Scholar
- 8.Cardelli, L.: Brane Calculi. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–278. Springer, Heidelberg (2005)Google Scholar
- 11.Freund, R.: Asynchronous P Systems and P Systems Working in the Sequential Mode. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 36–62. Springer, Heidelberg (2005)Google Scholar