Energy–Controlled P Systems

  • Rudolf Freund
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)


As already considered in [13], we investigate P systems where each evolution rule “produces” or “consumes” some quantity of energy, in amounts which are expressed as integer numbers. Yet in contrast to P systems with energy accounting as considered in [13], for energy-controlled P systems we demand that in each evolution step and in each membrane the total energy consumed by the application of a multiset of evolution rules has to be the maximum possible within a specific non-negative range. Only equipped with this control feature, energy-controlled P systems are very powerful. In the case of multisets of symbol objects we find that energy-controlled P systems with even only one membrane and an energy range of {0, 1} for the total energy involved in an evolution step characterize the recursively enumerable sets of vectors of natural numbers (without using catalysts or priorities or membrane dissolving features). In the case of string objects similar results can be obtained. Energy-controlled P systems with even only one membrane and the minimal energy range of {0} for the total energy involved in an evolution step at least generate any set of vectors of natural numbers that can be generated by matrix grammars without appearance checking.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Calude, C. S., Păun, Gh.: Computing with Cells and Atoms (Chapter 3: “Computing with Membranes”). Taylor & Francis, London (2001)Google Scholar
  2. 2.
    Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)Google Scholar
  3. 3.
    Dassow, J., Păun, Gh.: On the Power of Membrane Computing. Journal of Universal Computer Science 5, 2 (1999) 33–49 ( Scholar
  4. 4.
    Freund, R., Freund, F.: Molecular computing with generalized homogeneous P systems. In: Condon, A., Rozenberg, G. (eds.): Proc. Conf. DNA6, Leiden (2000) 113–125Google Scholar
  5. 5.
    Freund, R., Păun, Gh.: On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.): Proc. Conf. Universal Machines and Computations, Chişinău (2001). Springer-Verlag, Berlin (2001)Google Scholar
  6. 6.
    Hauschild, D., Jantzen, M.: Petri nets algorithms in the theory of matrix grammars. Acta Informatica 31 (1994) 719–728MathSciNetCrossRefGoogle Scholar
  7. 8.
    Păun, Gh.: Computing with Membranes. Journal of Computer and System Sciences 61, 1 (2000) 108–143 and TUCS Research Report 208 (1998) ( Scholar
  8. 9.
    Păun, Gh.: Computing with Membranes: An Introduction. Bulletin EATCS 67 (1999) 139–152MATHGoogle Scholar
  9. 10.
    Păun, Gh.: Membrane Computing: An Introduction. Springer-Verlag, Berlin (2002)MATHCrossRefGoogle Scholar
  10. 11.
    Păun, Gh.: Computing with membranes (P systems): Twenty six research topics. Auckland University, CDMTCS Report 119 (2000) (
  11. 12.
    Păun, Gh., Rozenberg, G., Salomaa, A.: Membrane computing with external output. Fundamenta Informaticae 41, 3 (2000) 259–266, and TUCS Research Report 218 (1998) ( Scholar
  12. 13.
    Păun, Gh., Suzuki, Y., Tanaka, H.: P Systems with energy accounting. Int. J. Computer Math. 78, 3 (2001) 343–364MATHCrossRefGoogle Scholar
  13. 14.
    Salomaa, A., Rozenberg, G. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rudolf Freund
    • 1
  1. 1.Department of Computer ScienceTechnische Universität WienWienAustria

Personalised recommendations