Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusions
References
All Topics
Computer Science
Computational Theory and Mathematics

Alternative space definitions for P systems with active membranes

Profile image of Giancarlo MauriGiancarlo Mauri

Journal of Membrane Computing

https://doi.org/10.1007/S41965-021-00074-2
visibility

…

description

10 pages

link

1 file

Abstract

The first definition of space complexity for P systems was based on a hypothetical real implementation by means of biochemical materials, and thus it assumes that every single object or membrane requires some constant physical space. This is equivalent to using a unary encoding to represent multiplicities for each object and membrane. A different approach can also be considered, having in mind an implementation of P systems in silico; in this case, the multiplicity of each object in each membrane can be stored using binary numbers, thus reducing the amount of needed space. In this paper, we give a formal definition for this alternative space complexity measure, we define the corresponding complexity classes and we compare such classes both with standard space complexity classes and with complexity classes defined in the framework of P systems considering the original definition of space.

Related papers

Constant-Space P Systems with Active Membranes
Giancarlo Mauri

Fundamenta Informaticae, 2014

We continue the investigation of the computational power of spaceconstrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative definition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken into account. Finally, we prove that, when less than a logarithmic number of membrane labels is available, moving the input objects around the membrane structure without rewriting them is not enough to even distinguish inputs of the same length.

View PDFchevron_right
Encodings and arithmetic operations in P systems
Artiom Alhazov

Fourth Brainstorming Week …, 2006

Membrane systems represent a new abstract model inspired by cell compartments and molecular membranes. Essentially, such a system is composed of various com-partments, each compartment with a different task, and all of them working si-multaneously to accomplish a more ...

View PDFchevron_right
The computational power of exponential-space P systems with active membranes
Artiom Alhazov

2012

We show that exponential-space P systems with active membranes characterize the complexity class EXPSPACE. This result is proved by simulating Turing machines working in exponential space via uniform families of P systems with restricted elementary active membranes; the simulation is efficient, in the sense that the time and space required are at most polynomial with respect to the resources employed by the simulated Turing machine.

View PDFchevron_right
Computational complexity of simple P systems
Gabriel Ciobanu

We introduce a new class of membrane systems called simple P systems, and study its computational complexity using the classical theory. We start by presenting the knapsack problem and analyzing its space and time complexities. Then we study the computational complexity of simple P systems by considering the static allocation of resources enabling the parallel application of the rules. We show that the problem of allocating resources for simple P systems is NP-complete by reducing it to the knapsack problem. Thus we express the computational complexity of this class of P systems in terms of classical complexity theory.

View PDFchevron_right
Membrane computing and complexity theory: A characterization of PSPACE
Alfonso Rodríguez-Patón

Journal of Computer and System Sciences, 2007

A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that confluent P systems with active membranes solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems prove to be equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. Similar results were achieved also with other models of natural computation, such as DNA computing or genetic algorithms. Our result, together with the previous observations, suggests that the class PSPACE provides a tight upper bound on the computational potential of biological information processing models.

View PDFchevron_right
Standardized Proofs of PSPACE-completeness of P Systems with Active Membranes
Lucie Ciencialová

Two proofs have been shown for P systems with active membranes in previously published papers, demonstrating that these P systems can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are equivalent (up to a polynomial time reduction) to Second Machine Class models as the alternating Turing machine or the PRAM computer. These proofs were based on a modified definition of uniform families of P systems. Here we demonstrate that the results remain valid also in the case of standard definitions.

View PDFchevron_right
On the Number of Membranes in Unary P Systems
Rudolf Freund

Electronic Proceedings in Theoretical Computer Science

We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary language and in that way for an effective solution of the equivalence problem. Moreover, we examine the descriptional complexity of unary P systems with respect to the number of membranes.

View PDFchevron_right
P systems with active membranes: trading time for space
Antonio Porreca

Natural Computing, 2010

We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when working in polynomial space and exponential time. The solution is uniform (all the instances of a fixed size are solved by the same P system) and uses only communication rules: evolution rules, as well as membrane division and dissolution rules, are not used. Our result shows that, as it happens with Turing machines, this model of P systems can solve in exponential time and polynomial space problems that cannot be solved in polynomial time, unless P = PSPACE.

View PDFchevron_right
Computational complexity of tissue-like P systems
Linqiang Pan

Journal of Complexity, 2010

Membrane systems, also called P systems, are biologically inspired theoretical models of distributed and parallel computing. This paper presents a new class of tissue-like P systems with cell separation, a feature which allows the generation of new workspace. We study the efficiency of the class of P systems and draw a conclusion that only tractable problems can be efficiently solved by using cell separation and communication rules with the length of at most 1. We further present an efficient (uniform) solution to SAT by using cell separation and communication rules with length at most 6. We conclude that a borderline between efficiency and non-efficiency exists in terms of the length of communication rules (assuming P = NP). We discuss future research topics and open problems.

View PDFchevron_right
P Systems with Active Membranes Characterize PSPACE
Alfonso Rodríguez-Patón

Lecture Notes in Computer Science, 2006

P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are computationally equivalent (w.r.t. the polynomial time reduction) to standard parallel machine models as PRAM and the alternating Turing machine.

View PDFchevron_right

References (43)

  1. Alhazov, A., & Ishdorj, T. (2004). Membrane operations in P sys- tems with active membranes. In: Păun, Gh., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Second Brain- storming Week on Membrane Computing. pp. 37-44. No. 1/2004 in RGNC Reports, Fénix Editora.
  2. Alhazov, A., Leporati, A., Mauri, G., Porreca, A.E., & Zandron, C. (2012). The computational power of exponential-space P systems with active membranes. In: Martínez-del-Amor, M.A., Păun, Gh., Pérez-Hurtado, I., Romero-Campero, F.J. (eds.) Tenth Brainstorm- ing Week on Membrane Computing, Volume I. pp. 35-60. No.
  3. /2012 in RGNC Reports, Fénix Editora, http:// www. gcn. us. es/ icdmc 2012_ proce edings.
  4. Alhazov, A., Leporati, A., Mauri, G., Porreca, A. E., & Zandron, C. (2014). Space complexity equivalence of P systems with active membranes and Turing machines. Theoretical Computer Science, 529, 69-81. https:// doi. org/ 10. 1016/j. tcs. 2013. 11. 015.
  5. Alhazov, A., & Pan, L. (2004). Polarizationless P systems with active membranes. Grammars, 7, 141-159.
  6. Alhazov, A., Pan, L., & Păun, Gh. (2004). Trading polarizations for labels in P systems with active membranes. Acta Informatica, 41(2-3), 111-144. https:// doi. org/ 10. 1007/ s00236-004-0153-z.
  7. Alhazov, A., & Pérez-Jiménez, M.J. (2007). Uniform solution to QSAT using polarizationless active membranes. In: Durand-Lose, J., Margenstern, M. (eds.) Machines, Computations, and Univer- sality, 5th International Conference, MCU 2007, Lecture Notes in Computer Science, vol. 4664, pp. 122-133. Springer, https:// doi. org/ 10. 1007/ 978-3-540-74593-8_ 11.
  8. Buño, K., & Adorna, H. (2020). Distributed computation of a kP system with active membranes for SAT using clause completion. Journal of Membrane Computing, 2(2), 108-120. https:// doi. org/ 10. 1007/ s41965-020-00040-4.
  9. Cecilia, J., García, J., Guerrero, G., Martínez-del Amor, M., Pérez-Hurtado, I., & Pérez-Jiménez, M. (2010). Simulating a P system based efficient solution to SAT by using GPUs. Journal of Logic and Algebraic Programming, 79(6), 317-325.
  10. García-Quismondo, M., Gutiérrez-Escudero, R., Martínez-del Amor, M.A., Orejuela-Pinedo, E., & Pérez-Hurtado, I. (2009).
  11. P-Lingua 2.0: A software framework for cell-like P systems. Inter- national Journal of Computers, Communications & Control 4(3), 234-243.
  12. Gazdag, Z., & Kolonits, G. (2013). A new approach for solv- ing SAT by P systems with active membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) Membrane Computing, 13th International Conference, CMC 2012. Lecture Notes in Computer Science, vol. 7762, pp. 195- 207. Springer.
  13. Gazdag, Z., & Kolonits, G. (2019). A new method to simulate restricted variants of polarizationless P systems with active mem- branes. Journal of Membrane Computing, 1(4), 251-261.
  14. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A., & Romero-Campero, F.J. (2006). On the power of dissolu- tion in P systems with active membranes. In: Freund, R., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing, 6th International Workshop, WMC 2005. Lecture Notes in Com- puter Science, vol. 3850, pp. 224-240. Springer, https:// doi. org/ 10. 1007/ 11603 047.
  15. Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., Riscos-Nuñez, A., & Romero-Campero, F. J. (2006). Computational efficiency of dissolution rules in membrane systems. International Journal of Computer Mathematics, 83(7), 593-611. https:// doi. org/ 10. 1080/ 00207 16060 10654 13.
  16. Leporati, A., Ferretti, C., Mauri, G., & Zandron, C. (2008). Com- plexity aspects of polarizationless membrane systems. Natural Computing, 4(8), 703-717.
  17. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2014). Constant-space P systems with active membranes. Fundamenta Informaticae, 134(1-2), 111-128. https:// doi. org/ 10. 3233/ FI-2014-1094.
  18. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2015). Membrane division, oracles, and the counting hierar- chy.
  19. Fundamenta Informaticae, 138(1-2), 97-111. https:// doi. org/ 10. 3233/ FI-2015-1201.
  20. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2019). Characterizing PSPACE with shallow non-confluent P systems. Journal of Membrane Computing, 1(2), 75-84. https:// doi. org/ 10. 1007/ s41965-019-00011-4.
  21. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zan- dron, C. (2020). Shallow laconic P systems can count. Journal of Membrane Computing, 2(1), 49-58. https:// doi. org/ 10. 1007/ s41965-020-00032-4.
  22. Leporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2020). A Turing machine simulation by P systems without charges. Journal of Membrane Computing, 2(2), 71-79. https:// doi. org/ 10. 1007/ s41965-020-00031-5.
  23. Leporati, A., Mauri, G., Porreca, A.E., & Zandron, C. (2014). A gap in the space hierarchy of P systems with active membranes. Journal of Automata, Languages and Combinatorics 19(1-4), 173-184, http:// theo. cs. ovgu. de/ jalc/ search/ j19_i. html.
  24. Martinez del Amor, M., Orellana Martín, D., Cabarle, F.G., Pérez Jiménez, M.D., & Adorna, H.N. (2017). Sparse-matrix rep- resentation of spiking neural P systems for GPUs. In: Proceedings of BWMC 2017: 15th Brainstorming Week on Membrane Com- puting. pp. 161-170, https:// idus. us. es/ handle/ 11441/ 67895.
  25. Murphy, N., & Woods, D. (2007). Active membrane systems with- out charges and using only symmetric elementary division char- acterise P. In: Eleftherakis, G., Kefalas, P., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing, 8th International Workshop, WMC 2007. Lecture Notes in Computer Science, vol. 4860, pp. 367-384, https:// doi. org/ 10. 1007/ 978-3-540-77312- 2_ 23.
  26. Murphy, N., & Woods, D. (2011). The computational power of membrane systems under tight uniformity conditions. Nat- ural Computing, 10(1), 613-632. https:// doi. org/ 10. 1007/ s11047-010-9244-7.
  27. Orellana-Martín, D., Valencia-Cabrera, L., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2019). P systems with proteins: a new frontier when membrane division disappears. Journal of Membrane Computing, 1(1), 29-39. https:// doi. org/ 10. 1007/ s41965-018-00003-w.
  28. Pan, L., Alhazov, A., & Ishdorj, T. O. (2005). Further remarks on P systems with active membranes, separation, merging, and release rules. Soft Computing, 9(9), 686-690. https:// doi. org/ 10. 1007/ s00500-004-0399-y.
  29. Papadimitriou, C. H. (1993). Computational Complexity. New York: Addison-Wesley.
  30. Păun, Gh. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75-90.
  31. Păun, Gh, Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford: Oxford University Press.
  32. Porreca, A.E., Leporati, A., Mauri, G., & Zandron, C. (2009). Introducing a space complexity measure for P systems. Interna- tional Journal of Computers, Communications & Control 4(3), 301-310, http:// univa gora. ro/ jour/ index. php/ ijccc/ artic le/ view/ 2779.
  33. Porreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2011). P systems with active membranes: Trading time for space. Natural Computing, 10(1), 167-182. https:// doi. org/ 10. 1007/ s11047-010-9189-x.
  34. Porreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2011). P systems with active membranes working in polynomial space. International Journal of Foundations of Computer Science, 22(1), 65-73. https:// doi. org/ 10. 1142/ S0129 05411 10078 36.
  35. Porreca, A.E., Leporati, A., Mauri, G., & Zandron, C. (2013). Sublinear-space P systems with active membranes. In: Csuhaj- Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) Membrane Computing, 13th International Conference, CMC 2012. Lecture Notes in Computer Science, vol. 7762, pp. 342-357. Springer, https:// doi. org/ 10. 1007/ 978-3-642-36751-9_ 23.
  36. Porreca, A. E., Mauri, G., & Zandron, C. (2006). Complexity classes for membrane systems. RAIRO Theoretical Informatics and Applications, 40(2), 141-162. https:// doi. org/ 10. 1051/ ita: 20060 01.
  37. Porreca, A. E., Mauri, G., & Zandron, C. (2010). Non-confluence in divisionless P systems with active membranes. Theoretical Computer Science, 411(6), 878-887. https:// doi. org/ 10. 1016/j. tcs. 2009. 07. 032.
  38. Sosík, P. (2003). The computational power of cell division in P systems: Beating down parallel computers? Natural Computing, 2(3), 287-298. https:// doi. org/ 10. 1023/A: 10254 01325 428.
  39. Sosík, P. (2019). P systems attacking hard problems beyond NP: a survey. Journal of Membrane Computing, 1(3), 198-208. https:// doi. org/ 10. 1007/ s41965-019-00017-y.
  40. Valencia-Cabrera, L., Orellana-Martín, D., Martínez-del-Amor, M. A., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2017). Com- putational efficiency of minimal cooperation and distribution in polarizationless P systems with active membranes. Fundamenta Informaticae, 153(1-2), 147-172. https:// doi. org/ 10. 3233/ FI-2017-1535.
  41. Valencia-Cabrera, L., Orellana-Martín, D., Martínez-del-Amor, M. A., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2017). Reach- ing efficiency through collaboration in membrane systems: Dissolution, polarization and cooperation. Theoretical Computer Science, 701, 226-234. https:// doi. org/ 10. 1016/j. tcs. 2017. 04. 015.
  42. Zandron, C. (2020). Bounding the space in P systems with active membranes. Journal of Membrane Computing, 2(2), 137-145. https:// doi. org/ 10. 1007/ s41965-020-00039-x.
  43. Zandron, C., Ferretti, C., & Mauri, G. (2001). Solving NP- complete problems using P systems with active membranes. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC'2K, Proc. Second Int. Conference, pp. 289-301. Springer, https:// doi. org/ 10. 1007/ 978-1-4471-0313- 4_ 21.

Related papers

Introducing a space complexity measure for P systems
Giancarlo Mauri

2009

We define space complexity classes in the framework of membrane computing, giving some initial results about their mutual relations and their connection with time complexity classes, and identifying some potentially interesting problems which require further research.

View PDFchevron_right
Evaluating space measures in P systems
Giancarlo Mauri

Journal of Membrane Computing

P systems with active membranes are a variant of P systems where membranes can be created by division of existing membranes, thus creating an exponential amount of resources in a polynomial number of steps. Time and space complexity classes for active membrane systems have been introduced, to characterize classes of problems that can be solved by different membrane systems making use of different resources. In particular, space complexity classes introduced initially considered a hypothetical real implementation by means of biochemical materials, assuming that every single object or membrane requires some constant physical space (corresponding to unary notation). A different approach considered implementation of P systems in silico, allowing to store the multiplicity of each object in each membrane using binary numbers. In both cases, the elements contributing to the definition of the space required by a system (namely, the total number of membranes, the total number of objects, the...

View PDFchevron_right
Complexity classes for membrane systems
Antonio Porreca

RAIRO - Theoretical Informatics and Applications, 2006

We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the functioning of the cell, with usual computational complexity classes for Turing machines. In particular, we focus our attention on the comparison among complexity classes for membrane systems with active membranes (where new membranes can be created by division of existing membranes) and the classes PSPACE, EXP, and EXPSPACE.

View PDFchevron_right
Membrane division, restricted membrane creation and object complexity in P systems
Artiom Alhazov

International Journal of Computer Mathematics, 2006

We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region (except the environment) contains more than one object of the same kind. We here show that they generate all recursively enumerable languages, and two membrane labels are sufficient (the same result holds for accepting all recursively enumerable vectors of non-negative integers). Moreover, at most two objects are present inside the system at any time in the generative case. Then we prove that 10 + m symbols are enough to generate any recursively enumerable language over m symbols. P systems with active membranes without polarizations are known to generate all recursively enumerable sets of vectors of non-negative integers. We show that they generate all recursively enumerable languages; four starting membranes with three labels or seven starting membranes with two labels are sufficient. P systems with active membranes and two polarizations are known to generate/accept all recursively enumerable sets of vectors of nonnegative integers, only using rules of rewriting and sending objects out. We show that accepting can be done by deterministic systems.

View PDFchevron_right
Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules
Artiom Alhazov

Lecture Notes in Computer Science, 2006

We consider P systems with symport/ antiport rules and small numbers of symbols and membranes and present several results for P systems with symport/ antiport rules simulating register machines with the number of registers depending on the number s of symbols and the number m of membranes. For instance, any recursively enumerable set of natural numbers can be generated (accepted) by systems with s ≥ 2 symbols and m ≥ 1 membranes such that m + s ≥ 6. In particular, the result of the original paper [17] proving universality for three symbols and four membranes is improved (e.g., three symbols and three membranes are sufficient). The general results that P systems with symport/ antiport rules with s symbols and m membranes are able to simulate register machines with max {m (s − 2) , (m − 1) (s − 1)} registers also allows us to give upper bounds for the numbers s and m needed to generate/accept any recursively enumerable set of k-dimensional vectors of non-negative integers or to compute any partial recursive function f : N α → N β . Finally, we also study the computational power of P systems with symport/ antiport rules and only one symbol: with one membrane, we can exactly generate the family of finite sets of non-negative integers; with one symbol and two membranes, we can generate at least all semilinear sets. The most interesting open question is whether P systems with symport/ antiport rules and only one symbol can gain computational completeness (even with an arbitrary number of membranes) as it was shown for tissue P systems in [1].

View PDFchevron_right

Related topics

  • Computer Science
  • Membrane Computing

    • Cited by

    On the power of P systems with active membranes using weak non-elementary membrane division
    Zsolt Gazdag

    Journal of Membrane Computing, 2021

    It is known that polarizationless P systems with active membranes can solve $$\mathrm {PSPACE}$$ PSPACE -complete problems in polynomial time without using in-communication rules but using the classical (also called strong) non-elementary membrane division rules. In this paper, we show that this holds also when in-communication rules are allowed but strong non-elementary division rules are replaced with weak non-elementary division rules, a type of rule which is an extension of elementary membrane divisions to non-elementary membranes. Since it is known that without in-communication rules, these P systems can solve in polynomial time only problems in $$\mathrm {P}^{\text {NP}}$$ P NP , our result proves that these rules serve as a borderline between $$\mathrm {P}^{\text {NP}}$$ P NP and $$\mathrm {PSPACE}$$ PSPACE concerning the computational power of these P systems.

    View PDFchevron_right
    Evaluating space measures in P systems
    Giancarlo Mauri

    Journal of Membrane Computing

    P systems with active membranes are a variant of P systems where membranes can be created by division of existing membranes, thus creating an exponential amount of resources in a polynomial number of steps. Time and space complexity classes for active membrane systems have been introduced, to characterize classes of problems that can be solved by different membrane systems making use of different resources. In particular, space complexity classes introduced initially considered a hypothetical real implementation by means of biochemical materials, assuming that every single object or membrane requires some constant physical space (corresponding to unary notation). A different approach considered implementation of P systems in silico, allowing to store the multiplicity of each object in each membrane using binary numbers. In both cases, the elements contributing to the definition of the space required by a system (namely, the total number of membranes, the total number of objects, the...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved