Soft Computing

, Volume 23, Issue 12, pp 3903–3911 | Cite as

A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division

  • Suxia Jiang
  • Yanfeng Wang
  • Yansen SuEmail author


Cell-like P systems with channel states and symport/antiport rules are distributed parallel computing devices, where a state associated with each channel is used to control communication between neighboring regions. In this work, membrane division is introduced into cell-like P systems with channel states and symport/antiport rules, and we call this variant of cell-like P systems as symport/antiport P systems with channel states and membrane division. The computational efficiency of such kind of P systems is investigated. We provide a uniform solution to the SAT problem by cell-like P systems with channel states using membrane division and symport/antiport rules of length at most 2, where the P system can solve all instances of the problem with the same size.


Bio-inspired computing Membrane computing Channel state Computational efficiency SAT problem 



The work of Y. Wang and S. Jiang was supported by National Natural Science Foundation of China (61632002 and 61472372), Science and Technology Innovation Talents of Henan Province (174200510012), and the Innovation Scientists and Technicians Troop Construction Projects of Henan Province (154200510012). The work of Y. Su was supported by National Natural Science Foundation of China (61502004).

Compliance with ethical standards

Conflict of interest

The authors Suxia Jiang, Yanfeng Wang, and Yansen Su declare that they have no conflict of interest.


  1. Alhazov A, Freund R (2005) P systems with one membrane and symport/antiport rules of five symbols are computationally complete. In: Proceedings of the Third Brainstorming Week on Membrane Computing. Sevilla, pp 20–28Google Scholar
  2. Alhazov A, Rogozhin Y (2006) Towards a characterization of P systems with minimal symport/antiport and two membranes. Lect Notes Comput Sci 436(1):135–153zbMATHGoogle Scholar
  3. Bernardini F, Gheorghe M (2003) On the power of minimal symport/antiport. In: Proceedings of the 3rd Workshop on Membrane Computing. pp 72–83Google Scholar
  4. Csuhaj-Varjú E, Margenstern M, Vaszil G, Verlan S (2007) On small universal antiport P systems. Theor Comput Sci 372:152–164MathSciNetzbMATHGoogle Scholar
  5. Ciobanu G, Pan L, Păun G et al (2007) P systems with minimal parallelism. Theor Comput Sci 378(1):117–130MathSciNetzbMATHGoogle Scholar
  6. Díaz-Pernil D, Gutierrez-Naranjo MA, Pérez-Jiménez MJ et al (2009) Solving the independent set problem by using tissue-like P systems with cell division. Lect Notes Comput Sci 5601:213–222Google Scholar
  7. Frisco P, Govan G, Leporati A (2012) Asynchronous P systems with active membranes. Theor Comput Sci 429:74–86MathSciNetzbMATHGoogle Scholar
  8. Freund R, Oswald M (2003a) P systems with activated/prohibited membrane channels. Lect Notes Comput Sci 2597:261–269MathSciNetzbMATHGoogle Scholar
  9. Freund R, Păun Gh, Pérez-Jiménezc MJ (2005) Tissue P systems with channel states. Theor Comput Sci 330(1):101–116MathSciNetzbMATHGoogle Scholar
  10. Garey MR, Johnson DJ (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, New YorkzbMATHGoogle Scholar
  11. Gheorghe M, Ipate F, Lefticaru R et al (2013) 3-Col problem modelling using simple kernel P systems. International Journal of Computer Mathematics 90(4):816–830MathSciNetzbMATHGoogle Scholar
  12. Gutiérrez-Escudero R, Pérez-Jiménez MJ, Rius-Font M (2009) Characterizing tractability by tissue-like P systems. Membrane Computing, Berlin/Heidelberg. Springer, Germany, pp 289–300Google Scholar
  13. Ionescu M, Păun Gh, Yokomori T (2006) Spiking neural P systems. Fundamenta Informaticae 71(2–3):279–308MathSciNetzbMATHGoogle Scholar
  14. Leporati A, Manzoni L, Mauri G, Porreca AE, Zandron C (2016) Shallow non-confluent P systems. In: Proceedings of the 17th International Conference on Membrane Computing (CMC2016), Italy, pp 307–316Google Scholar
  15. Martin-Vide C, Pazos J, Păun Gh, Rodríguez-Patón A (2003) Tissue P systems. Theor Comput Sci 296(2):295–326MathSciNetzbMATHGoogle Scholar
  16. Macías-Ramos LF, Pérez-Jiménez MJ, Riscos-Núez A et al (2015a) Membrane fission versus cell division: When membrane proliferation is not enough. Theor Comput Sci 608(1):57–65MathSciNetzbMATHGoogle Scholar
  17. Macías-Ramos LF, Song B, Valencia-Cabrera L, Pan L, Pérez-Jiménez MJ (2015b) Membrane fission: a computational complexity perspective. Complexity 21(6):321–334MathSciNetGoogle Scholar
  18. Papadimitriou CH (1993) Computational Complexity. Addison-Wesley, BostonzbMATHGoogle Scholar
  19. Păun A (2002a) Membrane systems with symport/antiport: universality results. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, MolCoNet Publication 1:333–343Google Scholar
  20. Păun A, Păun G (2002b) The power of communication: P systems with symport/antiport. New Generation Computing 20(3):295–305zbMATHGoogle Scholar
  21. Păun A, Păun G, Rozenberg G (2002c) Computing by communication in networks of membranes. Int J Found Comput Sci 13:779–798MathSciNetzbMATHGoogle Scholar
  22. Pan L, Ishdorj TO (2004) P systems with active membranes and separation rules. Journal of Universal Computer Science 10(5):630–649MathSciNetGoogle Scholar
  23. Pan L, Pérez-Jiménez MJ (2010) Computational complexity of tissue-like P systems. Journal of Complexity 26:296–315MathSciNetzbMATHGoogle Scholar
  24. Păun G (2000a) Computing with membranes. J Comput Syst Sci 61(1):108–143. Also in Turku Center for Computer Science–TUCS, Report 208, November 1998Google Scholar
  25. Păun G (2000b) Attacking NP-complete problems. Unconventional Models of Computation, UMC2K, Springer-Verlag pp 94–115Google Scholar
  26. Păun G (2002) Membrane Computing: an Introduction. Springer Science & Business Media, BerlinzbMATHGoogle Scholar
  27. Păun G, Pérez-Jiménez MJ, Riscos-Núnez A (2008) Tissue P system with cell division. International Journal of Computers, Communications & Control 3(3):295–303Google Scholar
  28. Păun G, Rozenberg G, Salomaa A (2010) The Oxford Handbook of Membrane Computing. Oxford University Press, New YorkzbMATHGoogle Scholar
  29. Peng H, Wang J, Shi P, Riscos-Núñez A, Pérez-Jiménez MJ (2015) An automatic clustering algorithm inspired by membrane computing. Pattern Recogn Lett 68:34–40Google Scholar
  30. Pérez-Jiménez MJ, Romero-Jiménez A, Sancho-Caparrini F (2004) The P versus NP problem through cellular computing with membranes. Lect Notes Comput Sci 2950:338–352zbMATHGoogle Scholar
  31. Pérez-Jiménez MJ (2005) An approach to computational complexity in membrane computing. Lect Notes Comput Sci 3365:85–109zbMATHGoogle Scholar
  32. Pérez-Jiménez MJ, Romero-Jiménez A, Sancho-Caparrini F (2006) A polynomial complexity class in P systems using membrane division. Journal of Automata, Languages and Combinatorics 11(4):423–434MathSciNetzbMATHGoogle Scholar
  33. Rozenberg G, Salomaa A (1997) Handbook of Formal Languages, Volume 1. Word, Language, Grammar,Google Scholar
  34. Song B, Pérez-Jiménez MJ, Pan L (2015a) Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division. BioSystems 130:51–58Google Scholar
  35. Song B, Pérez-Jiménez MJ, Pan L (2016a) An efficient time-free solution to SAT problem by P systems with proteins on membranes. J Comput Syst Sci 82:1090–1099MathSciNetzbMATHGoogle Scholar
  36. Song B, Pan L, Pérez-Jiménez MJ (2016b) Cell-like P systems with channel states and symport/antiport rules. IEEE Trans Nanobiosci 15(6):555–566Google Scholar
  37. Song T, Pan L (2015b) Spiking neural P systems with rules on synapses working in maximum spiking strategy. IEEE Trans Nanobiosci 14(4):465–477Google Scholar
  38. Song T, Pan L (2016) Spiking neural P systems with request rules. Neurocomputing 193:193–200Google Scholar
  39. Song B, Song T, Pan L (2017a) A time-free uniform solution to subset sum problem by tissue P systems with cell division. Mathematical Structures in Computer Science 27(1):17–32MathSciNetzbMATHGoogle Scholar
  40. Song B, Zhang C, Pan L (2017b) Tissue-like P systems with evolutional symport/antiport rules. Inf Sci 378:177–193MathSciNetGoogle Scholar
  41. Sosík P, Ludĕk C (2014) Computational power of cell separation in tissue P systems. Inf Sci 279:805–815MathSciNetzbMATHGoogle Scholar
  42. Sosík P, Ludĕk C (2015) A limitation of cell division in tissue P systems by PSPACE. J Comput Syst Sci 81(2):473–484MathSciNetzbMATHGoogle Scholar
  43. Valencia-Cabrera L, Song B, Macías-Ramos LF, Pan L, Pérez-Jiménez MJ (2015) Computational Efficiency of P Systems with Symport/Antiport Rules and Membrane Separation. Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, Sevilla, pp 325-370Google Scholar
  44. Zandron C, Leporati A, Ferretti C et al (2008) On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution. Fundamenta Informaticae 87(1):79–91MathSciNetzbMATHGoogle Scholar
  45. Zhang G, Gheorghe M, Pan L, Pérez-Jiménez MJ (2014a) Evolutionary membrane computing: a comprehensive survey and new results. Inf Sci 279:528–551Google Scholar
  46. Zhang X, Pan L, Păun A (2015) On the universality of axon P systems. IEEE Transactions on Neural Networks and Learning Systems 26(11):2816–2829MathSciNetGoogle Scholar
  47. Zhang G, Rong H, Neri F, Pérez-Jiménez MJ (2014b) An optimization spiking neural P system for approximately solving combinatorial optimization problems. Int J Neural Syst 24(5):1–16Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Henan Key Lab of Information Based Electrical Appliances, College of Electric and Information EngineeringZhengzhou University of Light IndustryZhengzhouChina
  2. 2.Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and TechnologyAnhui UniversityHefeiChina

Personalised recommendations