Natural Computing

, 8:797 | Cite as

Efficient simulation of tissue-like P systems by transition cell-like P systems

  • Daniel Díaz-Pernil
  • Mario J. Pérez-Jiménez
  • Álvaro Romero-Jiménez


In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.


P systems Tissue P systems Recognizer P systems Symport/antiport rules Efficient simulation of cellular systems 



The authors acknowledge the support of the project TIN2006-13425 of the Ministerio de Educación y Ciencia of Spain, cofinanced by FEDER funds, and the support of the project of excellence TIC-581 of the Junta de Andalucía.


  1. Díaz-Pernil D (2008) Sistemas celulares de tejidos: Formalización y eficiencia computacional. PhD Thesis, University of SevillaGoogle Scholar
  2. Gutiérrez-Naranjo MA, Pérez-Jiménez MJ, Riscos-Núnez A, Romero-Campero FJ, Romero-Jiménez A (2006) Characterizing tractability by cell-like membrane systems. In: Subramanian KG, Rangarajan K, Mukund M (eds) Formal models, languages and applications. World scientific, series in machine perception and artificial intelligence, vol 66, chapter 9, pp 137–154Google Scholar
  3. Martín-Vide C, Pazos J, Păun Gh, Rodríguez Patón A (2003) Tissue P systems. Theor Comput Sci 296:295–326MATHCrossRefGoogle Scholar
  4. Păun Gh (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143MATHCrossRefGoogle Scholar
  5. Păun Gh (2002) Membrane computing. An introduction. Springer-Verlag, BerlinMATHGoogle Scholar
  6. Păun A, Păun Gh (2002) The power of communication: P systems with symport/antiport. New Generat Comput 20(3):295–305MATHCrossRefGoogle Scholar
  7. Păun Gh, Pérez-Jiménez MJ (2003) Recent computing models inspired from biology: DNA and membrane computing. Theoria 18(46):72–84Google Scholar
  8. Păun Gh, Pérez-Jiménez MJ, Riscos-Núnez A (2004) Tissue P systems with cell division. In: Păun Gh, Riscos-Núnez A, Romero-Jiménez A, Sancho-Caparrini F (eds) Second brainstorming week on membrane computing, Sevilla, Report RGNC 01/2004, pp 380–386Google Scholar
  9. Pérez-Jiménez MJ, Romero-Jiménez A, Sancho-Caparrini F (2003) Complexity classes in cellular computing with membranes. Nat Comput 2(3):265–285MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  • Daniel Díaz-Pernil
    • 1
  • Mario J. Pérez-Jiménez
    • 1
  • Álvaro Romero-Jiménez
    • 1
  1. 1.Department of Computer Science and Artificial Intelligence, Research Group on Natural ComputingUniversity of SevillaSevillaSpain

Personalised recommendations