Computing with Genetic Gates, Proteins, and Membranes

  • Nadia Busi
  • Claudio Zandron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4361)


We introduce Genetic P systems, a class of P systems with evolution rules inspired by the functioning of the genes.

The creation of new objects – representing proteins – is driven by genetic gates: a new object is produced when all the activator objects are present, and no inhibitor object is available. Activator objects are not consumed by the application of such an evolution rule. Objects disappear because of degradation: each object is equipped with a lifetime; when such a lifetime expires, the object decays.

Then, we extend the basic model with bind and release rules and repressor rules, that simulate the action of protein channels and the action of substances which connect to other objects to block their use. We provide a universality result for such a class of systems.


Reaction Relation Evolution Rule Program Counter External Membrane Membrane Computing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256, 63–92 (2001)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)MATHGoogle Scholar
  3. 3.
    Păun, G.: Computing with membranes: an introduction. Bull. EATCS 67 (1999)Google Scholar
  4. 4.
    Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)MATHGoogle Scholar
  6. 6.
    Păun, G.: 2006 research topics in membrane computing. In: Proc. Fourth Brainstorming Week on Membrane Computing, Felix Editora, Sevilla (2006)Google Scholar
  7. 7.
    Alhazov, A., Freund, R., Rogozhin, Y.: Computational power of symport/Antiport: History, advances, and open problems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 1–30. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nadia Busi
    • 1
  • Claudio Zandron
    • 2
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di BolognaBolognaItaly
  2. 2.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità di Milano-BicoccaMilanoItaly

Personalised recommendations