Papers by Carmen Graciani
Lecture Notes in Computer Science, 2015
One of the major challenges that current P systems simulators have to deal with is to be as effic... more One of the major challenges that current P systems simulators have to deal with is to be as efficient as possible. A P system is syntactically described as a membrane structure delimiting regions where multisets of objects evolve by means of evolution rules. According to that, on each computation step, the applicability of the rules for the current P system configuration must be calculated. In this paper we extend previous works that use Rete-based simulation algorithm in order to improve the time consumed during the checking phase in the selection of rules. A new approach is presented, oriented to the acceleration of Population Dynamics P Systems simulations.
Theoretical Computer Science, Nov 1, 2017
Research interest within membrane computing is becoming increasingly interdisciplinary. In partic... more Research interest within membrane computing is becoming increasingly interdisciplinary. In particular, one of the latest applications is fault diagnosis. The underlying mechanism was conceived by bridging spiking neural P systems with fuzzy rule-based reasoning systems. Despite having a number of publications associated with it, this research line still lacks a proper formalization of the foundations.
Lecture Notes in Computer Science, 2002
The aim of this paper is to develop an executable prototype of an unconventional model of computa... more The aim of this paper is to develop an executable prototype of an unconventional model of computation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal proofs), we formalize the restricted model, based on DNA, due to L. Adleman. Also, we design a formal molecular program in this model that solves SAT following Lipton's ideas. We prove using PVS the soundness and completeness of this molecular program. This work is intended to give an approach to the opportunities offered by mechanized analysis of unconventional model of computation in general. This approach opens up new possibilities of verifying molecular experiments before implementing them in a laboratory.
Fundamenta Informaticae, 2014
Sevilla carpets have already been used to compare different solutions of the Subset Sum problem: ... more Sevilla carpets have already been used to compare different solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets in this context, and a script that allows to generate them automatically from P-Lingua files.
This volume contains the papers emerged from the Sixth Brainstorming Week on Membrane Computing (... more This volume contains the papers emerged from the Sixth Brainstorming Week on Membrane Computing (BWMC), held in Sevilla, from February 4 to February 8, 2008, in the organization of the Research Group on Natural Computing from the Department of Computer Science and Artificial Intelligence of Sevilla University. The first edition of BWMC was organized at the beginning of February 2003 in Rovira i Virgili University, Tarragona, and the next four editions took place in Sevilla at the beginning of February 2004, 2005, 2006, and 2007, respectively. In the style of previous meetings in this series, the sixth BWMC was again a period of active interaction among the participants, with the emphasis on exchanging ideas and cooperation, with only a few (“provocative”, of any length between 5 and 55 minutes, depending on the interaction with audience) presentations scheduled in the first days of the meeting and with most of the time devoted to the joint work. The efficiency of this type of meetin...
Summary. Sevilla Carpets have already been used to compare different solutions of the Subset Sum ... more Summary. Sevilla Carpets have already been used to compare different solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and also another one in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets, and a script that allows to generate them automatically from P-Lingua files. 1
Summary. The Rete algorithm is a well-known algorithm in rule-based production systems which buil... more Summary. 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 of all conditions of the rules each step in order to check the applicability of the rules and, therefore, the computational efficiency of the production systems is improved. In this paper we study how these ideas can be applied in the improvement of the design of computational simulators in the framework of Membrane Computing. 1
Sevilla carpets have already been used to compare different solutions of the Subset Sum problem: ... more Sevilla carpets have already been used to compare different solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets in this context, and a script that allows to generate them automatically from P-Lingua files.
This paper is a tribute to Prof. Mario de Jesus Perez-Jimenez. An overview of modelling applicati... more This paper is a tribute to Prof. Mario de Jesus Perez-Jimenez. An overview of modelling applications in membrane computing has been compiled, trying to narrate it from a historical perspective and including numerous bibliographical references. Since being exhaustive was obviously out of scope, this quick tour on almost two decades of applications is biased, paying special attention to the contributions in which Prof. Perez-Jimenez and members of his research group were involved.
We introduce several variants of input-driven tissue P automata – we also will call them chocolat... more We introduce several variants of input-driven tissue P automata – we also will call them chocolate automata – where the rules to be applied only depend on the input symbol. Both strings and multisets are considered as input objects; the strings are either read from an input tape or defined by the sequence of symbols taken in, and the multisets are given in an input cell at the beginning of a computation, enclosed in a vesicle. Additional symbols generated during a computation are stored in this vesicle, too. An input is accepted when the vesicle reaches a final cell and it is empty. The computational power of some variants of input-driven tissue P automata (chocolate automata) is illustrated by examples and compared with the power of the input-driven variants of other automata as register machines and counter automata.
Theoretical Computer Science
Research interest within membrane computing is becoming increasingly interdisciplinary. In partic... more Research interest within membrane computing is becoming increasingly interdisciplinary. In particular, one of the latest applications is fault diagnosis. The underlying mechanism was conceived by bridging spiking neural P systems with fuzzy rule-based reasoning systems. Despite having a number of publications associated with it, this research line still lacks a proper formalization of the foundations.
Lecture Notes in Computer Science, 2013
Population Dynamics P systems refer to a formal framework for ecological modelling. The semantics... more Population Dynamics P systems refer to a formal framework for ecological modelling. The semantics of the model associates probabilities to rules, but at the same time, the model is based on P systems, so the rules are applied in a maximally parallel way. Since the success of the first model using this framework [5], initially called multienvironment probabilistic P systems, several simulation algorithms have been defined in order to better reproduce the behaviour of the ecosystems with the models. BBB and DNDP are previous attempts, which define blocks of rules having the same left-hand side, but do not define a deterministic behaviour when different rules are competing for the same resources. That is, different blocks of rules present in their lefthand side common objects, being applicable at the same time. In this paper, we introduce a new simulation algorithm, called DCBA, which performs a proportional distribution of resources.
Lecture Notes in Computer Science, 2015
Ballistic Deposition was proposed by Vold and Sutherland [8] as a model for colloidal aggregation... more Ballistic Deposition was proposed by Vold and Sutherland [8] as a model for colloidal aggregation. These early works were later extended to simulate the process of vapor deposition. In general, Ballistic Deposition models involve (d + 1)-dimensional particles which rain down sequentially at random onto a d-dimensional substrate; when a particle arrives on the existing agglomeration of deposited particles, it sticks to the rst particle it contacts, which may result in lateral growth. In this paper we present a rst P system model for Ballistic Deposition with d = 1.
International Journal of Unconventional Computing
ABSTRACT
Lecture Notes in Computer Science, 2002
The aim of this paper is to develop an executable prototype of an unconventional model of computa... more The aim of this paper is to develop an executable prototype of an unconventional model of computation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal proofs), we formalize the restricted model, based on DNA, due to L. Adleman. Also, we design a formal molecular program in this model that solves SAT following Lipton's ideas. We prove using PVS the soundness and completeness of this molecular program. This work is intended to give an approach to the opportunities offered by mechanized analysis of unconventional model of computation in general. This approach opens up new possibilities of verifying molecular experiments before implementing them in a laboratory.
Lecture Notes in Computer Science, 2005
Uploads
Papers by Carmen Graciani