International Conference on Membrane Computing

Membrane Computing pp 200-214 | Cite as

On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems

  • Nestine Hope S. Hernandez
  • Richelle Ann B. Juayong
  • Sherlyne L. Francia
  • Denise Alyssa A. Francisco
  • Henry N. Adorna
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9504)


In this paper, the communication complexity of non-confluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in Evolution-Communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by previous literature in our analysis. Solutions are constructed in several modes of operation: when communication is prioritized over evolution (CPE), when evolution is prioritized over communication (EPC) and when no priority is imposed (CME). VCP and 3SP are problems that have already been problems of interest for works that investigate communication complexity in an ECP system variant called Evolution-Communication P system with Energy (ECPe system). In this paper, we are interested in employing the technique used in ECPe system, this time for solutions in ECP system.


Membrane computing Evolution-communication P systems Communication complexity Vertex cover problem 3-satisfiability problem 



N. Hernandez and R. Juayong would like to thank the DOST PCIEERD for the HRIDD HRDP grants I-15-1006-19 and I-15-0715-21, respectively. N. Hernandez is supported by the UPAA San Francisco & Mely & Rick Ray foundation professorial chair. R. Juayong is supported by the DOST-ERDT Scholarship Program. H. Adorna is funded by a DOST-ERDT research grant and the Semirara Mining Corporation professorial chair of the UP Diliman, College of Engineering.


  1. 1.
    Adorna, H., Păun, G., Pérez-Jiménez, M.J.: On communication complexity in evolution-communication P systems. Rom. J. Inf. Sci. Technol. 13(2), 113–130 (2010)Google Scholar
  2. 2.
    Alhazov, A.: Communication in Membrane Systems with Symbol Objects. Ph.D. thesis, Universitat Rovira I Virgili (2006)Google Scholar
  3. 3.
    Cavaliere, M.: Evolution–communication P systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 134–145. Springer, Heidelberg (2003) CrossRefGoogle Scholar
  4. 4.
    Ciobanu, G., Păun, G., Stefanescu, G.: Sevilla carpets associated with P systems. In: Proceedings of the Brainstorming Week on Membrane Computing, Tarragona, Spain, pp. 135–140 (2003)Google Scholar
  5. 5.
    Francia, S., Francisco, D., Juayong, R., Adorna, H.: On communication complexity of some hard problems in ECPe systems with priority. Philippine Comput. J. 9(2), 14–25 (2014)Google Scholar
  6. 6.
    Gazdag, Z.: Solving SAT by P systems with active membranes in linear time in the number of variables. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 189–205. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  7. 7.
    Gutiérrez-Naranjo, M.A., Pérez-Jímenez, M.J., Riscos-Núñez, A.: On descriptive complexity of 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. 320–330. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  8. 8.
    Hernandez, N.H.S., Juayong, R.A.B., Adorna, H.N.: On communication complexity of some hard problems in ECPe systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 206–224. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  9. 9.
    Juayong, R., Adorna, H.: Communication complexity of evolution-communication P systems with energy and Sevilla carpet. Philippine Comput. J. 6(1), 34–40 (2010)Google Scholar
  10. 10.
    Lu, C., Zhang, X.: Solving vertex cover problem by means of tissue P systems with cell separation. Int. J. Comput. Commun. Control 5(4), 540–550 (2010)Google Scholar
  11. 11.
    Pan, L., Alhazov, A.: Solving HPP and SAT by P systems with active membranes and separation rules. Acta Informatica 43(2), 131–145 (2006)MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Păun, G.: Membrane Computing. Springer-Verlag, Heidelberg (2002) MATHCrossRefGoogle Scholar
  13. 13.
    Păun, G.: Further open problems in membrane computing. In: Păun, G. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Sevilla, February 2004, Technical report, Research Group on Natural Computing, Sevilla University, Spain (2004)Google Scholar
  14. 14.
    Păun, G.: Introduction to membrane computing. In: Ciobanu, G., P ăun, G., Pérez-Jiménez, M.J. (eds.) Applications of Membrane Computing, pp. 1–42. Springer, Heidelberg (2006) Google Scholar
  15. 15.
    Pérez–Jiménez, M.J.: A computational complexity theory in membrane computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 125–148. Springer, Heidelberg (2010) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Nestine Hope S. Hernandez
    • 1
  • Richelle Ann B. Juayong
    • 1
  • Sherlyne L. Francia
    • 1
  • Denise Alyssa A. Francisco
    • 1
  • Henry N. Adorna
    • 1
  1. 1.Algorithms and Complexity Laboratory, Department of Computer ScienceUniversity of the Philippines DilimanQuezon CityPhilippines

Personalised recommendations