Skip to main content
SpringerLink
Log in
Book cover

International Conference on Membrane Computing

CMC 2013: Membrane Computing pp 19–32Cite as

Computational Complexity of P Systems with Active Membranes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8340))

Abstract

P systems with active membranes constitute a very interesting model of computation, defined in the framework of Membrane Computing. Since their appeareance, they have been used to solve computationally difficult problems (usually in the classes NP and PSPACE), due to their ability to generate an exponential size workspace in a polynomial number of time steps. Several computational complexity techniques have thus been applied to study their computing power and efficiency. In this extended abstract I will briefly survey some of these techniques and the main results which have been obtained in the last few years by the group of Membrane Computing at the University of Milano-Bicocca (also known as the “Milano Team”), sometimes in collaboration with collegues from the international Membrane Computing community.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A., Martín-Vide, C., Pan, L.: Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae 58(2), 67–77 (2003)

    MathSciNet  Google Scholar 

  2. Alhazov, A., Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: The computational power of exponential-space P systems with active membranes. In: Martínez-del-Amor, M.A., et al. (eds.) Proceedings of the Tenth Brainstorming Week on Membrane Computing, January 30-February 3, vol. I, pp. 35–60. Research Group on Natural Computing, Seville (2012)

    Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman & Co. (1979)

    Google Scholar 

  4. Leporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M.J., Zandron, C.: Complexity aspects of polarizationless membrane systems. Natural Computing 8, 703–717 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Mauri, G., Leporati, A., Porreca, A.E., Zandron, C.: Recent complexity-theoretic results on P systems with active membranes. Journal of Logic and Computation, online first (2013), doi:10.1093/logcom/exs077

    Google Scholar 

  6. Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within NC1. Journal of Computer and System Sciences 41(3), 274–306 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Murphy, N., Woods, D.: The computational power of membrane systems under tight uniformity conditions. Natural Computing 10(1), 613–632 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  8. Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1993)

    Google Scholar 

  9. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 1(61), 108–143 (2000)

    Google Scholar 

  10. Păun, G.: P systems with active membranes: attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    Google Scholar 

  11. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford handbook of membrane computing. Oxford University Press (2010)

    Google Scholar 

  12. Pérez-Jiménez, M.J., Romero Jiménez, A., Sancho Caparrini, F.: Complexity classes in models of cellular computing with membranes. Natural Computing 2(3), 265–285 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Porreca, A.E., Leporati, A., Zandron, C.: On a powerful class of non-universal P systems with active membranes. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 364–375. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Introducing a space complexity measure for P systems. International Journal of Computers, Communications & Control 4(3), 301–310 (2009)

    Google Scholar 

  15. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with active membranes: trading time for space. Natural Computing 10(1), 167–182 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with elementary active membranes: Beyond NP and coNP. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 338–347. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Elementary active membranes have the power of counting. International Journal of Natural Computing Research 2(3), 35–48 (2011)

    Article  Google Scholar 

  18. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with active membranes working in polynomial space. International Journal of Foundations of Computer Science 2(1), 65–73 (2011)

    Article  MathSciNet  Google Scholar 

  19. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems simulating oracle computations. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol. 7184, pp. 346–358. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Sublinear-space P systems with active membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) CMC 2012. LNCS, vol. 7762, pp. 342–357. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  21. Ruzzo, W.L.: On uniform circuit complexity. Journal of Computer and System Sciences 22(3), 365–383 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sipser, M.: Introduction to the theory of computation, 3rd edn. Cengage Learning (2012)

    Google Scholar 

  23. Sosík, P.: The computational power of cell division in P systems: beating down parallel computers? Natural Computing 2(3), 287–298 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sosík, P., Rodríguez-Patón, A.: Membrane computing and complexity theory: a characterization of PSPACE. Journal of Computer and System Sciences 73(1), 137–152 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  25. Stockmeyer, L.J.: The polynomial hierarchy. Theoretical Computer Science 3, 1–22 (1976)

    Article  MathSciNet  Google Scholar 

  26. Toda, S.: PP is as hard as the polynomial–time hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  27. Valsecchi, A., Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: An efficient simulation of polynomial-space Turing machines by P systems with active membranes. 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. 461–478. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  28. Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., et al. (eds.) Unconventional Models of Computation, UMC2K: Proceedings of the Second International Conference. Discrete Mathematics and Theoretical Computer Science, pp. 289–301. Springer (2001)

    Google Scholar 

  29. Zandron, C., Leporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M.J.: On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution. Fundamenta Informaticae 87(1), 79–91 (2008)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336/14, 20126, Milano, Italy

    Alberto Leporati

Authors
  1. Alberto Leporati
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei Str, MD 2028, Chişinău, Republic of Moldova

    Artiom Alhazov  & Yurii Rogozhin  & 

  2. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei Str., MD 2028, Chişinău, Republic of Moldova

    Svetlana Cojocaru

  3. Department of Computer Science, University of Sheffield, 211 Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA, Leiden, The Netherlands

    Grzegorz Rozenberg

  5. Turku Centre for Computer Science (TUCS), Leminkaisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leporati, A. (2014). Computational Complexity of P Systems with Active Membranes. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. CMC 2013. Lecture Notes in Computer Science, vol 8340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54239-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54239-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54238-1

  • Online ISBN: 978-3-642-54239-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation