Skip to main content
Log in

Solving a PSPACE-complete problem with cP systems

  • Regular Paper
  • Published:
Journal of Membrane Computing Aims and scope Submit manuscript

Abstract

There have been a few NP-hard problems solved using cP systems including the travelling salesman problem. However, these problems are typically in NP rather than higher in the polynomial time hierarchy. In this paper, we solve QSAT (also known as TQBF), which is a well-known PSPACE-complete problem. Compared to other extant confluent P systems solutions, our deterministic cP solution only uses a small constant number of custom alphabet symbols (19), a small constant number of rules (10) and a small constant upper limit of membrane nesting depth (6), independent of the problem size.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  3. Ionescu, M., Păun, G.,& Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae 71(2):279–308.

  4. Martín-Vide, C., Păun, G., Pazos, J., & Rodríguez-Patón, A. (2003). Tissue P systems. Theoretical Computer Science,296(2), 295–326.

    Article  MathSciNet  Google Scholar 

  5. Cooper, J., & Nicolescu, R. (2019). The Hamiltonian cycle and travelling salesman problems in cP systems. Fundamenta Informaticae,164(2–3), 157–180.

    Article  MathSciNet  Google Scholar 

  6. Henderson, A.,& Nicolescu, R. (2019). “Actor-like cP Systems,” in Membrane Computing, vol. 11399 of Lecture Notes in Computer Science, pp. 160–187, Springer.

  7. Liu, Y., Nicolescu, R., & Sun, J. (2020). Formal verification of cP systems using PAT3 and ProB. Journal of Membrane Computing,2(2), 80–94.

    Article  MathSciNet  Google Scholar 

  8. Leporati, A., Manzoni, L., Mauri, G., Porreca, A., & Zandron, C. (2019). Characterizing PSPACE with shallow non-confluent P systems. Journal of Membrane Computing,1(2), 75–84.

    Article  MathSciNet  Google Scholar 

  9. Ishdorj, T.-O., Leporati, A., Pan, L., Zeng, X., & Zhang, X. (2010). Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Theoretical Computer Science,411(25), 2345–2358.

    Article  MathSciNet  Google Scholar 

  10. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E.,& Zandron, C. (2019). “Solving QSAT in sublinear depth,” in International Conference on Membrane Computing (T. Hinze, G. Rozenberg, A. Salomaa, and C. Zandron, eds.), vol. 11399 of Lecture Notes in Computer Science, pp. 188–201, Springer.

  11. Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Romero-Campero, F. J. (2006). “A Linear Solution for QSAT with Membrane Creation,” in Membrane Computing (R. Freund, G. Păun, G. Rozenberg, and A. Salomaa, eds.), vol. 3850 of Lecture Notes in Computer Science, pp. 241–252, Springer.

  12. Alhazov, A., & Pérez-Jiménez, M. J. (2007). “Uniform solution of QSAT using polarizationless active membranes,” in International Conference on Machines, Computations, and Universality (J. Durand-Lose and M. Margenstern, eds.), vol. 4664 of Lecture Notes in Computer Science, pp. 122–133, Springer.

  13. Nicolescu, R.,& Henderson, A. (2018) “An introduction to cP Systems,” in Enjoying Natural Computing: Essays Dedicated to Mario de Jesús Pérez-Jiménez on the Occasion of His 70th Birthday (C. Graciani, A. Riscos-Núñez, G. Păun, G. Rozenberg, and A. Salomaa, eds.), vol. 11270 of Lecture Notes in Computer Science, pp. 204–227, Springer.

  14. Sipser, M. (2012). Introduction to the Theory of Computation. Boston: Cengage Learning.

    MATH  Google Scholar 

  15. Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981). Alternation. Journal of ACM, 28, 114–133.

    Article  MathSciNet  Google Scholar 

  16. Nicolescu, R. (2014). “Parallel thinning with complex objects and actors,” in International Conference on Membrane Computing (M. Gheorghe, G. Rozenberg, A. Salomaa, P. Sosík, and C. Zandron, eds.), vol. 8961 of Lecture Notes in Computer Science, pp. 330–354, Springer.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alec Henderson.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Henderson, A., Nicolescu, R. & Dinneen, M.J. Solving a PSPACE-complete problem with cP systems. J Membr Comput 2, 311–322 (2020). https://doi.org/10.1007/s41965-020-00064-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41965-020-00064-w

Keywords

Navigation