Now showing items 9-19 of 19

    • 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

      Kernel P Systems - Version 1  [Presentation]

      Gheorgue, Marian; Ipate, Florentin; Dragomir, Ciprian; Mierla, Laurentiu; Valencia Cabrera, Luis; García Quismondo, Manuel; Pérez Jiménez, Mario de Jesús (Fénix Editora, 2013)
      A basic P system, called kernel P system4 (kP system for short), combining features of di erent P systems introduced and studied so far is de ned and discussed. The structure of such systems is de ned as a dynamic graph, ...
    • Icon

      On Controlled P Systems  [Presentation]

      Krithivasan, Kamala; Paun, Gheorghe; Ramanujan, Ajeesh (Fénix Editora, 2013)
      We introduce and brie y investigate P systems with controlled computations. First, P systems with label restricted transitions are considered (in each step, all rules used have either the same label, or, possibly, the ...
    • Icon

      Rete Algorithm for P System Simulators  [Presentation]

      Graciani Díaz, Carmen; Gutiérrez Naranjo, Miguel Ángel; Riscos Núñez, Agustín (Fénix Editora, 2013)
      The Rete algorithm is a well-known algorithm in rule-based production systems which builds directed acyclic graphs that represent higher-level rule sets. This allows the rule-based systems to avoid complete re-evaluation ...
    • Icon

      Scenario Based P Systems  [Presentation]

      Ciobanu, Gabriel; Sburlan, Dragos (Fénix Editora, 2013)
      In this paper we de ne and study Scenario Based P Systems, a model of computation inspired by the metabolic pathways and networks. Starting from the classical de nition of P systems with symbol objects and multiset ...
    • Icon

      Simulating a Family of Tissue P Systems Solving SAT on the GPU  [Presentation]

      Martínez del Amor, Miguel Ángel; Pérez Carrasco, Jesús; Pérez Jiménez, Mario de Jesús (Fénix Editora, 2013)
      In order to provide e cient software tools to deal with large membrane systems, high-throughput simulators are required. Parallel computing platforms are good candidates, since they are capable of partially implementing ...
    • Icon

      Some Open Problems about Numerical P Systems  [Presentation]

      Paun, Gheorghe (Fénix Editora, 2013)
      Some open problems and research topics related to numerical P systems are formulated { also recalling the problems from the corresponding section of the \mega- paper produced for the previous BWMC
    • Icon

      Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques  [Presentation]

      Ardelean, Ioan I.; Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Peña Cantillana, Francisco; Sarchizian, Iris (Fénix Editora, 2013)
      In this paper, we report a pioneer study of the decrease in chlorophyll uorescence produced by the reduction of MTT (a dimethyl thiazolyl diphenyl tetrazolium salt) monitored using an epi uorescence microscope coupled ...
    • Icon

      The "Catalytic Borderline" Between Universality and Non-Universality of P Systems  [Presentation]

      Paun, Gheorghe (Fénix Editora, 2013)
      P systems are computing models inspired by the structure and the function- ing of the living cells; they are the basic computing devices of membrane computing, a branch of natural computing. The present note is an overview ...
    • Icon

      Turing Incompleteness of Asynchronous P Systems with Active Membranes  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Porreca, Antonio E. (Fénix Editora, 2013)
      We prove that asynchronous P systems with active membranes without divi- sion rules can be simulated by place/transition Petri nets, and hence are computationally weaker than Turing machines. This result holds even if ...
    • Icon

      Universal P Systems: One Catalyst Can Be Suficient  [Presentation]

      Freund, Rudolf; Paun, Gheorghe (Fénix Editora, 2013)
      Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using speci c variants of additional control mechanisms. At each ...