Now showing items 1-20 of 26

    • Icon

      A Toolbox for Simpler Active Membrane Algorithms  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Fénix, 2016)
      We show that recogniser P systems with active membranes can be augmented with a priority over their set of rules and any number of membrane charges without loss of generality, as they can be simulated by standard P ...
    • Icon

      Characterizing PSPACE with Shallow Non-Confluent P Systems  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem. It is known that, for shallow P systems, that is, with only one level ...
    • Icon

      Characterizing the Computational Power of Energy-Based P Systems  [Presentation]

      Alhazov, Artiom; Antoniotti, Marco; Leporati, Alberto (Fénix Editora, 2012)
      We investigate the computational power of energy-based P systems, a model of membrane systems where a fixed amount of energy is associated with each object and the rules transform single objects by adding or removing ...
    • Icon

      Complete Problems for a Variant of P Systems with Active Membranes  [Presentation]

      Porreca, Antonio E.; Leporati, Alberto; Mauri, Giancarlo; Zandron, Claudio (Fénix Editora, 2010)
      We identify a family of decision problems that are hard for some complexity classes defined in terms of P systems with active membranes working in polynomial time. Furthermore, we prove the completeness of these problems ...
    • Icon

      Complexity aspects of polarizationless membrane systems  [Article]

      Leporati, Alberto; Ferretti, Claudio; Mauri, Giancarlo; Pérez Jiménez, Mario de Jesús; Zandron, Claudio (Springer, 2009)
      We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently ...
    • Icon

      Constant-Space P Systems with Active Membranes  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Fénix Editora, 2014)
      We continue the investigation of the computational power of space- constrained 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 ...
    • Icon

      Deterministic Solutions to QSAT and Q3SAT by Spiking Neural P Systems with Pre-Computed Resources  [Presentation]

      Ishdorj, Tseren-Onolt; Leporati, Alberto; Pan, Linqiang; Zeng, Xiangxiang; Zhang, Xingyi (Fénix Editora, 2009)
      In this paper we continue previous studies on the computational effciency of spiking neural P systems, under the assumption that some pre-computed resources of exponential size are given in advance. Specifically, we give ...
    • Icon

      Elementary Active Membranes Have the Power of Counting  [Presentation]

      Porreca, Antonio E.; Leporati, Alberto; Mauri, Giancarlo; Zandron, Claudio (Fénix Editora, 2011)
      We prove that uniform families of P systems with active membranes operat- ing in polynomial time can solve the whole class of PP decision problems, without using nonelementary membrane division or dissolution rules. This ...
    • Icon

      Improving Universality Results on Parallel Enzymatic Numerical P Systems  [Presentation]

      Leporati, Alberto; Porreca, Antonio E.; Zandron, Claudio; Mauri, Giancarlo (Fénix Editora, 2013)
      We improve previously known universality results on enzymatic numerical P systems (EN P systems, for short) working in all-parallel and one-parallel modes. By using a attening technique, we rst show that any EN P ...
    • Icon

      Introducing a Space Complexity Measure for P Systems  [Presentation]

      Porreca, Antonio E.; Leporati, Alberto; Mauri, Giancarlo; Zandron, Claudio (Fénix Editora, 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 ...
    • Icon

      Modeling and Analysis of Firewalls by (Tissue-like) P Systems  [Presentation]

      Leporati, Alberto; Ferretti, Claudio (Fénix Editora, 2010)
      We propose to use tissue-like P systems as a tool to model and analyse the security properties of ¯rewall systems. The idea comes from a clear analogy between firewall rules and P systems rules: they both modify and or ...
    • Icon

      Monodirectional P Systems  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Fénix Editora, 2015)
      We investigate the in uence that the ow of information in membrane systems has on their computational complexity. In particular, we analyse the behaviour of P systems with active membranes where communication only ...
    • Icon

      On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution  [Presentation]

      Zandron, Claudio; Leporati, Alberto; Ferretti, Claudio; Mauri, Giancarlo; Pérez Jiménez, Mario de Jesús (Fénix Editora, 2008)
      Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful ...
    • Icon

      On the Computational Power of Spiking Neural P Systems  [Presentation]

      Leporati, Alberto; Zandron, Claudio; Ferretti, Claudio; Mauri, Giancarlo (Fénix Editora, 2007)
      In this paper we study some computational properties of spiking neural P systems. In particular, we show that by using nondeterminism in a slightly extended version of spiking neural P systems it is possible to solve in ...
    • Icon

      On The Semantics of Annihilation Rules in Membrane Computing  [Presentation]

      Díaz Pernil, Daniel; Freund, Rudolf; Gutiérrez Naranjo, Miguel Ángel; Leporati, Alberto (Fénix Editora, 2015)
      It is well known that polarizationless recognizer P systems with active membranes, without dissolution, with division of elementary and non-elementary membranes, with antimatter and matter/antimatter annihilation rules ...
    • Icon

      Performing Arithmetic Operations with Spiking Neural P Systems  [Presentation]

      Gutiérrez Naranjo, Miguel Ángel; Leporati, Alberto (Fénix Editora, 2009)
      We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplication by a fixed factor. The input to these systems are ...
    • Icon

      Self-Stabilization in Membrane Systems  [Presentation]

      Alhazov, Artiom; Antoniotti, Marco; Freund, Rudolf; Leporati, Alberto; Mauri, Giancarlo (Fénix Editora, 2012)
      In this paper we study a notion of self-stabilization, inspired from biology and engineering. Multiple variants of formalization of this notion are considered, and we discuss how such properties affect the computational ...
    • Icon

      Sequential P Systems with Unit Rules and Energy Assigned to Membranes  [Presentation]

      Freund, Rudolf; Leporati, Alberto; Oswald, Marion; Zandron, Claudio (Fénix Editora, 2004)
      We introduce a new variant of membrane systems where the rules are directly assigned to membranes (and not to the regions as this is usually observed in the area of membrane systems) and, moreover, every membrane carries ...
    • Icon

      Simulating counting oracles with cooperation  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
      We prove that monodirectional shallow chargeless P systems with active membranes and minimal cooperation working in polynomial time precisely characterise P#P k , the complexity class of problems solved in polynomial ...
    • Icon

      Simulating the Fredkin Gate with Energy-Based P Systems  [Presentation]

      Leporati, Alberto; Zandron, Claudio; Mauri, Giancarlo (Fénix Editora, 2004)
      Reversibility plays a fundamental role when the possibility to per- form computations with minimal energy dissipation is considered. Many pa- pers on reversible computation have appeared in literature: the most famous are ...