Modeling Dynamical Parallelism in Bio-systems

  • Erzsébet Csuhaj-Varjú
  • Rudolf Freund
  • Dragoş Sburlan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4361)


Among the many events that occur in the life of biological organisms there are multitudes of specific chemical transformations that provide the cell with usable energy and molecules needed to form its structure and coordinate its activities. These biochemical reactions, as well as all other cellular processes, are governed by basic principles of chemistry and physics. A significant factor that determines whether or not reactions could take place is the entropy (it measures the randomness of the system). This measure depends on various factors. In an abstract framework, all these factors, which describe the way molecules interact, can be expressed by means of a computable multi-valued function that, depending on the current state of the system, establishes the possible ways of the evolution of the system. Inspired by these facts, we introduce and study several bio-mimetic computational rewriting systems that use discrete components (i.e., finite alphabets, finite set(s) of rewriting rules, etc.) and perform their computational steps in a non-deterministic manner and in a degree of rewriting parallelism that depends on the current state of the system, both specified by a given multi-valued function. Furthermore, we describe systems which produce the same output independently of the values taken by the considered functions.


Parallel Manner Output Region Strong Mode Weak Mode Distinct Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane Systems with Promoters/Inhibitors. Acta Informatica 38(10), 695–720 (2002)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Cavaliere, M., Sburlan, D.: Time–Independent P Systems. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 239–258. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Ionescu, M., Sburlan, D.: On P Systems with Promoters/Inhibitors. International Journal of Universal Computer Science 10(5), 581–599 (2004)MathSciNetGoogle Scholar
  4. 4.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar
  5. 5.
    Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)MATHGoogle Scholar
  6. 6.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)MATHGoogle Scholar
  7. 7.
    Sburlan, D.: Promoting and Inhibiting Contexts in Membrane Systems, doctoral Thesis, University of Seville, Spain (2006)Google Scholar
  8. 8.
    Sburlan, D.: Further Results on P Systems with Promoters/Inhibitors. International Journal of Foundations of Computer Science 17(1), 205–222 (2006)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
  • Rudolf Freund
    • 2
  • Dragoş Sburlan
    • 3
    • 4
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  2. 2.Faculty of InformaticsVienna University of TechnologyViennaAustria
  3. 3.Department of Computer Science and Artificial IntelligenceUniversity of SevilleSevilleSpain
  4. 4.Faculty of Mathematics and InformaticsOvidius University of ConstantzaConstantzaRomania

Personalised recommendations