@article {XIAN2024110112,
	title = {Feature fusion method based on spiking neural convolutional network for edge detection},
	journal = {Pattern Recognition},
	volume = {147},
	year = {2024},
	month = {03/2024},
	pages = {110112},
	publisher = {Elsevier},
	abstract = {NSNP-type neuron is a new type of neuron model inspired by nonlinear spiking mechanisms in nonlinear spiking neural P systems. In order to address the loss problem of edge detail information in edge detection methods based on deep learning, we propose a feature fusion method based on NSNP-type neurons. The architecture of this feature fusion method consists of two modules: feature extraction module and feature fusion module. In particular, the feature fusion module is composed of convolutional blocks constructed by NSNP-type neurons for multi-level feature fusions, and CoT blocks with Transformer style is introduced to extract rich contextual information from low-level features and high-level features. To fuse multi-level features and preserve contextual information, we design a new loss function that not only preserves feature prediction loss and fusion loss, but also considers contour-related and texture-related information. The proposed method is evaluated on BSDS500 and NYUDv2 data sets and compare it with 9 baseline methods and 12 CNN-based methods, and we achieve ODS of 0.808 and OIS of 0.827 on BSDS500. The comparison results demonstrate the advantages of the proposed method for edge detection. The source code is available at https://github.com/xhuph66/FF-CNSNP-master.},
	keywords = {Edge detection, Feature fusion, Nonlinear spiking neural P systems, NSNP-type neuron model},
	issn = {0031-3203},
	doi = {https://doi.org/10.1016/j.patcog.2023.110112},
	url = {https://www.sciencedirect.com/science/article/pii/S0031320323008099},
	author = {Ronghao Xian and Xin Xiong and Hong Peng and Jun Wang and Antonio Ram{\'\i}rez-de-Arellano-Marrero and Qian Yang}
}
@article {2527,
	title = {Generating, computing and recognizing with virus machines},
	journal = {Theoretical Computer Science},
	volume = {972},
	year = {2023},
	month = {07/2023},
	pages = {114077},
	publisher = {Springer},
	doi = {https://doi.org/10.1016/j.tcs.2023.114077},
	author = {Ram{\'\i}rez-de-Arellano, Antonio and David Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {math11132797,
	title = {A Protocol for Solutions to DP-Complete Problems through Tissue Membrane Systems},
	journal = {Mathematics},
	volume = {11},
	number = {13},
	year = {2023},
	month = {06/2023},
	pages = {2797},
	publisher = {MDPI},
	edition = {13},
	abstract = {Considering a class\&nbsp;R\&nbsp;comprising recognizer membrane systems with the capability of providing polynomial-time and uniform solutions for NP-complete problems (referred to as a \&ldquo;presumably efficient\&rdquo; class), the corresponding polynomial-time complexity class PMCR\&nbsp;encompasses both the NP and\&nbsp;co-NP\&nbsp;classes. Specifically, when\&nbsp;R\&nbsp;represents the class of recognizer presumably efficient cell-like P systems that incorporate object evolution rules, communication rules, and dissolution rules, PMCR\&nbsp;includes both the DP and\&nbsp;co-DP\&nbsp;classes. Here, DP signifies the class of languages that can be expressed as the difference between any two languages in NP (it is worth noting that NP \&sube; DP and\&nbsp;co-NP\&sube;co-DP). As DP-complete problems are believed to be more complex than NP-complete problems, they serve as promising candidates for studying the P vs. NP problem. This outcome has previously been established within the realm of recognizer P systems with active membranes. In this paper, we extend this result to encompass any class\&nbsp;R\&nbsp;of presumably efficient recognizer tissue-like membrane systems by presenting a detailed protocol for transforming solutions of NP-complete problems into solutions of DP-complete problems.},
	issn = {2227-7390},
	doi = {10.3390/math11132797},
	url = {https://www.mdpi.com/2227-7390/11/13/2797},
	author = {David Orellana-Mart{\'\i}n and Ram{\'\i}rez-de-Arellano, Antonio and Andreu-Guzm{\'a}n, Jos{\'e} Antonio and {\'A}lvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {doi:10.1142/S0129065723500235,
	title = {Using Virus Machines to Compute Pairing Functions},
	journal = {International Journal of Neural Systems},
	volume = {33},
	number = {05},
	year = {2023},
	note = {PMID: 36967221},
	month = {03/2024},
	pages = {2350023},
	publisher = {World Scientific},
	abstract = {Virus machines are computational devices inspired by the movement of viruses between hosts and their capacity to replicate using the resources of the hosts. This behavior is controlled by an external graph of instructions that opens different channels of the system to make viruses capable of moving. This model of computation has been demonstrated to be as powerful as turing machines by different methods: by generating Diophantine sets, by computing partial recursive functions and by simulating register machines. It is interesting to investigate the practical use cases of this model in terms of possibilities and efficiency. In this work, we give the basic modules to create an arithmetic calculator. As a practical application, two pairing functions are calculated by means of two different virus machines. Pairing functions are important resources in the field of cryptography. The functions calculated are the Cantor pairing function and the G{\"o}del pairing function.},
	doi = {10.1142/S0129065723500235},
	url = {https://doi.org/10.1142/S0129065723500235},
	author = {Ram{\'\i}rez-de-Arellano, Antonio and David Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {BAI2023119916,
	title = {Sequence recommendation using multi-level self-attention network with gated spiking neural P systems},
	journal = {Information Sciences},
	year = {2023},
	pages = {119916},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Sequence recommendation is used to predict the user{\textquoteright}s next potentially interesting items and behaviors. It not only focuses on the user{\textquoteright}s independent interaction behavior, but also considers the user{\textquoteright}s historical behavior sequence. However, sequence recommendation still faces some challenges: the existing models still have shortcomings in addressing long-term dependencies and fully utilizing contextual information in sequence recommendation. To address these challenges, we propose a four-channel model based on a multi-level self-attention network with gated spiking neural P (GSNP) systems, termed SR-MAG model. The four channels are divided into two groups, and each group is composed of an attention channel and an GSNP attention channel. Moreover, they process long-term sequences and short-term sequences respectively to obtain long-term or short-term attention channel features. These features are then passed through a self-attention network to effectively extract user context information. The proposed SR-MAG model is tested on three real datasets and compared with 10 baseline methods. Experimental results demonstrate the effectiveness of the proposed SR-MAG model in sequence recommendation tasks.},
	keywords = {Gated spiking neural P systems, Nonlinear spiking neural P systems, Self-attention mechanism, Sequence recommendation},
	issn = {0020-0255},
	doi = {https://doi.org/10.1016/j.ins.2023.119916},
	url = {https://www.sciencedirect.com/science/article/pii/S0020025523015013},
	author = {Xinzhu Bai and Yanping Huang and Hong Peng and Jun Wang and Qian Yang and David Orellana-Mart{\'\i}n and Ram{\'\i}rez-de-Arellano, Antonio and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {10.1007/978-3-031-06527-9_40,
	title = {Basic Arithmetic Calculations Through Virus-Based Machines},
	journal = {Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence},
	year = {2022},
	pages = {403{\textendash}412},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {In Natural Computing, several models of computation based on processes occurring in nature exist. While some of them are well-established computing framework, there are some types of devices that are underdeveloped. This is the case of Virus Machines, framework inspired by the movement of viruses between hosts, and how can they be replicated while certain events happen. The relevance of this work lies in the formal definition of the framework and both the insights presented about the formal verification of the different designs and the possible new research lines.},
	isbn = {978-3-031-06527-9},
	doi = {https://doi.org/10.1007/978-3-031-06527-9_40},
	author = {Ram{\'\i}rez-de-Arellano, Antonio and David Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Ferr{\'a}ndez Vicente, Jos{\'e} Manuel and {\'A}lvarez-S{\'a}nchez, Jos{\'e} Ram{\'o}n and de la Paz L{\'o}pez, F{\'e}lix and Adeli, Hojjat}
}
@article {2506,
	title = {A new P-Lingua toolkit for agile development in membrane computing},
	journal = {Information Sciences},
	volume = {587},
	year = {2022},
	pages = {1-22},
	doi = {10.1016/j.ins.2021.12.003},
	url = {https://doi.org/10.1016/j.ins.2021.12.003},
	author = {Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Miguel {\'A}. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2455,
	title = {Modeling Diel Vertical Migration with Membrane Computing},
	journal = {Journal of Membrane Computing},
	volume = {3},
	year = {2021},
	month = {03/2021},
	pages = {35-50},
	publisher = {Springer},
	address = {Amsterdam (The Netherlands)},
	abstract = {Climate change is disrupting ecological systems worldwide, including the alteration of animal migration behavior. Diel Vertical Migration (DVM) is an important ecological phenomenon in which zooplankton migrate vertically to deal with tradeoffs associated with greater food availability in shallow waters and lower predator risk in deep waters due to lower light availability. Because of these tradeoffs, DVM dynamics are particularly sensitive to changes in light intensity at the water surface. We propose a new computational model that captures the effect of the annual proportion of cloudy and sunny days on DVM in Daphnia and we use it to explore the impacts of an increased proportion of cloudy days that are predicted to occur with climate change. Our 2-dimensional, spatially explicit model integrates multiple trophic levels, from abiotic nutrients to Daphnia predators. Our model is parameterized based on data from Lake George, NY, USA. We analyzed the effect that different proportions of cloudy and sunny days throughout the summer, as well as different assumptions on predator avoidance dynamics of Daphnia, have on our model. The model simulations suggest that an increase in sunny days promotes a high phytoplankton concentration near the surface but does not necessarily promote an increased abundance of Daphnia. This is because high ultraviolet radiation levels deter Daphnia from migrating to shallow waters, even though phytoplankton biomass is higher, because the risk of predation is greater. Our model suggests that a higher proportion of cloudy days would increase Daphnia abundance due to a shift in the vertical distribution of Daphnia populations towards superficial waters. Our results highlight that climate changes in multiple regions, such as the frequency and duration of precipitation events, will affect animal migrations leading to altered food web dynamics in freshwater ecosystems. },
	keywords = {Daphnia, Diel vertical migration, Limnology, Mathematical modeling, Population Dynamics, simulation},
	issn = {2523-8906},
	doi = {10.1007/s41965-020-00038-y},
	author = {Manuel Garc{\'\i}a-Quismondo and William D. Hintz and Matthew S. Schuler and Rick A. Relyea}
}
@article {2472,
	title = {Dendrite P Systems toolbox: representation, algorithms and simulators},
	journal = {International Journal of Neural Systems},
	volume = {31},
	year = {2021},
	pages = {2050071},
	doi = {10.1142/S0129065720500719},
	author = {David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2477,
	title = {A Framework for Evolving Spiking Neural P Systems},
	journal = {International Journal of Unconventional Computing},
	volume = {16},
	year = {2021},
	pages = {121-139},
	url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-16-number-2-3-2021/},
	author = {L.J. Casauay and I.C. Macababayao and F.G. Cabarle and R.T. de la Cruz and Henry Adorna and XiangXiang Zeng and Miguel {\'A}. Mart{\'\i}nez-del-Amor}
}
@article {2480,
	title = {GPU-parallel Crowd Simulation with Vulkan},
	journal = {6th International Workshop on Modeling and Simulation of and by Parallel and Distributed Systems (MSPDS 2020)},
	year = {2021},
	pages = {In press},
	url = {http://hpcs2020.cisedu.info/4-program/processed-manuscripts},
	author = {Antonio Torres-Mor{\'\i}{\~n}igo and Miguel A. Mart{\'\i}nez-del-Amor and Fernando Sancho-Caparrini}
}
@article {doi:10.1142/S0129065720500501,
	title = {Medical Image Fusion Method Based on Coupled Neural P Systems in Nonsubsampled Shearlet Transform Domain},
	journal = {International Journal of Neural Systems},
	volume = {31},
	number = {ja},
	year = {2021},
	pages = {2050050},
	doi = {10.1142/S0129065720500501},
	author = {Bo Li and Hong Peng and Xiaohui Luo and Jun Wang and Xiaoxiao Song and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2486,
	title = {A membrane computing framework for social navigation in robotics},
	journal = {Computers and Electrical Engineering},
	volume = {95},
	year = {2021},
	pages = {107408},
	doi = {10.1016/j.compeleceng.2021.107408},
	url = {https://doi.org/10.1016/j.compeleceng.2021.107408},
	author = {Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera}
}
@article {2479,
	title = {Simulation of Spiking Neural P Systems with Sparse Matrix-Vector Operations},
	journal = {Processes},
	volume = {9},
	year = {2021},
	abstract = {To date, parallel simulation algorithms for spiking neural P (SNP) systems are based on a matrix representation. This way, the simulation is implemented with linear algebra operations, which can be easily parallelized on high performance computing platforms such as GPUs. Although it has been convenient for the first generation of GPU-based simulators, such as CuSNP, there are some bottlenecks to sort out. For example, the proposed matrix representations of SNP systems lead to very sparse matrices, where the majority of values are zero. It is known that sparse matrices can compromise the performance of algorithms since they involve a waste of memory and time. This problem has been extensively studied in the literature of parallel computing. In this paper, we analyze some of these ideas and apply them to represent some variants of SNP systems. We also provide a new simulation algorithm based on a novel compressed representation for sparse matrices. We also conclude which SNP system variant better suits our new compressed matrix representation.},
	issn = {2227-9717},
	doi = {10.3390/pr9040690},
	url = {https://doi.org/10.3390/pr9040690},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Francis G. C. Cabarle and Henry N. Adorna}
}
@article {doi:10.1142/S0129065720500495,
	title = {Spiking Neural P Systems with Extended Channel Rules},
	journal = {International Journal of Neural Systems},
	volume = {31},
	number = {ja},
	year = {2021},
	pages = {2050049},
	doi = {10.1142/S0129065720500495},
	author = {Zeqiong Lv and Tingting Bao and Nan Zhou and Hong Peng and Xiangnian Huang and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {10.1145/3431234,
	title = {A Survey of Nature-Inspired Computing: Membrane Computing},
	journal = {ACM Computing Surveys},
	volume = {54},
	number = {1},
	year = {2021},
	pages = {Article no 22},
	publisher = {Association for Computing Machinery},
	address = {New York, NY, USA},
	abstract = {Nature-inspired computing is a type of human-designed computing motivated by nature, which is based on the employ of paradigms, mechanisms, and principles underlying natural systems. In this article, a versatile and vigorous bio-inspired branch of natural computing, named membrane computing is discussed. This computing paradigm is aroused by the internal membrane function and the structure of biological cells. We first introduce some basic concepts and formalisms of membrane computing, and then some basic types or variants of P systems (also named membrane systems) are presented. The state-of-the-art computability theory and a pioneering computational complexity theory are presented with P system frameworks and numerous solutions to hard computational problems (especially NP-complete problems) via P systems with membrane division are reported. Finally, a number of applications and open problems of P systems are briefly described.},
	keywords = {Computational Complexity, distributed systems, Membrane computing, Nature-inspired computing},
	issn = {0360-0300},
	doi = {10.1145/3431234},
	url = {https://doi.org/10.1145/3431234},
	author = {Bosheng Song and Kenli Li and David Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez and Ignacio P{\'e}rez-Hurtado}
}
@article {2469,
	title = {From NP-Completeness to DP-Completeness: A Membrane Computing Perspective},
	journal = {Complexity},
	volume = {2020},
	year = {2020},
	month = {2020},
	pages = {10},
	publisher = {Hindawi},
	doi = {10.1155/2020/6765097},
	url = {https://www.hindawi.com/journals/complexity/2020/6765097/},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2481,
	title = {Simulating Population Dynamics P systems with extra parallelism},
	journal = {International Conference on Membrane Computing (ICMC2020)},
	year = {2020},
	month = {09/2020},
	url = {http://2020.e-icmc.org/content/4/$\#$Full\%20Program},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Andr{\'e}s Doncel-Ram{\'\i}rez and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado}
}
@article {PAN2019,
	title = {Cell-like P systems with polarizations and minimal rules},
	journal = {Theoretical Computer Science},
	volume = {816},
	year = {2020},
	month = {05/2020},
	pages = {1-18},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {P systems with active membranes are a class of computation models in the area of membrane computing, which are inspired from the mechanism by which chemicals interact and cross cell membranes. In this work, we consider a normal form of P systems with active membranes, called cell-like P systems with polarizations and minimal rules, where rules are minimal in the sense that an object evolves to exactly one object with the application of an evolution rule or a communication rule, or an object evolves to two objects that are assigned to the two new generated membranes by applying a division rule. The present work investigates the computational power of P systems with polarizations and minimal rules. Specifically, results about Turing universality and non-universality are obtained with the combination of the number of membranes, the number of polarizations, and the types of rules. We also show that polarizationless P systems with minimal rules are equivalent to Turing machines working in a polynomial space, that is, the class of problems that can be solved in polynomial time by polarizationless P systems with minimal rules is equal to the class PSPACE.},
	keywords = {bio-inspired computing, Membrane computing, Minimal rule, Universality},
	issn = {0304-3975},
	doi = {https://doi.org/10.1016/j.tcs.2019.10.001},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397519306231},
	author = {Linqiang Pan and David Orellana-Mart{\'\i}n and Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {MARTINEZDELAMOR2020,
	title = {Adaptative parallel simulators for bioinspired computing models},
	journal = {Future Generation Computer Systems},
	volume = {107},
	year = {2020},
	pages = {469-484},
	abstract = {In the Membrane Computing area, P systems are unconventional devices of computation inspired by the structure and processes taking place in living cells. Main successful P system applications lie in computability and computational complexity theories, as well as in biological modelling. Given that models become too complex to deal with, simulators for P systems are essential tools and their efficiency is critical. In order to handle the diverse situations that may arise during the computation, these simulators have to take into account that worst-case scenarios can happen, even though they rarely occur. As a result, there is a significant loss of performance. In this paper, the concept of adaptative simulation for P systems is introduced to palliate this problem. This is achieved by passing high-level information provided directly by P system model designers to the simulator, helping it to better adapt to the target model. For this purpose, an existing simulator for an ecosystem modelling framework, named Population Dynamics P systems, is extended to include the information of modules, that are usually employed to define ecosystem models. Moreover, the standard description language for P systems, P-Lingua, has been re-engineered in its version 5. It now includes a new syntactical item, called feature, to express this kind of high-level semantic information. Experiments show that this simple adaptative simulator supporting modules as features doubles the performance when running on GPUs and on multicore processors.},
	keywords = {bio-inspired computing, GPU Computing, P systems, P-Lingua, parallel computing, Parallel simulators},
	issn = {0167-739X},
	doi = {https://doi.org/10.1016/j.future.2020.02.012},
	url = {http://www.sciencedirect.com/science/article/pii/S0167739X19308817},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2456,
	title = {Cell-like P systems with evolutional symport/antiport rules and membrane creation},
	journal = {Information and Computation},
	volume = {104542},
	year = {2020},
	doi = {10.1016/j.ic.2020.104542},
	author = {B. Song and K. Li and David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {PENG2020110,
	title = {Dendrite P systems},
	journal = {Neural Networks},
	volume = {127},
	year = {2020},
	pages = {110 - 120},
	abstract = {It was recently found that dendrites are not just a passive channel. They can perform mixed computation of analog and digital signals, and therefore can be abstracted as information processors. Moreover, dendrites possess a feedback mechanism. Motivated by these computational and feedback characteristics, this article proposes a new variant of neural-like P systems, dendrite P (DeP) systems, where neurons simulate the computational function of dendrites and perform a firing{\textendash}storing process instead of the storing{\textendash}firing process in spiking neural P (SNP) systems. Moreover, the behavior of the neurons is characterized by dendrite rules that are abstracted by two characteristics of dendrites. Different from the usual firing rules in SNP systems, the firing of a dendrite rule is controlled by the states of the corresponding source neurons. Therefore, DeP systems can provide a collaborative control capability for neurons. We discuss the computational power of DeP systems. In particular, it is proven that DeP systems are Turing-universal number generating/accepting devices. Moreover, we construct a small universal DeP system consisting of 115 neurons for computing functions.},
	keywords = {Computational power, Dendrite P systems, Neural-like P systems, P systems},
	issn = {0893-6080},
	doi = {https://doi.org/10.1016/j.neunet.2020.04.014},
	url = {http://www.sciencedirect.com/science/article/pii/S0893608020301349},
	author = {Hong Peng and Tingting Bao and Xiaohui Luo and Jun Wang and Xiaoxiao Song and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2482,
	title = {Extracting Parallelism in Simulation Algorithms for PDP systems},
	journal = {18th Brainstorming Week on Membrane Computing (BWMC2020)},
	year = {2020},
	pages = {79-90},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla},
	url = {http://www.gcn.us.es/files/18bwmc/079_mdcba.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Andr{\'e}s Doncel-Ram{\'\i}rez and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado}
}
@article {2365,
	title = {Membrane Creation in Polarizationless P Systems with Active Membranes},
	journal = {Fundamenta Informaticae},
	volume = {171},
	year = {2020},
	pages = {297-311},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	doi = {10.3233/FI-2020-1884},
	url = {https://content.iospress.com/articles/fundamenta-informaticae/fi1884},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2363,
	title = {A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning},
	journal = {Integrated Computer-Aided Engineering},
	volume = {27},
	year = {2020},
	pages = {121-138},
	abstract = {In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random Tree (RRT) algorithm and its asymptotically-optimal counterpart called RRT* are popular algorithms used in real-life applications due to its desirable properties. Such algorithms are inherently iterative, but certain modules such as the collision-checking procedure can be parallelized providing significant speedup with respect to sequential implementations. In this paper, the RRT and RRT* algorithms have been adapted to a bioinspired computational framework called Membrane Computing whose models of computation, a.k.a. P systems, run in a non-deterministic and massively parallel way. A large number of robotic applications are currently using a variant of P systems called Enzymatic Numerical P systems (ENPS) for reactive controlling, but there is a lack of solutions for motion planning in the framework. The novel models in this work have been designed using the ENPS framework. In order to test and validate the ENPS models for RRT and RRT*, we present two ad-hoc implementations able to emulate the computation of the models using OpenMP and CUDA. Finally, we show the speedup of our solutions with respect to sequential baseline implementations. The results show a speedup up to 6x using OpenMP with 8 cores against the sequential implementation and up to 24x using CUDA against the best multi-threading configuration.},
	keywords = {CUDA, Membrane computing, OpenMP, Optimal Motion Planning, Rapidly-exploring Random Tree},
	issn = {1069-2509},
	doi = {10.3233/ICA-190616},
	url = {https://doi.org/10.3233/ICA-190616},
	author = {Ignacio P{\'e}rez-Hurtado and Miguel A. Mart{\'\i}nez-del-Amor and G. Zhang and F. Neri and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {9138697,
	title = {Monodirectional Tissue P Systems With Promoters},
	journal = {IEEE Transactions on Cybernetics},
	volume = {In press},
	year = {2020},
	pages = {1-13},
	doi = {10.1109/TCYB.2020.3003060},
	author = {B. Song and X. Zeng and M. Jiang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2485,
	title = {Nonlinear Spiking Neural P Systems},
	journal = {International Journal of Neural Systems},
	volume = {30},
	year = {2020},
	pages = {2050008},
	doi = {10.1142/S0129065720500082},
	author = {Hong Peng and Zeqiong Lv and Bo Li and Xiaohui Luo and Jun Wang and Xiaoxiao Song and Tao Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {10.1145/3402456,
	title = {An Overview of Hardware Implementation of Membrane Computing Models},
	journal = {ACM Computing Surveys},
	volume = {53},
	number = {4},
	year = {2020},
	pages = {38},
	publisher = {Association for Computing Machinery},
	address = {New York, NY, USA},
	keywords = {compute unified device architecture (CUDA), field programmable gate array (FPGA), graphic processing unit (GPU), hardware implementation, Membrane computing, P systems},
	issn = {0360-0300},
	doi = {10.1145/3402456},
	url = {https://doi.org/10.1145/3402456},
	author = {Gexiang Zhang and Zeyi Shang and Sergey Verlan and Miguel {\'A}. Mart{\'\i}nez-del-Amor and Chengxun Yuan and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2189,
	title = {P systems with symport/antiport rules: When do the surroundings matter?},
	journal = {Theoretical Computer Science},
	volume = {805},
	year = {2020},
	pages = {206-217},
	doi = {https://doi.org/10.1016/j.tcs.2018.04.052},
	author = {David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera and Bosheng Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2473,
	title = {Seeking computational efficiency boundaries: the P{\u a}un{\textquoteright}s conjecture},
	journal = {Journal of Membrane Computing},
	volume = {2},
	year = {2020},
	pages = {323{\textendash}331},
	doi = {10.1007/s41965-020-00058-8},
	author = {David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2478,
	title = {Simulation challenges in membrane computing},
	journal = {Journal of Membrane Computing},
	volume = {2},
	year = {2020},
	pages = {392{\textendash}402},
	doi = {10.1007/s41965-020-00056-w},
	url = {https://link.springer.com/article/10.1007\%2Fs41965-020-00056-w},
	author = {Luis Valencia-Cabrera and Ignacio P{\'e}rez-Hurtado and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {PENG2020105064,
	title = {Spiking neural P systems with inhibitory rules},
	journal = {Knowledge-Based Systems},
	volume = {188},
	year = {2020},
	pages = {105064},
	abstract = {Motivated by the mechanism of inhibitory synapses, a new kind of spiking neural P (SNP) system rules, called inhibitory rules, is introduced in this paper. Based on this, a new variant of SNP systems is proposed, called spiking neural P systems with inhibitory rules (SNP-IR systems). Different from the usual firing rules in SNP systems, the firing condition of an inhibitory rule not only depends on the state of the neuron associated with the rule but also is related to the states of other neurons. Moreover, from the perspective of topological structure, the new variant is shown as a directed graph with inhibitory arcs, and therefore seems to have more powerful control. The computational completeness of SNP-IR systems is discussed. In particular, it is proved that SNP-IR systems are Turing universal number accepting/generating devices. Moreover, we obtain a small universal function-computing device for SNP-IR systems consisting of 100 neurons.},
	keywords = {Inhibitory synapse, Membrane computing, spiking neural P systems, Spiking neural P systems with inhibitory rules},
	issn = {0950-7051},
	doi = {https://doi.org/10.1016/j.knosys.2019.105064},
	url = {http://www.sciencedirect.com/science/article/pii/S0950705119304514},
	author = {Hong Peng and Bo Li and Jun Wang and Xiaoxiao Song and Tao Wang and Luis Valencia-Cabrera and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {WANG2020103680,
	title = {A weighted corrective fuzzy reasoning spiking neural P system for fault diagnosis in power systems with variable topologies},
	journal = {Engineering Applications of Artificial Intelligence},
	volume = {92},
	year = {2020},
	pages = {103680},
	abstract = {This paper focuses on power system fault diagnosis based on Weighted Corrective Fuzzy Reasoning Spiking Neural P Systems with real numbers (rWCFRSNPSs) to propose a graphic fault diagnosis method, called FD-WCFRSNPS. In the FD-WCFRSNPS, an rWCFRSNPS is proposed to model the logical relationships between faults and potential warning messages triggered by the corresponding protective devices. In addition, a matrix-based reasoning algorithm for the rWCFRSNPS is devised to reason about the fault alarm messages using parallel representations. Besides, a layered modeling method based on rWCFRSNPSs is developed to adapt to topological changes in power systems and a Temporal Order Information Processing Method based on Cause{\textendash}Effect Networks is designed to correct fault alarm messages before the fault reasoning. Finally, in a case study considering a local subsystem of a 220kV power system, the diagnosis results of five test cases prove that the proposed FD-WCFRSNPS is viable and effective.},
	keywords = {Cause{\textendash}effect network, Fault diagnosis, Fuzzy reasoning, Membrane computing, power system, Spiking neural P system},
	issn = {0952-1976},
	doi = {https://doi.org/10.1016/j.engappai.2020.103680},
	url = {http://www.sciencedirect.com/science/article/pii/S0952197620301172},
	author = {Tao Wang and Xiaoguang Wei and Jun Wang and Tao Huang and Hong Peng and Xiaoxiao Song and Luis Valencia Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2188,
	title = {When object production tunes the efficiency of membrane systems},
	journal = {Theoretical Computer Science},
	volume = {805},
	year = {2020},
	pages = {218-231},
	doi = {https://doi.org/10.1016/j.tcs.2018.04.013},
	author = {David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {Orellana-Mart{\'\i}n2019,
	title = {P systems with proteins: a new frontier when membrane division disappears},
	journal = {Journal of Membrane Computing},
	volume = {1},
	number = {1},
	year = {2019},
	month = {Mar},
	pages = {29{\textendash}39},
	issn = {2523-8914},
	doi = {10.1007/s41965-018-00003-w},
	url = {https://doi.org/10.1007/s41965-018-00003-w},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {Orellana-Mart{\'\i}n2019,
	title = {Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems},
	journal = {Journal of Membrane Computing},
	volume = {1},
	number = {2},
	year = {2019},
	month = {Jun},
	pages = {85{\textendash}92},
	abstract = {Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on both classical and newest results studying how cooperation among objects influences the ability of cell-like membrane systems to solve computationally hard problems in an efficient way. In this paper, two types of such membrane systems will be considered: (a) polarizationless P~systems with active membranes without dissolution rules when minimal cooperation is permitted in object evolution rules; and (b) cell-like P~systems with symport/antiport rules of minimal length. Specifically, assuming that P is not equal to NP, several frontiers of the efficiency are obtained in these two computing frameworks, in such manner that each borderline provides a tool to tackle the P versus NP problem.},
	issn = {2523-8914},
	doi = {10.1007/s41965-018-00004-9},
	url = {https://doi.org/10.1007/s41965-018-00004-9},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {P{\'e}rez-Hurtado2019,
	title = {P-Lingua in two steps: flexibility and efficiency},
	journal = {Journal of Membrane Computing},
	volume = {1},
	number = {2},
	year = {2019},
	month = {Jun},
	pages = {93{\textendash}102},
	issn = {2523-8914},
	doi = {10.1007/s41965-019-00014-1},
	url = {https://doi.org/10.1007/s41965-019-00014-1},
	author = {Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {article,
	title = {Cascading Failures Analysis Considering Extreme Virus Propagation of Cyber-Physical Systems in Smart Grids},
	journal = {Complexity},
	volume = {2019},
	year = {2019},
	month = {03},
	pages = {1-15},
	doi = {10.1155/2019/7428458},
	author = {Tao Wang and Xiaoguang Wei and Tao Huang and Jun Wang and Luis Valencia-Cabrera and Zhennan Fan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2215,
	title = {Dynamic threshold neural P systems},
	journal = {Knowledge-Based Systems},
	volume = {163},
	year = {2019},
	month = {01/2019},
	pages = {875-884},
	doi = {https://doi.org/10.1016/j.knosys.2018.10.016},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2348,
	title = { Computational complexity theory in Membrane Computing: Seventeen years after},
	journal = {20th International Conference on Membrane Computing, CMC20},
	year = {2019},
	pages = {191-206},
	isbn = {978-606-8493-76-3,},
	url = {http://www.cs.us.es/~marper/investigacion/computational-complexity.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2350,
	title = {11 years of P-Lingua: A backward glance},
	journal = {20th International Conference on Membrane Computing, CMC20},
	year = {2019},
	pages = {451-462},
	publisher = {Editura BIBLIOSTAR},
	isbn = {978-606-8493-76-3},
	url = {http://www.cs.us.es/~marper/investigacion/P-Lingua.pdf},
	author = {Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {8752207,
	title = {Adjacent Graph Based Vulnerability Assessment for Electrical Networks Considering Fault Adjacent Relationships Among Branches},
	journal = {IEEE Access},
	volume = {7},
	year = {2019},
	pages = {88927-88936},
	abstract = {Security issues related to vulnerability assessment in electrical networks are necessary for operators to identify the critical branches. At present, using complex network theory to assess the structural vulnerability of the electrical network is a popular method. However, the complex network theory cannot be comprehensively applicable to the operational vulnerability assessment of the electrical network because the network operation is closely dependent on the physical rules not only on the topological structure. To overcome the problem, an adjacent graph (AG) considering the topological, physical, and operational features of the electrical network is constructed to replace the original network. Through the AG, a branch importance index that considers both the importance of a branch and the fault adjacent relationships among branches is constructed to evaluate the electrical network vulnerability. The IEEE 118-bus system and the French grid are employed to validate the effectiveness of the proposed method.},
	keywords = {adjacent graph, branch importance index, complex network theory, Complex networks, electrical network, fault adjacent relationships, French grid, IEEE 118-bus system, Indexes, Load modeling, Loading, Measurement, network operation, network theory (graphs), power grids, power system faults, power system security, Transient analysis, Vulnerability},
	doi = {10.1109/ACCESS.2019.2926148},
	author = {T. Zang and J. Lei and X. Wei and T. Huang and T. Wang and Mario J. P{\'e}rez-Jim{\'e}nez and H. Lin}
}
@article {2354,
	title = {An apparently innocent problem in Membrane Computing},
	journal = {Seventeenth Brainstorming Week on Membrane Computing,},
	year = {2019},
	pages = {127-138},
	url = {http://www.cs.us.es/~marper/investigacion/apparently-innocent.pdf},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2351,
	title = {Dependency Graph Technique Revisited},
	journal = {20th International Conference on Membrane Computing, CMC20},
	year = {2019},
	pages = {513-522},
	publisher = {Editura BIBLIOSTAR},
	isbn = {978-606-8493-76-3},
	url = {http://www.cs.us.es/~marper/investigacion/dependency-graph.pdf},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {10.1007/978-3-030-12797-8_14,
	title = {Design of Specific P Systems Simulators on GPUs},
	journal = {Membrane Computing},
	volume = {11399},
	year = {2019},
	pages = {202{\textendash}207},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {In order to validate P system models and to assist on their formal verification, simulators are indispensable. Moreover, having efficient simulation tools is crucial, and for this purpose, parallel platforms should be employed. So far, several parallel simulators for P systems have been developed, specifically targeting GPUs (Graphics Processing Units). Although being a hot topic within Membrane Computing, mapping P system parallelism on GPUs is still not a mature area. In the past, we have successfully accelerated the simulation of two specific families of P systems solving SAT with GPUs, and learned in the process some semantics ingredients that fit well on these parallel devices. We are extending this exploration by designing an specific simulator of a P system model for the FACTORIZATION problem. In this paper, we analyse the two main approaches for simulators, and depict some design decisions required for this case study.},
	isbn = {978-3-030-12797-8},
	doi = {10.1007/978-3-030-12797-8_14},
	url = {https://doi.org/10.1007/978-3-030-12797-8_14},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Thomas Hinze and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron}
}
@article {2361,
	title = {A Fast Local Algorithm for Track Reconstruction on Parallel Architectures},
	journal = {2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
	year = {2019},
	isbn = {978-1-7281-3510-6},
	doi = {https://doi.org/10.1109/IPDPSW.2019.00118},
	author = {C{\'a}mpora P{\'e}rez, Daniel Hugo and Neufeld, Niko and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2458,
	title = {A Framework for Evolving Spiking Neural  Systems},
	journal = {The 8th Asian Conference on Membrane Computing (ACMC2019)},
	year = {2019},
	address = {Xiamen (China)},
	author = {L.J. Casauay and I.C. Macababayao and F.G. Cabarle and R.T. de la Cruz and H.N. Adorna and X. Zeng and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {2457,
	title = {A Framework for Evolving Spiking Neural P Systems with Rules on Synapses},
	journal = {The 8th Asian Conference on Membrane Computing (ACMC2019)},
	year = {2019},
	note = {Best paper award},
	address = {Xiamen (China)},
	author = {C.A. Moredo and R.C. Supelana and D.P. Cailipan and F.G. Cabarle and R.T. de la Cruz and H.N. Adorna and X. Zeng and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {Carandang2019HandlingNI,
	title = {Handling Non-determinism in Spiking Neural P Systems: Algorithms and Simulations},
	journal = {Fundamenta Informaticae},
	volume = {164},
	year = {2019},
	pages = {139-155},
	doi = {10.3233/fi-2019-1759},
	author = {Jym Paul Carandang and Francis George Cabarle and Henry N. Adorna and Nestine Hope S. Hernandez and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {Valencia-Cabrera2019,
	title = {An interactive timeline of simulators in membrane computing},
	journal = {Journal of Membrane Computing},
	volume = {1},
	number = {3},
	year = {2019},
	pages = {209{\textendash}222},
	issn = {2523-8914},
	doi = {10.1007/s41965-019-00016-z},
	url = {https://doi.org/10.1007/s41965-019-00016-z},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {WANG2019102,
	title = {Interval-valued fuzzy spiking neural P systems for fault diagnosis of power transmission networks},
	journal = {Engineering Applications of Artificial Intelligence},
	volume = {82},
	year = {2019},
	pages = {102 - 109},
	abstract = {It is a challenge problem how to deal with the uncertainty in fault diagnosis of power systems. To solve the challenge problem, this paper introduces an interval-valued fuzzy spiking neural P system (IVFSNP system), where the interval-valued fuzzy logic is integrated into spiking neural P systems to characterize the uncertainty. Based on the IVFSNP system, a fuzzy reasoning algorithm is presented, and the corresponding fault diagnosis model is developed. IVFSNP system is capable of describing the incomplete and uncertain fault signals from a supervisory control and data acquisition system equipped together with electric power systems. In order to evaluate the availability and effectiveness of the proposed fault diagnosis model, two case studies of fault diagnosis of a transmission network are discussed and analyzed, including complex and multiple fault situations with the incomplete and uncertain status signals. The results of the case studies demonstrate that IVFSNP system can be used to diagnose the faulty sections in power transmission networks accurately and effectively.},
	keywords = {Fault diagnosis, Fuzzy spiking neural P systems, Interval-valued fuzzy logic, Power transmission networks},
	issn = {0952-1976},
	doi = {https://doi.org/10.1016/j.engappai.2019.03.014},
	url = {http://www.sciencedirect.com/science/article/pii/S0952197619300648},
	author = {Jun Wang and Hong Peng and Wenping Yu and Jun Ming and Mario J. P{\'e}rez-Jim{\'e}nez and Chengyu Tao and Xiangnian Huang}
}
@article {8611442,
	title = {Modeling Fault Propagation Paths in Power Systems: A New Framework Based on Event SNP Systems With Neurotransmitter Concentration},
	journal = {IEEE Access},
	volume = {7},
	year = {2019},
	pages = {12798-12808},
	keywords = {Biocomputing, Computational modeling, Ev-SNP system, event SNP systems, ex-ante fault propagation path prediction, Fault diagnosis, fault propagation path, fault propagation relationship, inference mechanisms, large-scale power systems, large-scale systems, Membrane computing, modeling fault propagation paths, neural nets, neural P systems, Neurons, neurotransmitter concentration, Neurotransmitters, power engineering computing, power system, power system security, Power system stability, Probability, reduced order systems, reduction-SNP system, RSNP system, Spiking neural P system, synapses},
	doi = {10.1109/ACCESS.2019.2892797},
	author = {T. Wang and X. Wei and T. Huang and J. Wang and H. Peng and Mario J. P{\'e}rez-Jim{\'e}nez and Luis Valencia-Cabrera}
}
@article {2356,
	title = {New applications for an old tool},
	journal = {Seventeenth Brainstorming Week on Membrane Computing},
	year = {2019},
	pages = {165-170},
	url = {http://www.cs.us.es/~marper/investigacion/new-applications.pdf},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2353,
	title = {A new perspective on computational complexity theory in Membrane Computing},
	journal = {Seventeenth Brainstorming Week on Membrane Computing, },
	year = {2019},
	pages = {117-125},
	url = {http://www.cs.us.es/~marper/investigacion/new-perspectives.pdf},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2460,
	title = {Optimizations in CuSNP simulator for Spiking Neural P Systems on CUDA GPUs},
	journal = {2nd BICAS Special Session, 2019 High Performance Computing \& Simulation (HPCS 2019)},
	year = {2019},
	pages = {535-542},
	author = {B.C.D. Aboy and E.J.A. Bariring and J.P. Carandang and F.G.C. Cabarle and R.T. De La Cruz and H.N. Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {2352,
	title = {P Systems: From anti-matter to anti-rules},
	journal = {Seventeenth Brainstorming Week on Membrane Computing},
	year = {2019},
	pages = {41-58},
	url = {http://www.cs.us.es/~marper/investigacion/antimatter-antirules.pdf},
	author = {Artiom Alhazov and Rudolf Freund and Sergey Ivanov and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {ORELLANAMARTIN2019443,
	title = {A path to computational efficiency through membrane computing},
	journal = {Theoretical Computer Science},
	volume = {777},
	year = {2019},
	note = {In memory of Maurice Nivat, a founding father of Theoretical Computer Science - Part I},
	pages = {443 - 453},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	keywords = {Computational Complexity, Membrane computing, Membrane division, P system with symport/antiport},
	issn = {0304-3975},
	doi = {https://doi.org/10.1016/j.tcs.2018.12.024},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397519300027},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2342,
	title = {Preface. Bio-inspired Computing: Theories and Applications},
	journal = {Fundamenta Informaticae},
	volume = {164},
	year = {2019},
	pages = {i-ii},
	doi = {10.3233/FI-2019-1758},
	url = {https://doi.org/10.3233/FI-2019-1758},
	author = {Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez and Gexiang Zhang}
}
@article {doi:10.1142/9789813143180_0002,
	title = {Results on Computational Complexity in Bio-inspired Computing},
	journal = {Bio-Inspired Computing Models and Algorithms},
	year = {2019},
	pages = {33-73},
	chapter = {Chapter 2},
	abstract = {It is well known that the calculation speed of electronic processors has an upper bound which is clearly insufficient to efficiently solve instances whose size is relatively large associated with problems which model relevant real-life problems. In the last few decades, several computational paradigms inspired from nature have been developed with the aim of overcoming the barrier previously mentioned by using devices of the new computing models. For this purpose, the space{\textendash}time trade-off method is used to develop efficient solutions to computationally hard problems. According to this, implementation of such models (in biological or any other substrate different from the electronic one) would provide a significant advance in the practical resolution of many real-life problems. Membrane computing is a computational paradigm motivated by the structure and functioning of the living cells, as well as from the organization of cells in tissues, organs, and other higher order structures. In this chapter, a computational complexity theory within the framework of Membrane Computing is introduced and the most relevant results obtained so far are presented.},
	isbn = {978-981-3143-19-7},
	doi = {10.1142/9789813143180_0002},
	url = {https://www.worldscientific.com/doi/abs/10.1142/9789813143180_0002},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n}
}
@article {2349,
	title = {Solving problems through a single membrane system},
	journal = {20th International Conference on Membrane Computing, CMC20},
	year = {2019},
	pages = {439-450},
	publisher = {Editura BIBLIOSTAR},
	isbn = {978-606-8493-76-3},
	url = {http://www.cs.us.es/~marper/investigacion/single-membrane-systems.pdf},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {8718669,
	title = {Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division},
	journal = {IEEE Access},
	volume = {7},
	year = {2019},
	pages = {66055-66067},
	keywords = {0-1 knapsack problem, Approximation algorithms, Biocomputing, biological cell mechanism, Biological system modeling, Biomembranes, cell division, classic NP-hard problems, combinatorial optimization, Computational Complexity, computational efficiency, computational model, Computational modeling, distributed computing model, Heuristic algorithms, knapsack problems, Membrane computing, membrane simulator, parallel computing model, Parallel processing, Prediction algorithms, Tissue P System, UPSimulator},
	doi = {10.1109/ACCESS.2019.2917889},
	author = {L. Ye and J. Zheng and P. Guo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2459,
	title = {Solving the feasibility problem in robotic motion planning by means of Enzymatic Numerical P systems},
	journal = {The 8th Asian Conference on Membrane Computing (ACMC2019)},
	year = {2019},
	address = {Xiamen (China)},
	author = {Ignacio P{\'e}rez-Hurtado and Miguel A. Mart{\'\i}nez-del-Amor and G. Zhang and F. Neri and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {PENG2019105064,
	title = {Spiking neural P systems with inhibitory rules},
	journal = {Knowledge-Based Systems},
	year = {2019},
	pages = {105064},
	abstract = {Motivated by the mechanism of inhibitory synapses, a new kind of spiking neural P (SNP) system rules, called inhibitory rules, is introduced in this paper. Based on this, a new variant of SNP systems is proposed, called spiking neural P systems with inhibitory rules (SNP-IR systems). Different from the usual firing rules in SNP systems, the firing condition of an inhibitory rule not only depends on the state of the neuron associated with the rule but also is related to the states of other neurons. Moreover, from the perspective of topological structure, the new variant is shown as a directed graph with inhibitory arcs, and therefore seems to have more powerful control. The computational completeness of SNP-IR systems is discussed. In particular, it is proved that SNP-IR systems are Turing universal number accepting/generating devices. Moreover, we obtain a small universal function-computing device for SNP-IR systems consisting of 100 neurons.},
	keywords = {Inhibitory synapse, Membrane computing, spiking neural P systems, Spiking neural P systems with inhibitory rules},
	issn = {0950-7051},
	doi = {https://doi.org/10.1016/j.knosys.2019.105064},
	url = {http://www.sciencedirect.com/science/article/pii/S0950705119304514},
	author = {Hong Peng and Bo Li and Jun Wang and Xiaoxiao Song and Tao Wang and Luis Valencia-Cabrera and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2355,
	title = {A syntax for semantics in P-Lingua},
	journal = {Seventeenth Brainstorming Week on Membrane Computing},
	year = {2019},
	pages = {139-150},
	url = {http://www.cs.us.es/~marper/investigacion/semantics-P-Lingua.pdf},
	author = {Ignacio P{\'e}rez-Hurtado and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2475,
	title = {A Decade of Ecological Membrane Computing Applications},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {6},
	year = {2018},
	month = {12/2018},
	pages = {39-50},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BulletinDec2018.pdf},
	author = {Luis Valencia-Cabrera and Carmen Graciani and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2474,
	title = {A Semantic Frontier of the Efficiency in Membrane Systems},
	journal = {Asian Branch of International Conference on Membrane Computing},
	volume = {CDMTCS-530},
	year = {2018},
	month = {12/2018},
	pages = {180-190},
	publisher = {CDMTCS University of Auckland},
	address = {Auckland, New Zealand},
	url = {https://researchspace.auckland.ac.nz/bitstream/handle/2292/45075/530ACMC2018.pdf},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2211,
	title = {Design Patterns for Efficient Solutions to NP-Complete Problems in Membrane Computing},
	journal = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez on the Occasion of His 70th Birthday},
	year = {2018},
	month = {11/2018},
	pages = {237-255},
	publisher = {Springer International Publishing},
	doi = {https://doi.org/10.1007/978-3-030-00265-7_19},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and David Orellana-Mart{\'\i}n},
	editor = {Carmen Graciani and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Gheorghe P{\u a}un and Gregorz Rozenberg and Arto Salomaa}
}
@article {2210,
	title = {Membrane Computing as a Modelling Tool: Looking Back and Forward from Sevilla},
	journal = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez on the Occasion of His 70th Birthday},
	year = {2018},
	month = {11/2018},
	pages = {114-129},
	publisher = {Springer International Publishing},
	doi = {https://doi.org/10.1007/978-3-030-00265-7_10},
	author = {Manuel Garc{\'\i}a-Quismondo and Carmen Graciani and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Carmen Graciani and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Gheorghe P{\u a}un and Gregorz Rozenberg and Arto Salomaa}
}
@article {2212,
	title = {A Simulation Workflow for Membrane Computing: From MeCoSim to PMCGPU Through P-Lingua},
	journal = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez on the Occasion of His 70th Birthday},
	year = {2018},
	month = {11/2018},
	pages = {291-303},
	publisher = {Springer International Publishing},
	doi = {https://doi.org/10.1007/978-3-030-00265-7_23},
	author = {Luis Valencia-Cabrera and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado},
	editor = {Carmen Graciani and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Gheorghe P{\u a}un and Gregorz Rozenberg and Arto Salomaa}
}
@article {2185,
	title = {Laser Dynamics from a Membrane Computing Perspective},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {5},
	year = {2018},
	month = {06/2018},
	pages = {97-108},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullJune2018.pdf},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Jos{\'e} L. Guisado and Francisco Jim{\'e}nez-Morales and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2186,
	title = {Robot path planning using rapidly-exploring random trees: A membrane computing approach},
	journal = {7th International Conference on Computers Communications and Control (ICCCC2018)},
	year = {2018},
	month = {06/2018},
	publisher = {IEEE},
	isbn = {978-1-5386-1934-6},
	doi = {https://doi.org/10.1109/ICCCC.2018.8390434},
	url = {https://ieeexplore.ieee.org/document/8390434/},
	author = {Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Gexiang Zhang and David Orellana-Mart{\'\i}n}
}
@article {2191,
	title = {Towards a General Framework for Membrane Algorithms},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {5},
	year = {2018},
	month = {06/2018},
	pages = {91-96},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullJune2018.pdf},
	author = {Jose A. Andreu-Guzm{\'a}n and Luis Valencia-Cabrera}
}
@article {2180,
	title = {Preface},
	journal = {Theoretical Computer Science},
	volume = {724},
	year = {2018},
	month = {05/2017},
	pages = {1-2},
	publisher = {Elsevier},
	doi = {10.1016/j.tcs.2017.12.017},
	url = {https://doi.org/10.1016/j.tcs.2017.12.017},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {2178,
	title = {The computational complexity of tissue P systems with evolutional symport/antiport rules},
	journal = {Complexity},
	volume = {2018},
	year = {2018},
	month = {04/2018},
	publisher = {Hindawi},
	doi = {https://doi.org/10.1155/2018/3745210},
	author = {Linqiang Pan and Bosheng Song and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2110,
	title = {Modeling Population Dynamics of Roseate Terns (Sterna dougallii) in the Northwest Atlantic Ocean},
	journal = {Ecological Modelling},
	volume = {368},
	year = {2018},
	month = {01/2018},
	pages = {298-311},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {The endangered population of roseate terns (Sterna dougallii) in the Northwestern Atlantic Ocean consists of a network of large and small breeding colonies on islands. This type of fragmented population poses an exceptional opportunity to investigate dispersal, a mechanism that is fundamental in population dynamics and is crucial to understand the spatio-temporal and genetic structure of animal populations. Dispersal is difficult to study because it requires concurrent data compilation at multiple sites. Models of population dynamics in birds that focus on dispersal and include a large number of breeding sites are rare in literature. In this work, we propose a stochastic simulation model that captures the dispersal dynamics of this population of roseate terns. The colonization and decolonization (abandonment) of breeding colonies are modeled as discrete events that follow different dynamics than dispersal. We show that our model reproduces the properties of this population that have been observed in field data. We also analyzed the sensitivity of our model to alterations in different variables, and study the impact of these alterations in the model dynamics. Our results suggest that large colony population size exhibits a threshold sensitivity to adult survival, and that regional persistence is maintained by the larger populations.
},
	keywords = {Islands, Metapopulation, Population persistence, Roseate terns, Source-sink},
	issn = {0304-3800},
	doi = {10.1016/j.ecolmodel.2017.12.007},
	url = {http://www.sciencedirect.com/science/article/pii/S0304380017304945},
	author = {Manuel Garc{\'\i}a-Quismondo and Nisbet, Ian C T and Mostello, Carolyn S and J. Michael Reed}
}
@article {2217,
	title = { Narrowing frontiers with evolutional communication rules and cell separation},
	journal = {Sixteenth Brainstorming Week on Membrane Computing (BWMC2018)},
	year = {2018},
	pages = {139-161},
	url = {http://www.gcn.us.es/16bwmc_proceedings},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Bosheng Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2214,
	title = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez on the Occasion of His 70th Birthday},
	year = {2018},
	pages = {x+331},
	publisher = {Springer},
	isbn = {978-3-030-00265-7},
	doi = {https://doi.org/10.1007/978-3-030-00265-7},
	url = {https://link.springer.com/book/10.1007/978-3-030-00265-7},
	editor = {Carmen Graciani and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa}
}
@proceedings {2184,
	title = {The factorization problem: A new approach through membrane systems},
	journal = {Workshop on Membrane Computing, satellite workshop of 17th International Conference on Unconventional Computation and Natural Computation (UCNC 2018)},
	year = {2018},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2179,
	title = {Fault diagnosis of power systems using intuitionistic fuzzy spiking neural P systems},
	journal = {IEEE Transactions on Smart Grid},
	year = {2018},
	author = {Hong Peng and Jun Wang and Jun Ming and Peng Shi and Mario J. P{\'e}rez-Jim{\'e}nez and Wenping Yu and Chengyu Tao}
}
@article {2177,
	title = {From distribution to replication in cooperative systems with active membranes: A frontier of the efficiency},
	journal = {Theoretical Computer Science},
	volume = {736},
	year = {2018},
	pages = {15-24},
	doi = {10.1016/j.tcs.2017.12.012},
	url = {https://doi.org/10.1016/j.tcs.2017.12.012},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2213,
	title = {A Kernel-Based Membrane Clustering Algorithm},
	journal = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez on the Occasion of His 70th Birthday},
	year = {2018},
	pages = {318-329},
	doi = {https://doi.org/10.1007/978-3-030-00265-7_25},
	author = {Jinyu Yang and Ru Chen and Guozhou Zhang and Hong Peng and Jun Wang and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2216,
	title = {Limits on P systems with proteins and without division},
	journal = {Sixteenth Brainstorming Week on Membrane Computing (BWMC2018)},
	year = {2018},
	pages = {123-138},
	url = {http://www.gcn.us.es/16bwmc_proceedings},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2195,
	title = {On GPU-Oriented P systems},
	journal = {High Performance Computing \& Simulation 2018},
	year = {2018},
	pages = {780-781},
	chapter = {Special Session on Biologically Inspired Parallel and Distributed Computing, Algorithms and Solutions (BICAS 2018)},
	doi = { 10.1109/HPCS.2018.00125},
	url = {https://ieeexplore.ieee.org/document/8514430},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2190,
	title = {P systems based computing polynomials with integer coefficients: Design and formal verification},
	journal = {IEEE Transactions on NanoBioscience},
	year = {2018},
	url = {https://ieeexplore.ieee.org/document/8360137/},
	author = {Ming Zhu and Gexiang Zhang and Qiang Yang and Haina Rong and Weitao Yuan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2192,
	title = {A path to computational efficiency through membrane computing},
	journal = {Theoretical Computer Science},
	year = {2018},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2187,
	title = {The role of integral membrane proteins in computational complexity theory},
	journal = {International Journal of Advances in Engineering Sciences and Applied Mathematics},
	volume = {10},
	year = {2018},
	pages = {193{\textendash}202},
	doi = {10.1007/s12572-018-0220-2},
	author = {David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2196,
	title = {Simulation of Computing P Systems: A GPU Design for the Factorization Problem},
	journal = {19th International Conference on Membrane Computing},
	year = {2018},
	pages = {239-242},
	address = {Dresden, Germany},
	isbn = {978-3-96409-030-0},
	url = {http://www.book-on-demand.de/shop/15551},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2193,
	title = {The unique satisfiability problem from a membrane computing perspective},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {21},
	year = {2018},
	pages = {288-297},
	url = {http://www.romjist.ro/abstract-601.html},
	author = {David Orellana-Mart{\'\i}n and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2108,
	title = {Cooperative P Systems and the P versus NP Problem},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {4},
	year = {2017},
	month = {12/2017},
	pages = {39-64},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullDec2017.pdf},
	author = {Luis Valencia-Cabrera and Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2109,
	title = {From Super-cells to Robotic Swarms: Two Decades of Evolution in the Simulation of P Systems},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {4},
	year = {2017},
	month = {12/2017},
	pages = {65-88},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullDec2017.pdf},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2172,
	title = {Fault diagnosis for multi-energy flows of energy internet: Framework and prospect},
	journal = {2017 IEEE Conference on Energy Internet and Energy System Integration (EI2)},
	year = {2017},
	month = {11/2017},
	pages = {1-5},
	publisher = {IEEE, Inc.},
	isbn = {978-1-5386-1428-0},
	doi = {10.1109/EI2.2017.8245494},
	author = {Tao Wang and Jun Wang and Zhennan Fan and Xiaoguang Wei and Tianlei Zang and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Huang}
}
@article {2081,
	title = {Evolutionary response of a native butterfly to concurrent plant invasions: simulation of population dynamics},
	journal = {Ecological Modelling},
	volume = {360},
	year = {2017},
	month = {09/2017},
	pages = {410-424},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {The habitat of the green-veined white butterfly Pieris oleracea in eastern North America has undergone invasions by the exotic plant garlic mustard (Alliaria petiolata), which is replacing native hosts of P. oleracea such as Cardamine diphylla. A. petiolata was originally lethal to most larvae of the native butterfly but during the past 20+ years it has been incorporated successfully into the larval diet, likely through evolutionary change. The region was also invaded by another exotic plant, Cardamine pratensis, on which the native butterfly larvae readily develops, allowing the possibility
of population rescue. Further complicating the butterfly{\textquoteright}s reproductive dynamics, it is multigenerational within a summer, and host plant availability and location change during the summer. Our goal is to model the expected dynamics of the native butterfly population in this evolving, dynamic landscape by using a new bio-inspired paradigm known as Membrane Computing. In this context, a Probabilistic Guarded Scripted P system has been designed to model and explore the conditions under which an allele conferring ability of P. oleracea larvae to develop on A. petiolata might have proliferated. The design describes a population dynamics model whose parameter values are derived from experimental and observational data. Our modeling framework is spatially explicit and our model integrates seasonal as well as annual dynamics. The simulation results from our model qualitatively match our field observations and experimental laboratory results, and agree with the results from a previous model on the genotypic adaptation of this butterfly species. From the simulations we identified the likely trajectories for the spatio-temporal distribution of alleles enabling P. oleracea to use the invasive plant species across this selective and phenological mosaic.},
	keywords = {Invasive species, Membrane computing, Pieris oleracea, Population Dynamics, Probabilistic Guarded Scripted P system},
	issn = {0304-3800},
	doi = {10.1016/j.ecolmodel.2017.06.030},
	author = {Manuel Garc{\'\i}a-Quismondo and J. Michael Reed and Frances S. Chew and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2174,
	title = {Generation of rapidly-exploring random tree by using a new class of membrane systems},
	journal = {Asian Conference on Membrane Computing (ACMC 2017)},
	year = {2017},
	month = {09/2017},
	pages = {534-546},
	author = {Ignacio P{\'e}rez-Hurtado}
}
@proceedings {2173,
	title = {P systems based computing polynomials with integer coefficients: Design and formal verification},
	journal = {Asian Conference on Membrane Computing (ACMC 2017)},
	year = {2017},
	month = {09/2017},
	pages = {416-443},
	author = {Gexiang Zhang and M. Zhu and Q. Yang and Haina Rong and Weitao Yuan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2107,
	title = {A Survey of Parallel Simulation of P Systems with GPUs},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {3},
	year = {2017},
	month = {06/2017},
	pages = {55-67},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullIMCSJune2017.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2086,
	title = {Proceedings of the Fifteenth Week on Membrane Computing},
	journal = {Fifteenth Brainstorming Week on Membrane Computing},
	year = {2017},
	month = {06/10/2017},
	pages = {x+292},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	url = {http://www.gcn.us.es/files/15bwmc_volume.pdf},
	author = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {1952,
	title = {Modeling regenerative processes with Membrane Computing},
	journal = {Information Sciences},
	volume = {381},
	year = {2017},
	month = {03/2017},
	pages = {229{\textendash}249},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	keywords = {bioinformatics, Membrane computing, modeling, P systems, Planarian, Regeneration},
	issn = {0020-0255},
	doi = {10.1016/j.ins.2016.11.017},
	url = {http://www.sciencedirect.com/science/article/pii/S0020025516318187},
	author = {Manuel Garc{\'\i}a-Quismondo and Michael Levin and Daniel Lobo-Fern{\'a}ndez}
}
@article {2075,
	title = {Computational efficiency of minimal cooperation and distribution in polarizationless P systems with active membranes},
	journal = {Fundamenta Informaticae},
	volume = {153},
	year = {2017},
	pages = {147{\textendash}172},
	doi = {10.3233/FI-2017-1535},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2080,
	title = {Cooperation in Transport of Chemical Substances: A Complexity Approach within Membrane Computing},
	journal = {Fundamenta Informaticae},
	volume = {154},
	year = {2017},
	pages = {373-385},
	doi = {10.3233/FI-2017-1572},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2175,
	title = {Counting Membrane Systems},
	journal = {Eighteenth International Conference on Membrane Computing (CMC18)},
	year = {2017},
	pages = {359-372},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2078,
	title = {CuSNP: Spiking Neural P Systems Simulators in CUDA},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {20},
	year = {2017},
	pages = {57-70},
	url = {http://www.imt.ro/romjist/Volum20/Number20_1/cuprins20_1.htm},
	author = {J.P. Carandang and J.M.B. Villaflores and Francis G. C. Cabarle and Henry N. Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {2103,
	title = {An efficient time-free solution to QSAT problem using P systems with proteins on membranes},
	journal = {Information and Computation},
	volume = {2560},
	year = {2017},
	pages = {287-299},
	doi = {http://dx.doi.org/10.1016/j.ic.2017.06.005},
	author = {Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan}
}
@article {2102,
	title = {Fault diagnosis of power systems using fuzzy tissue-like P systems},
	journal = {Integrated Computer-Aided Engineering},
	volume = { vol. 24, no. 4},
	year = {2017},
	pages = {401-411},
	doi = {http://dx.doi.org/10.3233/ICA-170552},
	author = {Hong Peng and Jun Wang and Peng Shi and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2076,
	title = {Fuzzy Reasoning Spiking Neural P systems revisited: A formalization},
	journal = {Theoretical Computer Science},
	volume = {701},
	year = {2017},
	pages = {216-225},
	doi = {http://dx.doi.org/10.1016/j.tcs.2017.04.014},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Carmen Graciani and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Luis Valencia-Cabrera}
}
@article {2088,
	title = {Limits on Efficient Computation in P Systems with Symport/Antiport},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	pages = {147-160},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Luis F. Mac{\'\i}as-Ramos and Bosheng Song and Tao Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2091,
	title = {Membrane Computing Applications in Computational Economics},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	pages = {189-214},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Eduardo S{\'a}nchez-Karhunen and Luis Valencia-Cabrera}
}
@article {2104,
	title = {Multiobjective fuzzy clustering approach based on tissue-like membrane systems},
	journal = {Knowledge-Based Systems},
	volume = {125},
	year = {2017},
	pages = {74-82},
	doi = {https://doi.org/10.1016/j.knosys.2017.03.024},
	author = {Hong Peng and Peng Shi and Jun Wang and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2197,
	title = {Nondeterminism in Spiking Neural P Systems: Algorithms and Simulations},
	journal = {The 6th Asian Conference on Membrane Computing},
	year = {2017},
	address = {Chengdu (China)},
	url = {http://2017.asiancmc.org/?page_id=58},
	author = {J.P. Carandang and Francis G. C. Cabarle and Henry N. Adorna and Nestine H. Hernandez and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {2087,
	title = {On Efficiency of P Systems with Symport/Antiport and Membrane Division},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	pages = {129-146},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Luis F. Mac{\'\i}as-Ramos and Bosheng Song and Tao Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2198,
	title = {An Overview of Hardware Implementations of P Systems},
	journal = {The 6th Asian Conference on Membrane Computing},
	year = {2017},
	address = {Chengdu (China)},
	url = {http://2017.asiancmc.org/?page_id=88},
	author = {Zeyi Shang and Sergey Verlan and Gexiang Zhang and Miguel A. Mart{\'\i}nez-del-Amor and Luis Valencia-Cabrera}
}
@article {2090,
	title = {P Systems with Active Cells},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	pages = {175-189},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {David Orellana-Mart{\'\i}n}
}
@article {2077,
	title = {Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation},
	journal = {Theoretical Computer Science},
	volume = {701},
	year = {2017},
	pages = {226-234},
	doi = {http://dx.doi.org/10.1016/j.tcs.2017.04.015},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2092,
	title = {Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Inwards},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2093,
	title = {Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Outwards},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2105,
	title = {A simulation software tool for cell-like spiking neural P systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {vol. 20, no. 1},
	year = {2017},
	pages = {71-84},
	url = {http://www.imt.ro/romjist/},
	author = {Luis Valencia-Cabrera and Tingfang Wu and Zhiqiang Zhang and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2089,
	title = {Sparse-matrix Representation of Spiking Neural P Systems for GPU},
	journal = {Fifteenth Brainstorming Week on Membrane Computing (BWMC2017)},
	year = {2017},
	pages = {161-170},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/15bwmc_proceedings},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and David Orellana-Mart{\'\i}n and Francis G. C. Cabarle and Mario J. P{\'e}rez-Jim{\'e}nez and Henry N. Adorna}
}
@article {2106,
	title = {Complexity Perspectives on Minimal Cooperation in Cell-like Membrane Systems},
	journal = {Bulletin of the International Membrane Computing Society},
	volume = {2},
	year = {2016},
	month = {12/2016},
	pages = {69-78},
	url = {http://membranecomputing.net/IMCSBulletin/pdf/BullDec2016.pdf},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1943,
	title = {Parallel simulation of Population Dynamics P systems: updates and roadmap},
	journal = {Natural Computing},
	volume = {15},
	year = {2016},
	month = {07/2016},
	pages = {565-573},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	issn = {1567-7818},
	doi = {10.1007/s11047-016-9566-1},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1940,
	title = {Sequential spiking neural P systems with structural plasticity based on max/min spike number},
	journal = {Neural Computing and Applications},
	volume = {27},
	year = {2016},
	month = {06/2016},
	pages = {1337-1347},
	publisher = {Springer},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P systems (in short, SNP systems) are parallel, distributed, and nondeterministic computing devices inspired by biological spiking neurons. Recently, a class of SNP systems known as SNP systems with structural plasticity (in short, SNPSP systems) was introduced. SNPSP systems represent a class of SNP systems that have dynamism applied to the synapses, i.e. neurons can use plasticity rules to create or remove synapses. In this work, we impose the restriction of sequentiality on SNPSP systems, using four modes: max, min, max-pseudo-, and min-pseudo-sequentiality. We also impose a normal form for SNPSP systems as number acceptors and generators. Conditions for (non)universality are then provided. Specifically, acceptors are universal in all modes, while generators need a nondeterminism source in two modes, which in this work is provided by the plasticity rules.},
	keywords = {Membrane computing, Sequential systems, spiking neural P systems, Structural plasticity, turing universality},
	issn = {0941-0643},
	doi = {10.1007/s00521-015-1937-5},
	url = {http://link.springer.com/article/10.1007/s00521-015-1937-5},
	author = {Francis G. C. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2072,
	title = {Proceedings of the Fourteenth Brainstorming Week on Membrane Computing},
	journal = {Fourteenth Brainstorming Week on Membrane Computing},
	year = {2016},
	month = {05/11/2016},
	pages = {xi+362},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-946316-1-0},
	url = {http://www.gcn.us.es/files/14bwmc_volume.pdf},
	author = {Carmen Graciani-D{\'\i}az and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Luis Valencia-Cabrera}
}
@article {1941,
	title = {Computing with viruses},
	journal = {Theoretical Computer Science},
	volume = {623},
	year = {2016},
	month = {04/2016},
	pages = {146-159},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {In recent years, different computing models have emerged within the area of Unconventional Computation, and more specifically within Natural Computing, getting inspiration from mechanisms present in Nature. In this work, we incorporate concepts in virology and theoretical computer science to propose a novel computational model, called Virus Machine. Inspired by the manner in which viruses transmit from one host to another, a virus machine is a computational paradigm represented as a heterogeneous network that consists of three subnetworks: virus transmission, instruction transfer, and instruction-channel control networks. Virus machines provide non-deterministic sequential devices. As number computing devices, virus machines are proved to be computationally complete, that is, equivalent in power to Turing machines. Nevertheless, when some limitations are imposed with respect to the number of viruses present in the system, then a characterization for semi-linear sets is obtained.},
	keywords = {Natural computing, register machine, Turing completeness, Virus machine},
	issn = {0304-3975},
	doi = {doi: 10.1016/j.tcs.2015.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397515011457},
	author = {Xu Chen and Mario J. P{\'e}rez-Jim{\'e}nez and Luis Valencia-Cabrera and Beizhan Wang and XiangXiang Zeng}
}
@article {1936,
	title = {An efficient time-free solution to SAT problem by P systems with proteins on membranes},
	journal = {Journal of Computer and System Sciences},
	volume = {82},
	year = {2016},
	month = {04/2016},
	pages = {1090-1099},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {P systems with proteins on membranes are a class of bio-inspired computing models, where the execution of each rule completes in exactly one time unit. However, in living cells, the execution time of biochemical reactions is difficult to know precisely because of various uncontrollable factors. In this work, we present a time-free uniform solution to SAT problem by P systems with proteins on membranes in the sense that the correctness of the solution is irrelevant to the times associated with the involved rules, and the P systems are constructed from the sizes of instances.},
	keywords = {P system; Membrane protein; Time-free uniform solution; SAT},
	issn = {0022-0000},
	doi = {doi:10.1016/j.jcss.2016.03.008},
	url = {http://www.sciencedirect.com/science/article/pii/S0022000016300113},
	author = {Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan}
}
@article {1933,
	title = {A Fault Diagnosis Method of Power Systems Based on an Improved Adaptive Fuzzy Spiking Neural P Systems and PSO Algorithms},
	journal = {Signal Processing},
	volume = {25},
	year = {2016},
	month = {03/2016},
	pages = {320-327},
	publisher = {Chinese Institute of Electronics},
	address = {Beijing, China},
	abstract = {Download: PDF (1027 KB)   HTML (1 KB)  
Export: BibTeX | EndNote (RIS)      
Abstract  
A new fault diagnosis method based on improved Adaptive fuzzy spiking neural P systems (in short, AFSN P systems) and Particle swarm optimization (PSO) algorithm is presented to improve the efficiency and accuracy of diagnosis for power systems in this paper. AFSN P systems are a novel kind of computing models with parallel computing and learning ability. Based on our previous works, this paper focuses on AFSN P systems inference algorithms and learning algorithms and builds the fault diagnosis model using improved AFSN P systems for diagnosing effectively. The process of diagnosis based on AFSN P systems is expressed by matrix successfully to improve the rate of diagnosis eminently. Furthermore, particle swarm optimization algorithm is introduced into the learning algorithm of AFSN P systems, thus the convergence speed of diagnosis has a big progress. An example of 4-node system is given to verify the effectiveness of this method. Compared with the existing methods, this method has faster diagnosis speed, higher accuracy and strong ability to adapt to the grid topology changes.},
	keywords = {AFSN P systems, Fault diagnosis, Member Computing, Particle swarm optimization algorithm, Power systems},
	issn = {1022-4653},
	doi = {10.1049/cje.2016.03.019},
	url = {http://www.ejournal.org.cn/Jweb_cje/EN/abstract/abstract9370.shtml},
	author = {Jun Wang and Hong Peng and Min Tu and Mario J. P{\'e}rez-Jim{\'e}nez and Peng Shi}
}
@article {1934,
	title = {Tissue P Systems with Protein on Cells},
	journal = {Fundamenta Informaticae},
	volume = {144},
	year = {2016},
	month = {03/2016},
	pages = {77-107},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {Tissue P systems are a class of distributed parallel computing devices inspired by biochemical interactions between cells in a tissue-like arrangement, where objects can be exchanged by means of communication channels. In this work, inspired by the biological facts that the movement of most objects through communication channels is controlled by proteins and proteins can move through lipid bilayers between cells (if these cells are fused), we present a new class of variant tissue P systems, called tissue P systems with protein on cells, where multisets of objects (maybe empty), together with proteins between cells are exchanged. The computational power of such P systems is studied. Specifically, an efficient (uniform) solution to the SAT problem by using such P systems with cell division is presented. We also prove that any Turing computable set of numbers can be generated by a tissue P system with protein on cells. Both of these two results are obtained by such P systems with communication rules of length at most 4 (the length of a communication rule is the total number of objects and proteins involved in that rule).},
	keywords = {bio-inspired computing, cell division, Cell protein, Membrane computing, Tissue P System, Universality},
	issn = {0169-2968},
	doi = {0.3233/FI-2016-1324},
	url = {http://content.iospress.com/articles/fundamenta-informaticae/fi1324},
	author = {Bosheng Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1932,
	title = {An extended membrane system with active membranes to solve automatic fuzzy clustering problems},
	journal = {International Journal of Neural Systems},
	year = {2016},
	month = {01/2016},
	pages = {1-11},
	publisher = {World Scientific},
	address = {Singapore, Singapore},
	abstract = {This paper focuses on automatic fuzzy clustering problem and proposes a novel automatic fuzzy clustering method that employs an extended membrane system with active membranes that has been designed as its computing framework. The extended membrane system has a dynamic membrane structure; since membranes can evolve, it is particularly suitable for processing the automatic fuzzy clustering problem. A modification of a differential evolution (DE) mechanism was developed as evolution rules for objects according to membrane structure and object communication mechanisms. Under the control of both the object{\textquoteright}s evolution-communication mechanism and the membrane evolution mechanism, the extended membrane system can effectively determine the most appropriate number of clusters as well as the corresponding optimal cluster centers. The proposed method was evaluated over 13 benchmark problems and was compared with four state-of-the-art automatic clustering methods, two recently developed clustering methods and six classification techniques. The comparison results demonstrate the superiority of the proposed method in terms of effectiveness and robustness.},
	keywords = {Data clustering; automatic fuzzy clustering problem; membrane computing; membrane systems with active membranes},
	issn = {0129-0657},
	doi = {10.1142/S0129065716500040},
	url = {http://www.worldscientific.com/doi/10.1142/S0129065716500040},
	author = {Hong Peng and Jun Wang and Peng Shi and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1944,
	title = {Borderlines of efficiency: what{\textquoteright}s up?},
	journal = {17th International Conference on Membrane Computing (CMC17)},
	year = {2016},
	pages = {11-12},
	url = {http://cmc17.disco.unimib.it/media/Proceedings\%20CMC17.pdf},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {2070,
	title = {CuSNP: Spiking Neural P Systems Simulators in CUDA},
	journal = {Asian Conference on Membrane Computing 2016},
	year = {2016},
	url = {http://2016.asiancmc.org/},
	author = {Jym P. Carandang and John M. B. Villaflores and Francis G. C. Cabarle and Henry N. Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {1948,
	title = {Improving simulations of Spiking Neural P Systems in NVIDIA CUDA GPUs: CuSNP},
	journal = {Fourteenth Brainstorming Week on Membrane Computing (BWMC2016)},
	year = {2016},
	pages = {135-150},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/14bwmc_proceedings},
	author = {Jym P. Carandang and John M. B. Villaflores and Francis G. C. Cabarle and Henry N. Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {1947,
	title = {Minimal cooperation in polarizationless P systems with active membranes},
	journal = {Fourteenth Brainstorming Week on Membrane Computing (BWMC2016)},
	year = {2016},
	pages = {327-356},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/14bwmc_proceedings},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2112,
	title = {Notes on spiking neural P systems and finite automata},
	journal = {Natural Computing},
	volume = {15},
	year = {2016},
	pages = {533-539},
	doi = {10.1007/s11047-016-9563-4},
	url = {http://link.springer.com/article/10.1007/s11047-016-9563-4},
	author = {Francis G. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2111,
	title = {P systems based computing polynomials: design and formal verification},
	journal = {Natural Computing},
	volume = {15},
	year = {2016},
	pages = {591{\textendash}596},
	doi = {https://doi.org/10.1007/s11047-016-9577-y},
	url = {https://link.springer.com/article/10.1007\%2Fs11047-016-9577-y},
	author = {Weitao Yuan and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Wang and Zhiwei Huang}
}
@article {1950,
	title = {Polarizationless P Systems with Active Membranes: Computational Complexity Aspects},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {21},
	year = {2016},
	pages = {107{\textendash}123},
	issn = {1430-189X},
	author = {Luis Valencia-Cabrera and David Orellana-Mart{\'\i}n and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1951,
	title = {Preface},
	journal = {Natural Computing},
	volume = {15},
	year = {2016},
	pages = {519-520},
	issn = {1572-9796},
	doi = {10.1007/s11047-016-9568-z},
	url = {http://link.springer.com/article/10.1007/s11047-016-9568-z/fulltext.html},
	author = {Marian Gheorghe and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1945,
	title = {Stern-Gerlach Experiment},
	journal = {Fourteenth Brainstorming Week on Membrane Computing (BWMC2016)},
	year = {2016},
	pages = {101-112},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/14bwmc_proceedings},
	author = {Mar{\'\i}a Arazo-S{\'a}nchez and Marc Barroso-Mancha and {\'O}scar De-la-Torre-P{\'e}rez and Laura Moreno-Valero and Ariadna Ribes-Metidieri and Patricia Ribes-Metidieri and Ana Ventura-Barroso and David Orellana-Mart{\'\i}n}
}
@article {1946,
	title = {Uranium-238 decay chain},
	journal = {Fourteenth Brainstorming Week on Membrane Computing (BWMC2016)},
	year = {2016},
	pages = {113-130},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/14bwmc_proceedings},
	author = {Mar{\'\i}a Arazo-S{\'a}nchez and Marc Barroso-Mancha and {\'O}scar De-la-Torre-P{\'e}rez and Laura Moreno-Valero and Ariadna Ribes-Metidieri and Patricia Ribes-Metidieri and Ana Ventura-Barroso and David Orellana-Mart{\'\i}n}
}
@article {1907,
	title = {An automatic clustering algorithm inspired by membrane computing},
	journal = {Pattern Recognition Letters},
	volume = {68},
	year = {2015},
	month = {12/2015},
	pages = {34-40},
	publisher = {Elsevier},
	address = {Philadelphia, USA},
	issn = {0167-8655},
	doi = {10.1016/j.patrec.2015.08.008},
	author = {Hong Peng and Jun Wang and Peng Shi and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1916,
	title = {Computing partial recursive functions by Virus Machines},
	journal = {Lecture Notes in Computer Science},
	volume = {9504},
	year = {2015},
	month = {12/2015},
	pages = {353-368 },
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Virus Machines are a computational paradigm inspired by the manner in which viruses replicate and transmit from one host cell to another. This paradigm provides non-deterministic sequential devices. Non-restricted Virus Machines are unbounded Virus Machines, in the sense that no restriction on the number of hosts, the number of instructions and the number of viruses contained in any host along any computation is placed on them. The computational completeness of these machines has been obtained by simulating register machines. In this paper, Virus Machines as function computing devices are considered. Then, the universality of non-restricted virus machines is proved by showing that they can compute all partial recursive functions.},
	issn = {0302-9743},
	url = {http://link.springer.com/chapter/10.1007\%2F978-3-319-28475-0_24},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1917,
	title = {Simulating FRSN P systems with real numbers in P-Lingua on sequential and CUDA platforms},
	journal = {Lecture Notes in Computer Science},
	volume = {9504},
	year = {2015},
	month = {12/2015},
	pages = {227-241},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	issn = {0302-9743},
	url = {http://http//dx.doi.org/10.1007/978-3-319-28475-0_18},
	author = {Luis F. Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1930,
	title = {Computational efficiency and universality of timed P systems with membrane creation},
	journal = {Soft Computing},
	volume = {19},
	year = {2015},
	month = {11/2015},
	pages = {3043-3053},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	abstract = {P systems are a class of distributed parallel computing models inspired by the structure and the functioning of a living cell, where the execution of each rule is completed in exactly one time unit (a global clock is assumed). However, in living cells, the execution time of different biological processes is difficult to know precisely and very sensitive to environmental factors that might be hard to control. Inspired from this biological motivation, in this work, timed polarization P systems with membrane creation are introduced and their computational efficiency and universality are investigated. Specifically, we give a time-free semi-uniform solution to the SAT problem by a family of P systems with membrane creation in the sense that the correctness of the solution is irrelevant to the times associated with the involved rules. We also prove that time-free P systems with membrane creation are computationally universal.},
	keywords = {Membrane creation, P system, SAT problem, Time-free solution, Universality},
	issn = {1432-7643},
	doi = {10.1007/s00500-015-1732-3},
	url = {http://link.springer.com/article/10.1007\%2Fs00500-015-1732-3},
	author = {Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan}
}
@article {1921,
	title = {P systems based computing polynomials: Design and formal verification},
	journal = {Asian Conference on Membrane Computing (ACMC 2015)},
	volume = {1},
	year = {2015},
	month = {11/2015},
	pages = {1-9},
	abstract = {Automatic design of P systems is an attractive research topic
in the community of membrane computing. Differing from the previous
work that used evolutionary algorithms to fulfill the task, this paper
presents the design of a simple (deterministic transition) P system
(without input membrane) of degree 1, capturing the value of the korder
(k >= 2) polynomial by using a reasoning method. Specifically, the
values of polynomial p(n) corresponding to a natural number t is equal
to the multiplicity of a distinguished object of the system (the output
object) in the configuration at instant t. We also discuss the descriptive
computational resources required by the designed k-order polynomial P
system},
	keywords = {automatic design, Membrane computing, P system, polynomial},
	url = {http://www.cs.us.es/~marper/investigacion/P\%20system\%20solving\%20polynomial\%20problem.pdf},
	author = {Weitao Yuan and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Wang and Zhiwei Huan}
}
@article {1920,
	title = {Temporal Fuzzy Reasoning Spiking Neural P Systems with Real Numbers for Power System Fault Diagnosis},
	journal = {Proceedings of the Asian Conference on Membrane Computing (ACMC 2015)},
	volume = {8},
	year = {2015},
	month = {11/2015},
	pages = {1-20},
	url = {http://www.cs.us.es/~marper/investigacion/rTFRSNP.pdf},
	author = {Kang Huang and Tao Wang and Yangyang He and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1925,
	title = {Spiking neural P systems with structural plasticity},
	journal = {Neural Computing and Applications},
	volume = {26},
	year = {2015},
	month = {11},
	pages = {1905-1917},
	publisher = {Springer},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P (SNP) systems are a class of parallel, distributed, and nondeterministic computing models inspired by the spiking of biological neurons. In this work, the biological feature known as structural plasticity is introduced in the framework of SNP systems. Structural plasticity refers to synapse creation and deletion, thus changing the synapse graph. The {\textquotedblleft}programming{\textquotedblright} therefore of a brain-like model, the SNP system with structural plasticity (SNPSP system), is based on how neurons connect to each other. SNPSP systems are also a partial answer to an open question on SNP systems with dynamism only for synapses. For both the accepting and generative modes, we prove that SNPSP systems are universal. Modifying SNPSP systems semantics, we introduce the spike saving mode and prove that universality is maintained. In saving mode, however, a deadlock state can arise, and we prove that reaching such a state is undecidable. Lastly, we provide one technique in order to use structural plasticity to solve a hard problem: a constant time, nondeterministic, and semi-uniform solution to the NP-complete problem Subset Sum.},
	keywords = {computational universality, Deadlock, Membrane computing, spiking neural P systems, Structural plasticity, Subset Sum, Undecidability},
	issn = {0941-0643},
	doi = {doi: 10.1007/s00521-015-1857-4},
	url = {http://link.springer.com/article/10.1007\%2Fs00521-015-1857-4},
	author = {Francis G. C. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Song}
}
@article {1918,
	title = {Decision Tree Models Induced by Membrane Systems},
	journal = {Workshop on Membrane Computing 2015 (WMC2015), Satellite workshop of UCNC2015},
	year = {2015},
	month = {09/2015},
	pages = {107-116},
	publisher = {Centre for Discrete Mathematics and Theoretical Computer Science},
	address = {Auckland, New Zealand},
	url = {http://www.cs.us.es/~marper/investigacion/Proceedings-WMC2015.pdf},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Jian Xiao and Guixiang Zhang}
}
@article {1919,
	title = {Fault Section Estimation of Power Systems with Optimization Spiking Neural P Systems},
	journal = {Workshop on Membrane Computing 2015 (WMC2015), Satellite workshop of UCNC2015},
	year = {2015},
	month = {08/2015},
	pages = {117-127},
	publisher = {Centre for Discrete Mathematics and Theoretical Computer Science},
	address = {Auckland, New Zealand},
	url = {http://www.cs.us.es/~marper/investigacion/Proceedings-WMC2015.pdf},
	author = {Tao Wang and Sikui Zeng and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez and Jun Wang}
}
@article {1922,
	title = {Asynchronous Spiking neural P systems with structural plasticity},
	journal = {Lecture Notes in Computer Science},
	volume = {9252},
	year = {2015},
	month = {07/2015},
	pages = {132-143},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	issn = {0302-9743},
	url = {http://dx.doi.org/10.1007/978-3-319-21819-9_9},
	author = {Francis G. C. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1915,
	title = {Basic virus machines},
	journal = {16th International Conference on Membrane Computing (CMC16)},
	year = {2015},
	month = {07/2015},
	pages = {323-342},
	publisher = {Universitat Politecnica de Valencia},
	address = {Valencia, Spain},
	url = {http://users.dsic.upv.es/workshops/cmc16/program.html},
	author = {Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez and Xu Chen and Beizhan Wang and XiangXiang Zeng}
}
@article {1910,
	title = {Weighted Fuzzy Reasoning Spiking Neural P Systems: Application to Fault Diagnosis in  Traction Power Supply Systems of High-Speed Railways},
	journal = {Journal of Computational and Theoretical Nanoscience},
	volume = {12},
	year = {2015},
	month = {07/2015},
	pages = {1003-1114},
	publisher = {American Scientific Publishers},
	address = {Valencia, CA, USA},
	abstract = {This paper discusses the application of weighted fuzzy reasoning spiking neural P systems (WFRSN P systems) to fault diagnosis in traction power supply systems (TPSSs) of China high-speed railways. Four types of neurons are considered in WFRSN P systems to make them suitable for expressing status information of protective relays and circuit breakers, and a weighted matrix-based reasoning algorithm (WMBRA) is introduced to fulfill the reasoning based on the status information to obtain fault confidence levels of faulty sections. Fault diagnosis production rules in TPSSs and their WFRSN P system models are proposed to show how to use WFRSN P systems to describe different kinds of fault information. Building processes of fault diagnosis models for sections and fault region identification of feeding sections, and parameter setting of the models are described in detail. Case studies including normal power supply and over zone feeding show the effectiveness of the presented method.},
	keywords = {AUTOTRANSFORMER FEEDING; FAULT DIAGNOSIS; HIGH-SPEED RAILWAY; TRACTION POWER SUPPLY SYSTEM; WEIGHTED FUZZY REASONING SPIKING NEURAL P SYSTEM},
	issn = {1546-1955},
	doi = {10.1166/jctn.2015.3857},
	url = {http://www.ingentaconnect.com/content/asp/jctn/2015/00000012/00000007/art00002?token=004e1c2e6e76bf6220bc437a63736a6f5e4763213b763c2553747b6f642f46426b3d6567c345de},
	author = {Tao Wang and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez and Jixiang Cheng}
}
@article {1931,
	title = {Sequential spiking neural P systems with structural plasticity based on max/min spike number},
	journal = {Neural Computing and Applications},
	year = {2015},
	month = {06/2015},
	pages = {1-11},
	publisher = {Springer},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P systems (in short, SNP systems) are parallel, distributed, and nondeterministic computing devices inspired by biological spiking neurons. Recently, a class of SNP systems known as SNP systems with structural plasticity (in short, SNPSP systems) was introduced. SNPSP systems represent a class of SNP systems that have dynamism applied to the synapses, i.e. neurons can use plasticity rules to create or remove synapses. In this work, we impose the restriction of sequentiality on SNPSP systems, using four modes: max, min, max-pseudo-, and min-pseudo-sequentiality. We also impose a normal form for SNPSP systems as number acceptors and generators. Conditions for (non)universality are then provided. Specifically, acceptors are universal in all modes, while generators need a nondeterminism source in two modes, which in this work is provided by the plasticity rules},
	keywords = {Membrane computing, Sequential systems, spiking neural P systems, Structural plasticity, turing universality},
	issn = {0941-0643},
	doi = {10.1007/s00521-015-1937-5},
	url = {http://link.springer.com/article/10.1007/s00521-015-1937-5},
	author = {Francis G. C. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1811,
	title = {An unsupervised learning algorithm for membrane computing},
	journal = {Information Sciences},
	volume = {304},
	year = {2015},
	month = {05/2015},
	pages = {80{\textendash}91},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	keywords = {Data clustering, Evolution{\textendash}communication P system, Fuzzy clustering, Membrane computing, P system, Unsupervised learning},
	issn = {0020-0255},
	doi = {10.1016/j.ins.2015.01.019},
	url = {http://www.sciencedirect.com/science/article/pii/S0020025515000572},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1929,
	title = {Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division},
	journal = {Biosystems},
	volume = {130},
	year = {2015},
	month = {04/2015},
	pages = {51-58},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {P systems are computing models inspired by some basic features of biological membranes. In this work, membrane division, which provides a way to obtain an exponential workspace in linear time, is introduced into (cell-like) P systems with communication (symport/antiport) rules, where objects are never modified but they just change their places. The computational efficiency of this kind of P systems is studied. Specifically, we present a (uniform) linear time solution to the NP-complete problem, Subset Sum by using division rules for elementary membranes and communication rules of length at most 3. We further prove that such P system allowing division rules for non-elementary membranes can efficiently solve the PSPACE-complete problem, QSAT in a uniform way.},
	keywords = {Cell-like P system; Symport/Antiport rule; Membrane division; Subset Sum problem; QSAT problem},
	issn = {0303-2647},
	doi = {10.1016/j.biosystems.2015.03.002},
	url = {http://www.sciencedirect.com/science/article/pii/S0303264715000350},
	author = {Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan}
}
@article {1776,
	title = {Fault diagnosis of electric power systems based on fuzzy reasoning spiking neural P systems},
	journal = {IEEE Transactions on Power Systems},
	volume = {30},
	year = {2015},
	month = {04/2015},
	pages = {1182-1194},
	publisher = {IEEE Press.},
	address = {Athens, Greece},
	abstract = {This paper proposes a graphic modeling approach, fault diagnosis method based on fuzzy reasoning spiking neural P systems (FDSNP), for power transmission networks. In FDSNP, fuzzy reasoning spiking neural P systems (FRSN P systems) with trapezoidal fuzzy numbers are used to model candidate faulty sections and an algebraic fuzzy reasoning algorithm is introduced to obtain confidence levels of candidate faulty sections, so as to identify faulty sections. FDSNP offers an intuitive illustration based on a strictly mathematical expression, a good fault-tolerant capacity due to its handling of incomplete and uncertain messages in a parallel manner, a good description for the relationships between protective devices and faults, and an understandable diagnosis model-building process. To test the validity and feasibility of FDSNP, seven cases of a local subsystem in an electrical power system are used. The results of case studies show that FDSNP is effective in diagnosing faults in power transmission networks for single and multiple fault situations with/without incomplete and uncertain SCADA data, and is superior to four methods, reported in the literature, in terms of the correctness of diagnosis results.

Published in:},
	issn = {0885-8950 },
	doi = {10.1109/TPWRS.2014.2347699},
	url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6887379},
	author = {Tao Wang and Gexiang Zhang and Junbo Zhao and Zhengyou He and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1898,
	title = {Membrane fission: A computational complexity perspective},
	journal = {Complexity},
	year = {2015},
	month = {04/2015},
	publisher = {John Wiley \& Sons, Inc.},
	address = {Hoboken, NJ},
	keywords = {Bioinspired computing, Membrane computing, membrane fission, tractability border},
	issn = {1099-0526},
	doi = {10.1002/cplx.21691},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/cplx.21691/abstract},
	author = {Luis F. Mac{\'\i}as-Ramos and Bosheng Song and Luis Valencia-Cabrera and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1897,
	title = {A P{\textendash}Lingua Based Simulator for P Systems with Symport/Antiport Rules},
	journal = {Fundamenta Informaticae},
	volume = {139},
	year = {2015},
	month = {04/2015},
	pages = {211-277},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	keywords = {bio-inspired computing, MeCoSim, Membrane computing, P system, P-Lingua},
	issn = {0169-2968},
	author = {Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and Bosheng Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1812,
	title = { Optimal multi-level thresholding with membrane computing},
	journal = {Digital Signal Processing},
	volume = {37},
	year = {2015},
	month = {02/2015},
	pages = {53{\textendash}64},
	publisher = {Elsevier},
	keywords = {Cell-like P systems, Histogram, Image segmentation, Membrane computing, Multi-level thresholding},
	issn = {1051-2004},
	doi = {10.1016/j.dsp.2014.10.006},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1911,
	title = {Computational efficiency of P systems with symport/antiport rules and membrane separation},
	journal = {Thirteenth Brainstorming Week on Membrane Computing},
	volume = {1},
	year = {2015},
	month = {02/2015},
	pages = {325-370},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Spiking neural P systems (SN P systems) have been well established as a novel class of distributed parallel computing models. Some features that SN P systems possess are attractive to fault diagnosis. However, handling fuzzy diagnosis knowledge and reasoning is required for many fault diagnosis applications. The lack of ability is a major problem of existing SN P systems when applying them to the fault diagnosis domain. Thus, we extend SN P systems by introducing some new ingredients (such as three types of neurons, fuzzy logic and new firing mechanism) and propose the fuzzy reasoning spiking neural P systems (FRSN P systems). The FRSN P systems are particularly suitable to model fuzzy production rules in a fuzzy diagnosis knowledge base and their reasoning process. Moreover, a parallel fuzzy reasoning algorithm based on FRSN P systems is developed according to neuron{\textquoteright}s dynamic firing mechanism. Besides, a practical example of transformer fault diagnosis is used to demonstrate the feasibility and effectiveness of the proposed FRSN P systems in fault diagnosis problem.},
	url = {http://www.cs.us.es/~marper/investigacion/proceedings-13th-BWMC.pdf},
	author = {Luis Valencia-Cabrera and Bosheng Song and Luis F. Mac{\'\i}as-Ramos and Linqiang Pan and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1814,
	title = {Extending Simulation of Asynchronous Spiking Neural P Systems in P{\textendash}Lingua},
	journal = {Fundamenta Informaticae},
	volume = {136},
	year = {2015},
	month = {02/2015},
	pages = {253-267},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	keywords = {Asynchronous mode, Membrane computing, P-Lingua, Spiking neural P system},
	issn = {0169-2968},
	doi = {10.3233/FI-2015-1156},
	url = {http://iospress.metapress.com/content/0677n447256h78x2/},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Song and Linqiang Pan}
}
@article {1912,
	title = {Minimal cooperation in P systems with symport/antiport: A complexity approach},
	journal = {Thirteenth Brainstorming Week on Membrane Computing},
	year = {2015},
	month = {02/2015},
	pages = {301-323},
	publisher = {F{\'e}nix Editora},
	edition = {1},
	address = {Sevilla, Espa{\~n}a},
	url = {http://www.cs.us.es/~marper/investigacion/proceedings-13th-BWMC.pdf},
	author = {Luis Valencia-Cabrera and Bosheng Song and Luis F. Mac{\'\i}as-Ramos and Linqiang Pan and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1914,
	title = {Notes on Spiking Neural P systems and finite automata},
	journal = {Thirteenth Brainstorming Week on Membrane Computing},
	year = {2015},
	month = {02/2015},
	pages = {77-89},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Spiking neural P systems (in short, SNP systems) are membrane computing
models inspired by the pulse coding of information in biological neurons. SNP systems
with standard rules have neurons that emit at most one spike (the pulse) each step, and
have either an input or output neuron connected to the environment. SNP transducers
were introduced, where both input and output neurons were used. More recently, SNP
modules were introduced which generalize SNP transducers: extended rules are used
(more than one spike can be emitted each step) and a set of input and output neurons can
be used. In this work we continue relating SNP modules and finite automata: (i) we amend
previous constructions for DFA and DFST simulations, (ii) improve the construction
from three neurons down to one neuron, (iii) DFA with output are simulated, and (iv)
we generate automatic sequences using results from (iii).},
	keywords = {Automatic sequences, finite automata, Membrane computing, spiking neural P systems},
	url = {http://www.cs.us.es/~marper/investigacion/proceedings-13th-BWMC.pdf},
	author = {Francis G. C. Cabarle and Henry N. Adorna and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1913,
	title = {Parallel simulation of PDP systems: Update and roadmap},
	journal = {Thirteenth Brainstorming Week on Membrane Computing},
	year = {2015},
	month = {02/2015},
	pages = {227-243},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {PDP systems are a type of multienvironment P systems, which serve as a
formal modeling framework for Population Dynamics. The accurate simulation of these
probabilistic models entails large run times. Hence, parallel platforms such as GPUs has
been employed to speedup the simulation. In 2012 [14], the first GPU simulator of PDP
systems was presented. In this paper, we present current updates made on this simulator,
and future developments to consider.
},
	url = {http://www.cs.us.es/~marper/investigacion/proceedings-13th-BWMC.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1923,
	title = {Preface},
	journal = {Fundamenta Informaticae},
	volume = {136},
	year = {2015},
	month = {02/2015},
	pages = {i-i},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	doi = {10.3233/FI-2015-1150},
	url = {http://iospress.metapress.com/content/a40x9752555rn8t3/},
	author = {Linqiang Pan and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1813,
	title = {Simulating P Systems on GPU Devices: A Survey},
	journal = {Fundamenta Informaticae},
	volume = {136},
	year = {2015},
	month = {02/2015},
	pages = {269-284},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	keywords = {CUDA, GPU Computing, Membrane computing, P systems, parallel computing},
	issn = {0169-2968},
	doi = {10.3233/FI-2015-1157},
	url = {http://iospress.metapress.com/content/101684hh3785365u/},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {2073,
	title = {Proceedings of the Thirteenth Brainstorming Week on Membrane Computing},
	journal = {Thirteenth Brainstorming Week on Membrane Computing},
	year = {2015},
	month = {02/11/2015},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-94366-2-8},
	url = {http://www.gcn.us.es/files/13bwmc_volume_fixed_0.pdf},
	author = {Luis F. Mac{\'\i}as-Ramos and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {2074,
	title = {Decision tree models induced by membrane systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {18},
	year = {2015},
	month = {01/2015},
	pages = {228{\textendash}239},
	url = {http://www.imt.ro/romjist/Volum18/Number18_3/abstracts.htm$\#$a3},
	author = {Jun Wang and Juan Hu and Hong Peng and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1928,
	title = {Fuzzy Membrane Computing: Theory and Applications},
	journal = {International Journal of Computers, Communications and Control},
	volume = {10},
	year = {2015},
	pages = {904-935},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {Fuzzy membrane computing is a newly developed and promising research direction in the area of membrane computing that aims at exploring the complex in- teraction between membrane computing and fuzzy theory. This paper provides a comprehensive survey of theoretical developments and various applications of fuzzy membrane computing, and sketches future research lines. The theoretical develop- ments are reviewed from the aspects of uncertainty processing in P systems, fuzzifica- tion of P systems and fuzzy knowledge representation and reasoning. The applications of fuzzy membrane computing are mainly focused on fuzzy knowledge representation and fault diagnosis. An overview of different types of fuzzy P systems, differences between spiking neural P systems and fuzzy reasoning spiking neural P systems and newly obtained results on these P systems are presented.},
	keywords = {fuzzy membrane computing, fuzzy reasoning spiking neural P systems, fuzzy set, linguistic term, Membrane computing, multi-fuzzy set, trapezoidal fuzzy number},
	issn = {1841-9836},
	doi = {doi: 10.15837/ijccc.2015.6.2080},
	url = {http://univagora.ro/jour/index.php/ijccc/article/view/2080},
	author = {Tao Wang and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1924,
	title = {Membrane clustering algorithm with hybrid evolutionary mechanisms},
	journal = {Journal of Software},
	volume = {26},
	year = {2015},
	pages = {1001-1012},
	publisher = {Journal of Software},
	address = {San Bernardino, CA, USA},
	issn = {1796-217X},
	author = {Hong Peng and Yang Jiang and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1900,
	title = {Membrane fission versus cell division: when membrane proliferation is not enough},
	journal = {Theoretical Computer Science},
	volume = {608},
	year = {2015},
	pages = {57{\textendash}65},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2015.06.025},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {1939,
	title = {A New Strategy to Improve the Performance of PDP-Systems Simulator},
	journal = {Lecture Notes in Computer Science},
	volume = {9504},
	year = {2015},
	pages = {171-184},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	isbn = {978-3-319-28474-3},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-28475-0_12},
	url = {http://dx.doi.org/10.1007/978-3-319-28475-0_12},
	author = {Carmen Graciani and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1926,
	title = {An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separatio},
	journal = {Fundamenta Informaticae},
	volume = {138},
	year = {2015},
	pages = {45-60},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {A membrane system (P system) is a distributed computing model inspired by information processes in living cells. P systems previously provided new characterizations of a variety of complexity classes and their borderlines. Specifically, in tissue-like membrane systems, cell separation rules have been considered joint with communication rules of the form symport/antiport. On the one hand, only tractable problems can be efficiently solved by using cell separation and communication rules with length at most 2. On the other hand, an efficient and uniform solution to the SAT problem by using cell separation and communication rules with length at most 8 has been recently given. In this paper we improve the previous result by showing that the SAT problem can be solved by a family of tissue P systems with cell separation in linear time, by using communication rules with length at most 3. Thus, in the framework of tissue P systems with cell separation, we provide an optimal tractability borderline: passing from length 2 to 3 amounts to passing from non{\textendash}efficiency to efficiency, assuming that P /= NP.},
	keywords = {Cell separation, Computational Complexity, Membrane computing, SAT problem, Tissue P Systems},
	issn = {0169-2968},
	doi = {10.3233/FI-2015-1197},
	url = {http://dx.doi.org/10.3233/FI-2015-1197},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Petr Sos{\'\i}k}
}
@article {1927,
	title = {A Special Issue on Bio-Inspired Computing: Theories and Applications},
	journal = {Journal of Computational and Theoretical Nanoscience},
	volume = {12},
	year = {2015},
	pages = {1101-1102},
	publisher = {American Scientific Publishers},
	address = {Valencia, CA, USA},
	issn = {1546-1955},
	doi = {10.1166/jctn.2015.3856},
	url = {http://www.ingentaconnect.com/content/asp/jctn/2015/00000012/00000007/art00001?token=0058172d752d5c8437a63736a6f5e4763213b662a77703a566f644a467c79675d7c4e724770051f3bc97bca5},
	author = {Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Song}
}
@article {2071,
	title = {Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem},
	journal = {Lecture Notes in Computer Science},
	volume = {9504},
	year = {2015},
	pages = {106-116},
	publisher = {Springer},
	isbn = {978-3-319-28474-3},
	doi = {10.1007/978-3-319-28475-0_8},
	url = {http://dx.doi.org/10.1007/978-3-319-28475-0_8},
	author = {Francis G. C. Cabarle and Nestine H. S. Hernandez and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {1808,
	title = {Application of a computational model for complex fluvial ecosystems: The population dynamics of zebra mussel Dreissena polymorpha as a case study},
	journal = {Ecological Complexity},
	volume = {20},
	year = {2014},
	month = {12/2014},
	pages = {116-126},
	issn = {1476-945X},
	doi = {http://dx.doi.org/10.1016/j.ecocom.2014.09.006},
	url = {http://www.sciencedirect.com/science/article/pii/S1476945X14000981},
	author = {Colomer, A. M. and Margalida, A. and Luis Valencia-Cabrera and Palau, A.}
}
@article {994,
	title = {Applications of Membrane Computing in Systems and Synthetic Biology},
	journal = {Emergence, Complexity and Computation},
	volume = {7},
	year = {2014},
	month = {12/2013},
	pages = {266},
	publisher = {Springer Verlag},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane Computing was introduced as a computational paradigm in Natural Computing. The models introduced, called Membrane (or P) Systems, provide a coherent platform to describe and study living cells as computational systems. Membrane Systems have been investigated for their computational aspects and employed to model problems in other fields, like: Computer Science, Linguistics, Biology, Economy, Computer Graphics, Robotics, etc. Their inherent parallelism, heterogeneity and intrinsic versatility allow them to model a broad range of processes and phenomena, being also an efficient means to solve and analyze problems in a novel way.

Membrane Computing has been used to model biological systems, becoming with time a thorough modeling paradigm comparable, in its modeling and predicting capabilities, to more established models in this area. This book is the result of the need to collect, in an organic way, different facets of this paradigm.

The chapters of this book, together with the web pages accompanying them, present different applications of Membrane Systems to Biology. Deterministic, non-deterministic and stochastic systems paired with different algorithms and methodologies show the full potential of this framework. 

The book is addressed to researchers interested in applications of discrete biological models and the interplay between Membrane Systems and other approaches to analyze complex systems.

 },
	keywords = {Complex Systems - Membrane Computing - Membrane Systems - Natural Computing - Systems and Synthetic Biology},
	isbn = {978-3-319-03191-0},
	url = {http://www.springer.com/engineering/computational+intelligence+and+complexity/book/978-3-319-03190-3},
	author = {Pierluigi Frisco and Marian Gheorghe and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@inbook {995,
	title = {Membrane System-Based Models for Specifying Dynamical Population Systems},
	booktitle = {Applications of Membrane Computing in Systems and Synthetic Biology},
	series = {Emergence, Complexity and Computation},
	volume = {7},
	year = {2014},
	month = {12/2013},
	pages = {97-132},
	publisher = {Springer Verlag},
	organization = {Springer Verlag},
	chapter = {4},
	address = {Amsterdam, the Netherlands},
	abstract = {Population Dynamics P systems (PDP systems, in short) provide a new
formal bio-inspired modelling framework, which has been successfully used for
modelling population dynamics on real ecosystems. The semantics of these systems
is captured by the Direct distribution based on Consistent Blocks Algorithm (DCBA),
which has been engineered into software simulation tools. In particular,MeCoSim
(Membrane Computing Simulator) is a GUI developed in the framework ofP-Lingua
that can be used as a simulation environment for running virtual experiments. The
parameters of each scenario to be simulated can be easily adjusted in a visual way,
as well as the settings for the desired output format, thus facilitating the validation},
	url = {http://www.springer.com/engineering/computational+intelligence+and+complexity/book/978-3-319-03190-3},
	author = {M. Angels Colomer and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@proceedings {1778,
	title = {Proceedings of the Twelfth Brainstorming Week on Membrane Computing},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	month = {08/2014},
	pages = {X+352},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Luis F. Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {1797,
	title = {Accelerated Simulation of P Systems on the GPU: A Survey},
	journal = {9th International Conference on Bio-Inspired Computing: Theories and Applications},
	volume = {472},
	year = {2014},
	pages = {308-312},
	publisher = {Springer},
	address = {Berl{\'\i}n, Alemania},
	isbn = {978-3-662-45048-2},
	issn = {1865-0929},
	doi = {10.1007/978-3-662-45049-9_50},
	url = {http://link.springer.com/chapter/10.1007\%2F978-3-662-45049-9_50},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1781,
	title = {Antimatter as a Frontier of Tractability in Membrane Computing},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {155-168},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Daniel D{\'\i}az-Pernil and Francisco Pe{\~n}a-Cantillana and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {1775,
	title = {Application of fuzzy reasoning spiking neural P systems to fault diagnosis},
	journal = {International Journal of Computers, Communications and Control},
	volume = {9},
	year = {2014},
	pages = {720-733},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	issn = {1841-9836},
	author = {Tao Wang and Gexiang Zhang and Haina Rong and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1787,
	title = {Application of Weighted Fuzzy Reasoning Spiking Neural P Systems to Fault Diagnosis in Traction Power Supply Systems of High-speed Railways},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {329-350},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Tao Wang and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1773,
	title = {Automatic Design of Deterministic and Non-Halting Membrane Systems by Tuning Syntactical Ingredients},
	journal = {IEEE Transactions on NanoBioscience},
	year = {2014},
	issn = {1536-1241},
	doi = {10.1109/TNB.2014.2341618},
	author = {Gexiang Zhang and Haina Rong and Zhu Ou and Mario J. P{\'e}rez-Jim{\'e}nez and Marian Gheorghe}
}
@article {1788,
	title = {A bioinspired computing approach to model complex systems. Invited talk},
	journal = {15th Conference on Membrane Computing, pre-proceedings},
	year = {2014},
	note = {Invited talk},
	pages = {11-14},
	address = {Opava, Czech Republic},
	isbn = {978-80-7510-036-8},
	url = {http://cmc15.slu.cz/wp-content/uploads/2014/01/cmc15_proceedings.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1772,
	title = {Evolutionary membrane computing: a comprehensive survey and new results},
	journal = {Information Sciences},
	volume = {279},
	year = {2014},
	pages = {528{\textendash}551},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0020-0255},
	doi = {10.1016/j.ins.2014.04.007},
	author = {Gexiang Zhang and Marian Gheorghe and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1784,
	title = {Extending SNP Systems Asynchronous Simulation Modes in P-Lingua},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {261-280},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Luis F. Mac{\'\i}as-Ramos and Tao Song and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1792,
	title = {Fault Diagnosis Models for Electric Locomotive Systems Based on Fuzzy Reasoning Spiking Neural P Systems},
	journal = {15th Conference on Membrane Computing, pre-proceedings},
	year = {2014},
	pages = {361-374},
	address = {Opava, Czech Republic},
	isbn = {978-80-7510-036-8},
	url = {http://cmc15.slu.cz/wp-content/uploads/2014/01/cmc15_proceedings.pdf},
	author = {Tao Wang and Gexiang Zhang and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1762,
	title = {The framework of P systems applied to solve optimal watermarking problem},
	journal = {Signal Processing},
	volume = {101},
	year = {2014},
	pages = {256-265},
	publisher = {Elsevier},
	keywords = {Image watermarking, Membrane computing, Optimal watermarking problem, P systems},
	issn = {0165-1684},
	doi = {10.1016/j.sigpro.2014.02.020},
	url = {http://dx.doi.org/10.1016/j.sigpro.2014.02.020},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@inbook {1777,
	title = {Infobiotics Workbench: A P Systems Based Tool for Systems and Synthetic Biology},
	booktitle = {Applications of Membrane Computing in Systems and Synthetic Biology},
	volume = {7},
	year = {2014},
	pages = {1-42},
	publisher = {Springer Verlag},
	organization = {Springer Verlag},
	chapter = {1},
	address = {Amsterdam, the Netherlands},
	url = {http://www.springer.com/engineering/computational+intelligence+and+complexity/book/978-3-319-03190-3},
	author = {Johnathan Blakes and Jamie Twycross and Savas Konur and Francisco J. Romero-Campero and Natalio Krasnogor and Marian Gheorghe}
}
@article {1786,
	title = {Membrane Clustering: A Novel Clustering Algorithm under Membrane Computing},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {311-328},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Hong Peng and J. Zhang and J. Wang and T. Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {1771,
	title = {An optimization spiking neural P system for approximately solving combinatorial optimization problems},
	journal = {International Journal of Neural Systems},
	volume = {24},
	year = {2014},
	pages = {1-16},
	publisher = {World Scientific},
	address = {Singapore, Singapore},
	issn = {0129-0657},
	doi = {10.1142/S0129065714400061},
	author = {Gexiang Zhang and Haina Rong and Ferrante Neri and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1774,
	title = {A P-Lingua based Simulator for Tissue P Systems with Cell Separation},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {17},
	year = {2014},
	pages = {89-102},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	issn = {1453-8245},
	author = {Ignacio P{\'e}rez-Hurtado and Luis Valencia-Cabrera and Jos{\'e} M. Chac{\'o}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1782,
	title = {Probabilistic Guarded P Systems, A formal Definition},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {183-206},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Manuel Garc{\'\i}a-Quismondo and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1789,
	title = {Probabilistic Guarded P systems, a New Formal Modelling Framework},
	journal = {15th Conference on Membrane Computing, pre-proceedings},
	year = {2014},
	pages = {169-190},
	address = {Opava, Czech Republic},
	isbn = {978-80-7510-036-8},
	url = {http://cmc15.slu.cz/wp-content/uploads/2014/01/cmc15_proceedings.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1894,
	title = {Probabilistic Guarded P Systems, A New Formal Modelling Framework},
	journal = {Lecture Notes in Computer Science},
	volume = {8961},
	year = {2014},
	pages = {194-214},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Multienvironment P systems constitute a general, formal framework for modelling the dynamics of population biology, which consists of two main approaches: stochastic and probabilistic. The framework has been successfully used to model biologic systems at both micro (e.g. bacteria colony) and macro (e.g. real ecosystems) levels, respectively.
In this paper, we extend the general framework in order to include a new case study related to P. Oleracea species. The extension is made by a new variant within the probabilistic approach, called Probabilistic Guarded P systems (in short, PGP systems). We provide a formal definition, a simulation algorithm to capture the dynamics, and a survey of the associated software.},
	issn = {0302-9743},
	url = {http://link.springer.com/chapter/10.1007\%2F978-3-319-14370-5_12},
	author = {Manuel Garc{\'\i}a-Quismondo and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1779,
	title = {The Reduction Problem in CUDA and Its Simulation with P Systems},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {91-102},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Rodica Ceterchi and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1785,
	title = {Revisiting Sevilla Carpets: A New Tool for the P-Lingua Era},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {281-292},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {David Orellana-Mart{\'\i}n and Carmen Graciani-D{\'\i}az and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {1793,
	title = {The Role of the Direction in Tissue P Systems with Cell Separation},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = { 19 (2014) 1{\textendash}4},
	year = {2014},
	pages = {185{\textendash}199},
	issn = {1430-189X},
	author = {Luis F. Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Luis Valencia-Cabrera}
}
@article {1780,
	title = {Self-constructing Recognizer P Systems},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {137-154},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Daniel D{\'\i}az-Pernil and Francisco Pe{\~n}a-Cantillana and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {1802,
	title = {Sevilla Carpets Revisited: Enriching Membrane Computing Toolbox},
	journal = {Fundamenta Informaticae},
	volume = {134},
	year = {2014},
	pages = {153{\textendash}166},
	publisher = {IOS Press},
	issn = {1875-8681},
	doi = {10.3233/FI-2014-1096},
	author = {David Orellana-Mart{\'\i}n and Carmen Graciani-D{\'\i}az and Luis Felipe Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Luis Valencia-Cabrera}
}
@article {1791,
	title = {Simulating Turing Machines with Polarizationless P Systems with Active Membranes},
	journal = {15th Conference on Membrane Computing, pre-proceedings},
	year = {2014},
	pages = {205-216},
	address = {Opava, Czech Republic},
	isbn = {978-80-7510-036-8},
	url = {http://cmc15.slu.cz/wp-content/uploads/2014/01/cmc15_proceedings.pdf},
	author = {Z. Gazdag and Miguel A. Guti{\'e}rrez-Naranjo and G. Kolonits}
}
@article {986,
	title = {Small universal simple Spiking Neural P Systems with weights},
	journal = {Science China. Information Sciences},
	volume = {57},
	year = {2014},
	pages = {1-11},
	publisher = {Springer},
	address = {Beijing, China},
	abstract = {Spiking neural P systems with weights (WSN P systems, for short) are a new variant of spiking neural P systems, where the rules of a neuron are enabled when the potential of that neuron equals a given value. It is known that WSN P systems are universal by simulating register machines. However, in these universal systems, no bound is considered on the number of neurons and rules. In this work, a restricted variant of WSN P systems is considered, called simple WSN P systems, where each neuron has only one rule. The complexity parameter, the number of neurons, to construct a universal simple WSN P system is investigated. It is proved that there is a universal simple WSN P system with 48 neurons for computing functions; as generator of sets of numbers, there is an almost simple (that is, each neuron has only one rule except that one neuron has two rules) and universal WSN P system with 45 neurons.},
	keywords = {bio-inspired computing, Membrane computing, P system, Spiking neural P system, universal computing device},
	issn = {1674-733X},
	doi = {10.1007/s11432-013-4848-z},
	url = {http://link.springer.com/article/10.1007\%2Fs11432-013-4848-z},
	author = {XiangXiang Zeng and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {1783,
	title = {Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques},
	journal = {Twelfth Brainstorming Week on Membrane Computing (BWMC2014)},
	year = {2014},
	pages = {207-220},
	publisher = {F{\'e}nix Editora},
	isbn = {978-84-940056-4-0},
	url = {http://www.gcn.us.es/12bwmc_proceedings},
	author = {Z. Gazdag and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {1790,
	title = {Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques},
	journal = {15th Conference on Membrane Computing, pre-proceedings},
	year = {2014},
	pages = {191-204},
	address = {Opava, Czech Republic},
	isbn = {978-80-7510-036-8},
	url = {http://cmc15.slu.cz/wp-content/uploads/2014/01/cmc15_proceedings.pdf},
	author = {Z. Gazdag and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {1796,
	title = {Time-free solution to SAT problem using P systems with active membranes},
	journal = {Theoretical Computer Science},
	volume = {529},
	year = {2014},
	pages = {61-68},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0304-3975},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397513008451},
	author = {Tao Song and Luis F. Mac{\'\i}as-Ramos and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {893,
	title = {3-COL problem modelling using simple Kernel P systems},
	journal = {International Journal of Computer Mathematics},
	volume = {90},
	year = {2013},
	month = {10/2013},
	pages = {816-830},
	publisher = {Taylor and Francis},
	address = {London, UK},
	abstract = {This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It describes two skPsystems that model the problem and analyzes them in terms of efficiency and complexity. The skP models prove to be more succinct (in terms of number of rules, objects, number of cells and execution steps) than the corresponding tissue P system, availablein the literature, that solves the same problem, at the expense of a greater length of the rules.},
	keywords = {3-colour problem, Formal Verification, kernel P systems, Membrane computing, Tissue P Systems},
	issn = {0020-7160},
	doi = {10.1080/00207160.2012.743712},
	url = {http://dx.doi.org/10.1080/00207160.2012.743712},
	author = {Marian Gheorghe and Florentin Ipate and Raluca Lefticaru and Mario J. P{\'e}rez-Jim{\'e}nez and Adrian Turcanu and Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Laurentiu Mierla}
}
@article {983,
	title = {Bridging Membrane and Reaction Systems {\textendash} Further Results and Research Topics},
	journal = {Fundamenta Informaticae},
	volume = {127},
	year = {2013},
	month = {10/2013},
	pages = {99-114},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {This paper continues an investigation into bridging two research areas concerned with natural computing: membrane computing and reaction systems. More specifically, the paper considers a transfer of two assumptions/axioms of reaction systems, non-permanency and the threshold assumption, into the framework of membrane computing. It is proved that: (1) spiking neural P systems with non-permanency of spikes assumption characterize the semilinear sets of numbers, and (2) symport/antiport P systems with threshold assumption (translated as ω multiplicity of objects) can solve SAT in polynomial time. Also, several open research problems are stated.},
	keywords = {fypercomputation, Membrane computing, reaction system, SAT, semilinear set},
	issn = {0169-2968},
	doi = {10.3233/FI-2013-898},
	url = {http://iospress.metapress.com/content/y724g8012056k237/?issue=1\&genre=article\&spage=99\&issn=0169-2968\&volume=127},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {977,
	title = {Characterizing the Parallel Simulation of P Systems on the GPU},
	journal = {International Journal of Unconventional Computing},
	volume = {9},
	year = {2013},
	month = {10/2013},
	pages = {405-424},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {In order to provide efficient software tools to handle large membrane systems, high-throughput simulators are required. Parallel computing platforms are good candidates, since they are capable of partially implementing the inherently parallel nature of the model. In this concern, today GPUs (Graphics Processing Unit) are considered as highly parallel processors, and they have been successfully used to accelerate P system simulators.

A new GPU simulator for a quadratic-time solution to SAT by means of tissue P systems with cell division is presented in this paper. This simulator is compared with a previously introduced GPU-based simulator for a linear-time solution to SAT based on P systems with active membranes. The aim of this paper is to further study which ingredients of different P systems models are well suited to be managed by the GPU.},
	keywords = {GPGPU, Membrane computing, SAT, Tissue P Systems},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUCcontents/IJUCv9n5-6contents.html},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Jes{\'u}s P{\'e}rez-Carrasco and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {978,
	title = {Foreword. Special Issue: Membrane Computing},
	journal = {International Journal of Unconventional Computing},
	volume = {9},
	year = {2013},
	month = {10/2013},
	pages = {347-349},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUCcontents/IJUCv9n5-6contents.html},
	author = {Marian Gheorghe and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {969,
	title = {Modeling Logic Gene Networks by Means of Probabilistic Dynamic P Systems},
	journal = {International Journal of Unconventional Computing},
	volume = {9},
	number = {5-6},
	year = {2013},
	month = {10/2013},
	pages = {445-464},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {Gene regulatory networks are useful models for biologists to understand the interactions among genes in living organisms. In this work, we consider a special class of gene regulatory networks, called logical networks, where the {\textquotedblleft}links{\textquotedblright} among genes are inferred by logic analysis of phylogenetic profiles. We provide a formalization of logic networks, and introduce a membrane computing model for reconstructing logical networks and reproducing their dynamics. An example logical network is simulated by using software P-Lingua and MeCoSim. The simulation result shows that membrane computing is a versatile framework for modeling different biological scenarios.},
	keywords = {gene, genetic network, logic network, Membrane computing, P system, System biology},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUCcontents/IJUCv9n5-6contents.html},
	author = {Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Mario J. P{\'e}rez-Jim{\'e}nez and Yansen Su and Hui Yu and Linqiang Pan}
}
@article {898,
	title = {Implementing Enzymatic Numerical P Systems for AI Applications by means of Graphic Processing Units},
	journal = {Beyond Artificial Intelligence: Contemplations, Expectations, Applications},
	year = {2013},
	month = {10/2012},
	pages = {137-157},
	publisher = {Springer Verlag},
	chapter = {14},
	address = {Berlin, Germany},
	isbn = {978-3642344213},
	doi = {http://dx.doi.org/10.1007/978-3-642-34422-0_10},
	url = {http://www.amazon.com/Beyond-Artificial-Intelligence-Contemplations-Expectations/dp/3642344216},
	author = {Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {963,
	title = {Analysing Gene Networks with PDP Systems. Arabidopsis thaliana, a Case Study},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {257-272},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Gene Regulatory Networks (GRNs) are a useful tool for biologists to understand
the interactions among genes in living organisms. A special kind of GRNs known
as Logic Networks (LNs) has been recently introduced. These networks consider that
the state of one or more genes can in
uence another one. In a previous work, we proposed
a Membrane Computing model which simulates the dynamics of LNs by drawing
on the improved LAPP algorithm. In this paper we provide a case study for our LN
model on a network which regulates the circadian rhythms of long{term studied plant
Arabidopsis thaliana. We outline the software tools employed and propose a methodology
for analysing LNs on our Membrane Computing model. At the end of the paper, some
conclusions and future work are included.},
	keywords = {bioinformatics, Gene networks, Genetics, LAPP, Logic networks, MeCoSim, Membrane computing, Modelling, Software engineering},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/257_valencia_cabrera.pdf},
	author = {Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Mario J. P{\'e}rez-Jim{\'e}nez and Yansen Su and Hui Yu and Linqiang Pan}
}
@article {962,
	title = {Bridging Membrane and Reaction Systems},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {243-256},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {This paper continues an investigation into bridging two research areas con-
cerned with natural computing: membrane computing and reaction systems. More specif-
ically, the paper considers a transfer of two assumptions/axioms of reaction systems, non-
permanency and the threshold assumption, into the framework of membrane computing.
It is proved that: (1) SN P systems with non-permanency of spikes assumption charac-
terize the semilinear sets of numbers, and (2) symport/antiport P systems with threshold
assumption (translated as ! multiplicity of objects) can solve SAT in polynomial time.
Also, several open research problems are stated.},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/243_paun_perez_rozenberg.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {958,
	title = {A GPU Simulation for Evolution-Communication P Systems with Energy Having no Antiport Rules},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {25-50},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Evolution-Communication P system with energy (ECPe systems) is a cell-
like variant P system which establishes a dependence between evolution and communi-
cation through special objects, called {\textquoteleft}energy,{\textquoteright} produced during evolution and utilized
during communication. This paper presents our initial progress and eorts on the im-
plementation and simulation of ECPe systems using Graphics Processing Units (GPUs).
Our implementation uses matrix representation and operations presented in a previous
work. Specically, an implementation of computations on ECPe systems without antiport
rules is discussed.},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/25_bangalan_soriano.pdf},
	author = {Zylynn F. Bangalan and Krizia A N. Soriano and Richelle A.B. Juayong and Francis G. Cabarle and Henry N. Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {959,
	title = {Kernel P Systems - Version I},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {97-124},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {A basic P system, called kernel P system4 (kP system for short), combining
features of dierent P systems introduced and studied so far is dened and discussed. The
structure of such systems is dened as a dynamic graph, similar to tissue-like P systems,
the objects are organised as multisets, and the rules in each compartment, rewriting and
communication together with system structure changing rules, are applied in accordance
with a specic execution strategy. The denition of kP systems is introduced and some
examples illustrate this concept. Two classes of P systems, namely neural-like and generalised
communicating P systems are simulated by kP systems. Some case studies prove
the expressive power of these systems.},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/097_gheorghe_ipate.pdf},
	author = {Marian Gheorghe and Florentin Ipate and Ciprian Dragomir and Laurentiu Mierla and Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {965,
	title = {Preface},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {vii-ix},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/preface.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {964,
	title = {Proceedings of the Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {x+272},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/contents.pdf},
	author = {Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Miguel A. Mart{\'\i}nez-del-Amor and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {984,
	title = {Research frontiers in Membrane Computing: Open problems and research topics},
	journal = {International Journal of Foundations of Computer Science},
	volume = {24},
	year = {2013},
	month = {08/2013},
	pages = {547-557},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {This paper discusses research frontiers of membrane computing by presenting current open problems and research topics, together with the relevant background and motivation.},
	keywords = {applications of membrane computing, cell membranes, Complexity Classes, finite automata, formal languages, Membrane computing, Natural computing, P system, semantics and formal verification, simulation frameworks, spiking neurons},
	issn = {0129-0541},
	doi = {10.1142/S0129054113500202},
	url = {http://www.worldscientific.com/doi/abs/10.1142/S0129054113500202},
	author = {Marian Gheorghe and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {960,
	title = {Rete Algorithm for P Systems Simulators},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {125-136},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {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
eciency 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.},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/125_graciani_gutierrez.pdf},
	author = {Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {985,
	title = {Seeking sharper frontiers of efficiency in tissue P systems},
	journal = {International Journal of Foundations of Computer Science},
	volume = {24},
	year = {2013},
	month = {08/2013},
	pages = {577-579},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	doi = {10.1142/S0129054113500202},
	url = {http://www.worldscientific.com/doi/abs/10.1142/S0129054113500202},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {961,
	title = {Simulating a Family of Tissue P Systems Solving SAT on the GPU},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {201-220},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {In order to provide efficient 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 the inherently parallel nature
of the model. In this concern, today GPUs (Graphics Processing Unit) are considered as
highly parallel processors, and they are being consolidated as accelerators for scientific
applications. In fact, previous attempts to design P systems simulators on GPUs have
shown that a parallel architecture is better suited in performance than traditional single
CPUs.
In 2010, a GPU-based simulator was introduced for a family of P systems with active
membranes solving SAT in linear time. This is the starting point of this paper, which
presents a new GPU simulator for another polynomial-time solution to SAT by means of
tissue P systems with cell division, trading space for time. The aim of this simulator is
to further study which ingredients of different P systems models are well suited to be
managed by the GPU.},
	keywords = {GPU Computing 1 Introduction, Membrane computing, SAT, Tissue P Systems},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/201_martinez_del_amor.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Jes{\'u}s P{\'e}rez-Carrasco and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {957,
	title = {Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques},
	journal = {Eleventh Brainstorming Week on Membrane Computing (11BWMC)},
	year = {2013},
	month = {08/2013},
	pages = {9-24},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {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 to automate image analysis
in the framework of P systems. Such analysis has been performed by a family of tissue
P systems working on the images as data input.},
	isbn = {978-84-940691-9-2},
	url = {http://www.gcn.us.es/files/11bwmc/009_ardelean_diaz.pdf},
	author = {Ioan Ardelean and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Francisco Pe{\~n}a-Cantillana and Iris Sarchizian}
}
@article {956,
	title = {Kernel P Systems: Applications and Implementations},
	journal = {Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013},
	volume = {212},
	year = {2013},
	month = {07/2013},
	pages = {1081-1089},
	publisher = {Springer Berlin Heidelberg},
	address = {Amsterdam, the Netherlands},
	abstract = {This paper explores the modelling capacities of a new class of P systems, called kernel P systems (kP systems). A specific language for describing kP systems and its translation into Promela, the specification language of Spin, are described. This Promela specification has been further used for simulation and property verification with the Spin model checker. Also, a parallel implementation on GPU parallel architectures, realized using CUDA, is presented and the results are compared with the ones obtained using Promela and Spin. A case study, namely the Subset sum problem, which has been modelled with kernel P systems and further implemented in Promela is presented.},
	keywords = {Formal Verification, kernel P systems, Membrane computing, Subset sum problem},
	isbn = {978-3-642-37501-9},
	doi = {10.1007/978-3-642-37502-6_126},
	url = {http://link.springer.com/chapter/10.1007\%2F978-3-642-37502-6_126},
	author = {Florentin Ipate and Raluca Lefticaru and Laurentiu Mierla and Luis Valencia-Cabrera and Huang Han and Gexiang Zhang and Ciprian Dragomir and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Zhixiang Yin and Linqiang Pan and Xianwen Fang}
}
@article {882,
	title = {Weighted Fuzzy Spiking Neural P Systems},
	journal = {IEEE Transactions on Fuzzy Systems},
	volume = {2},
	year = {2013},
	month = {07/2013},
	pages = {209-220},
	publisher = {IEEE Computational Intelligence Society},
	edition = {21},
	abstract = {Spiking neural P systems (SN P systems) are a new class of computing models inspired by neurophysiological behavior of biological spiking neurons. In order to make SN P systems capable to represent and process fuzzy and uncertain knowledge, we propose a new class of spiking neural P systems in this paper, called weighted fuzzy spiking neural P systems (WFSN P systems). Some new elements, including fuzzy truth value, certain factor, weighted fuzzy logic, output weight, threshold, new firing rule and two types of neurons, are added to original definition of SN P systems, which allow WFSN P systems to adequately characterize the features of weighted fuzzy production rules in a fuzzy rule-based system. Furthermore, a weighted fuzzy backward reasoning algorithm based on WFSN P systems is developed, which can accomplish dynamic fuzzy reasoning of a rule-based systems more flexibly and intelligently. In addition, we compare the proposed WFSN P systems with other knowledge representation methods, such as fuzzy production rule, conceptual graph and Petri nets, to demonstrate the features or advantages of the proposed techniques.},
	issn = {1063-6706},
	doi = {10.1109/TFUZZ.2012.2208974},
	url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6242397},
	author = {Jun Wang and Peng Shi and Hong Peng and Mario J. P{\'e}rez-Jim{\'e}nez and Tao Wang}
}
@article {879,
	title = {Fuzzy reasoning spiking neural P system for fault diagnosis},
	journal = {Information Sciences},
	volume = {235},
	year = {2013},
	month = {06/2013},
	pages = {106{\textendash}116},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P systems (SN P systems) have been well established as a novel class of distributed parallel computing models. Some features that SN P systems possess are attractive to fault diagnosis. However, handling fuzzy diagnosis knowledge and reasoning is required for many fault diagnosis applications. The lack of ability is a major problem of existing SN P systems when applying them to the fault diagnosis domain. Thus, we extend SN P systems by introducing some new ingredients (such as three types of neurons, fuzzy logic and new firing mechanism) and propose the fuzzy reasoning spiking neural P systems (FRSN P systems). The FRSN P systems are particularly suitable to model fuzzy production rules in a fuzzy diagnosis knowledge base and their reasoning process. Moreover, a parallel fuzzy reasoning algorithm based on FRSN P systems is developed according to neuron{\textquoteright}s dynamic firing mechanism. Besides, a practical example of transformer fault diagnosis is used to demonstrate the feasibility and effectiveness of the proposed FRSN P systems in fault diagnosis problem.},
	keywords = {Fault diagnosis; P systems; Spiking neural P systems; Fuzzy knowledge representation; Fuzzy reasoning},
	issn = {0020-0255},
	doi = {http://dx.doi.org/10.1016/j.ins.2012.07.015},
	url = {(http://dx.doi.org/10.1016/j.ins.2012.07.015)},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Hao Wang and Jie Shao and Tao Wang}
}
@article {952,
	title = {Editorial. Foreword. Special Issue: A selection of papers from the 10th Brainstorming Week on Membrane Computing},
	journal = {International Journal of Computer Mathematics},
	volume = {4},
	year = {2013},
	month = {04/2013},
	pages = {747-749},
	publisher = {Taylor and Francis},
	edition = {90},
	address = {London, UK},
	issn = {0020-7160},
	doi = {10.1080/00207160.2013.788318},
	url = {http://www.tandfonline.com/doi/abs/10.1080/00207160.2013.788318$\#$.UYLBTLXX3Ns},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {901,
	title = {Asynchronous spiking neural P systems with local synchronization},
	journal = {Information Sciences},
	volume = {219},
	year = {2013},
	month = {01/2013},
	pages = {197-207},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. Asynchronous SN P systems are non-synchronized systems, where the use of spiking rules (even if they are enabled by the contents of neurons) is not obligatory. It remains open whether asynchronous SN P systems with standard spiking rules are equivalent with Turing machines. In this paper, with a biological inspiration (in order to achieve some specific biological functioning, neurons from the same functioning motif or community work synchronously to cooperate with each other), we introduce the notion of local synchronization into asynchronous SN P systems. The computation power of asynchronous SN P systems with local synchronization is investigated. Such systems consisting of general neurons (respectively, unbounded neurons) and using standard spiking rules are proved to be universal. Asynchronous SN P systems with local synchronization consisting of bounded neurons and using standard spiking rules characterize the semilinear sets of natural numbers. These results show that the local synchronization is useful, it provides some {\textquotedblleft}programming capacity{\textquotedblright} useful for achieving a desired computation power},
	keywords = {Bio-inspired computing; Spiking neural P system; Turing completeness; Asynchronization; Local synchronization},
	issn = {0020-0255},
	doi = {http://dx.doi.org/10.1016/j.ins.2012.07.023},
	url = {http://www.sciencedirect.com/science/article/pii/S0020025512004872},
	author = {Tao Song and Linqiang Pan and Gheorghe Paun}
}
@article {945,
	title = {DCBA: Simulating population dynamics P systems with proportional objects distribution},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {257-276},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Population Dynamics P systems provide a formal framework for ecological modelling having a probabilistic (while keeping the maximal parallelism). Several simulation algorithms have been developed always trying to reach higher reliability in the way they reproduce the behaviour of the ecosystems being modelled.
It is natural for those algorithms to classify the rules into blocks, comprising rules that share identical left-hand side. Previous algorithms, such as the Binomial Block Based (BBB) or the Direct Non Deterministic distribution with Probabilities (DNDP), do not define a deterministic behaviour for blocks of rules competing for the same resources. In this paper we introduce the Direct distribution based on Consistent Blocks Algorithm (DCBA), a simulation algorithm which addresses that inherent non-determinism of the model by distributing proportionally the resources.},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-36751-9_18},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_18},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and {\'A}lvaro Romero-Jim{\'e}nez and Carmen Graciani-D{\'\i}az and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {946,
	title = {The efficiency of tissue P systems with cell separation relies on the environment},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {7762 (2013), 257-276},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The classical definition of tissue P systems includes a distinguished alphabet with the special assumption that its elements are available in an arbitrarily large amount of copies. These objects are shared in a distinguished place of the system, called the environment. This ability of having infinitely many copies of some objects has been widely exploited in the design of efficient solutions to computationally hard problems by means of tissue P systems.
This paper deals with computational aspects of tissue P systems with cell separation where there is no such environment as described above. The main result is that only tractable problems can be efficiently solved by using this kind of P systems. Bearing in mind that NP{\textendash}complete problems can be efficiently solved by using tissue P systems without environment and with cell division, we deduce that in the framework of tissue P systems without environment, the kind of rules (separation versus division) provides a new frontier of the tractability of decision problems.},
	issn = {0302-9743},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_17},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {944,
	title = {A formalization of membrane systems with dynamically evolving structures},
	journal = {International Journal of Computer Mathematics},
	volume = {90},
	year = {2013},
	pages = {801-815},
	publisher = {Taylor and Francis},
	address = {London, UK},
	abstract = {This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition of new variants of P systems with a dynamic structure and for the comparison of existing definitions as well as for their extension. We give a detailed definition of the formalism and we present some examples of how to translate several existing variants of P systems with a dynamic structure.},
	keywords = {dynamic structure, formal definition, P systems},
	issn = {0020-7160},
	doi = {10.1080/00207160.2012.748899},
	url = {http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.748899},
	author = {Rudolf Freund and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Sergey Verlan}
}
@article {880,
	title = {A novel image thresholding method based on membrane computing and fuzzy entropy},
	journal = {Journal of Intelligent and Fuzzy Systems},
	volume = {2},
	year = {2013},
	pages = {229-237},
	publisher = {IOS Press},
	edition = {24},
	address = {Amsterdam, Netherlands},
	abstract = {Multi-level thresholding methods are a class of most popular image segmentation techniques, however, they are not computationally efficient since they exhaustively search the optimal thresholds to optimize the objective function. In order to eliminate the shortcoming, a novel multi-level thresholding method for image segmentation based on tissue P systems is proposed in this paper. The fuzzy entropy is used as the evaluation criterion to find optimal segmentation thresholds. The presented method can effectively search the optimal thresholds for multi-level thresholding based on fuzzy entropy due to parallel computing ability and particular mechanism of tissue P systems. Experimental results of both qualitative and quantitative comparisons for the proposed method and several existing methods illustrate its applicability and effectiveness.},
	keywords = {fuzzy entropy, Image segmentation, Membrane computing, thresholding method, Tissue P Systems},
	issn = {1064-1246},
	doi = {10.3233/IFS-2012-0549},
	url = {http://iospress.metapress.com/content/j542m5p0048588g2/?p=ea45f12cd9f04dd4815022f7d89cf1f8\&pi=14},
	author = {Hong Peng and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Peng Shi}
}
@article {988,
	title = {The P versus NP problem: Unconventional insights from Membrane Computing},
	journal = {Second Asian Conference on Membrane Computing},
	year = {2013},
	pages = {7},
	url = {Second Asian Conference on Membrane Computing},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gexiang Zhang and Y. Wang and J. Cheng and T. Wang}
}
@article {989,
	title = {A P-Lingua based simulator for tissue P systems with cell separation},
	journal = {Second Asian Conference on Membrane Computing},
	year = {2013},
	pages = {208-220},
	author = {Ignacio P{\'e}rez-Hurtado and Luis Valencia-Cabrera and Jos{\'e} M. Chac{\'o}n and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gexiang Zhang and Y. Wang and J. Cheng and T. Wang}
}
@article {941,
	title = {A polynomial alternative to unbounded environment for tissue P systems with cell division},
	journal = {International Journal of Computer Mathematics},
	volume = {90},
	year = {2013},
	pages = {760-775},
	publisher = {Taylor and Francis},
	address = {London, UK},
	abstract = {The standard definition of tissue P systems includes a special alphabet whose elements are assumed to appear in the initial configuration of the system in an arbitrarily large number of copies. These objects reside in a distinguished place of the system, called the environment. Such potentially infinite supply of objects seems an unfair tool when designing efficient solutions to computationally hard problems in the framework of membrane computing, by performing a space{\textendash}time trade-off.

This paper deals with computational aspects of tissue P systems with cell division where there is no environment having the property mentioned above. Specifically, we prove that the polynomial complexity classes associated with tissue P systems with cell division and with or without environment are actually identical. As a consequence, we conclude that it is not necessary to have infinitely many copies of some objects in the initial configuration in order to solve NP{\textendash}complete problems in an efficient way.},
	keywords = {cell division, Computational Complexity, Environment of a tissue, Membrane computing, Tissue P Systems},
	issn = {0020-7160},
	doi = {10.1080/00207160.2012.748898},
	url = {http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.748898},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and Francisco J. Romero-Campero}
}
@article {948,
	title = {Population Dynamics P System (PDP) models: a standarized protocol for describing and applying novel bio-inspired computing tools},
	journal = {Plos One},
	volume = {4},
	year = {2013},
	pages = {1-13},
	publisher = {Plos},
	edition = {8},
	abstract = {Today, the volume of data and knowledge of processes necessitates more complex models that integrate all available information. This handicap has been solved thanks to the technological advances in both software and hardware. Computational tools available today have allowed developing a new family of models, known as computational models. The description of these models is difficult as they can not be expressed analytically, and it is therefore necessary to create protocols that serve as guidelines for future users. The Population Dynamics P systems models (PDP) are a novel and effective computational tool to model complex problems, are characterized by the ability to work in parallel (simultaneously interrelating different processes), are modular and have a high computational efficiency. However, the difficulty of describing these models therefore requires a protocol to unify the presentation and the steps to follow. We use two case studies to demonstrate the use and implementation of these computational models for population dynamics and ecological process studies, discussing briefly their potential applicability to simulate complex ecosystem dynamics.},
	issn = {1932-6203},
	doi = {10.1371/journal.pone.0060698},
	url = {http://www.plosone.org/article/info\%3Adoi\%2F10.1371\%2Fjournal.pone.0060698},
	author = {M. Angels Colomer and Antoni Margalida and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {990,
	title = {The relevance of the environment on the efficiency of tissue P systems},
	journal = {14th International Conference on Membrane Computing},
	year = {2013},
	pages = {283-295},
	publisher = {http://www.math.md/cmc14/},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and Luis Valencia-Cabrera},
	editor = {Artiom Alhazov and S. Cojocaru and Marian Gheorghe and Yurii Rogozhin}
}
@article {979,
	title = {A Rete-based Algorithm for Rule Selection in P Systems},
	journal = {International Journal of Unconventional Computing},
	volume = {9},
	year = {2013},
	pages = {367-384},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUCcontents/IJUCv9n5-6contents.html},
	author = {Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {D{\'\i}azPernil2013846,
	title = {Segmenting images with gradient-based edge detection using Membrane Computing},
	journal = {Pattern Recognition Letters},
	volume = {34},
	number = {8},
	year = {2013},
	note = {<ce:title id="tt005">Computer Analysis of Images and Patterns</ce:title>},
	pages = {846 - 855},
	publisher = {Elsevier},
	address = {Philadelphia, USA},
	keywords = {CUDA},
	issn = {0167-8655},
	doi = {10.1016/j.patrec.2012.10.014},
	url = {http://www.sciencedirect.com/science/article/pii/S0167865512003443},
	author = {Daniel D{\'\i}az-Pernil and Ainhoa Berciano and Francisco Pe{\~n}a-Cantillana and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {947,
	title = {Spiking Neural P systems with functional astrocytes},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {228-242},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Spiking Neural P Systems (SN P Systems, for short) is a developing field within the universe of P Systems. New variants arise constantly as the study of their properties, such as computational completeness and computational efficiency, grows. Variants frequently incorporate new ingredients into the original model inspired by real neurophysiological structure of the brain. Astrocytes are one of the elements existing in that structure. Also known collectively as astroglia, astrocytes are characteristic star-shaped glial cells in the brain and spinal cord. In this paper, a new variant of Spiking Neural P Systems incorporating astrocytes is introduced. These astrocytes are modelled as computing devices capable of performing function computation in a single computation step. In order to experimentally study the action of Spiking Neural P Systems with astrocytes, it is necessary to develop software providing the required simulation tools. Within this trend, P{\textendash}Lingua offers a standard language for the definition of P Systems. Part of the same software project, pLinguaCore library provides particular implementations of parsers and simulators for the models specified in P{\textendash}Lingua. Along with the new SN P System variant with astrocytes, an extension of the P{\textendash}Lingua language allowing definition of these systems is presented in this paper, as well as an upgrade of pLinguaCore, including a parser and a simulator that supports the aforementioned variant.},
	issn = {0302-9743 },
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_16},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {987,
	title = {Time-free solution to SAT problem using P systems with active membranes},
	journal = {Theoretical Computer Science},
	year = {2013},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to solve computation hard problems, where the execution of each rule is completed in unit time (a global clock is assumed for timing and synchronizing the execution of rules). The assumption that the execution of each rule takes exactly one time unit plays an vital role to make a system working synchronously, and it has also been used to characterize the computational efficiency and time complexity of a system. In this work, we investigate the computation power of P systems without such time assumption. Specifically, we give a time-free solution to SAT problem using P systems with active membranes in the sense that the correctness of the solution does not depend on the precise timing of the involved rules.},
	keywords = {Membrane computing; P system; Time-free solution; Semi-uniform solution; NP-complete problem},
	issn = {0304-3975},
	doi = {http://www.sciencedirect.com/science/journal/03043975},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397513008451},
	author = {Tao Song and Luis F. Mac{\'\i}as-Ramos and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {870,
	title = {Proceedings of the Tenth Brainstorming Week on Membrane Computing},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {30/01/2012},
	pages = {xiv+318},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/bravol2012I.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Francisco J. Romero-Campero}
}
@proceedings {871,
	title = {Proceedings of the Tenth Brainstorming Week on Membrane Computing},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {30/01/2012},
	pages = {xiv+292},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/bravol2012II.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Gheorghe Paun and Luis Valencia-Cabrera}
}
@proceedings {921,
	title = {Proceedings of the Asian Conference on Membrane Computing},
	journal = {Asian Conference on Membrane Computing (ACMC2012)},
	year = {2012},
	month = {15/10/2012},
	pages = {iii+391},
	publisher = {Huazhong University of Science and Technology},
	address = {Wuhan, China},
	author = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {923,
	title = {Using Membrane Computing for Effective Homology},
	journal = {Applicable Algebra in Engineering, Communication and Computing},
	volume = {23},
	year = {2012},
	month = {12/2012},
	pages = {233-249},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	abstract = {Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on a cell complex. Using this algebraic data structure, Effective Homology gives answers to some important computability problems in Algebraic Topology. In a discrete context, Effective Homology can be seen as a combinatorial layer given by a forest graph structure spanning every cell of the complex. In this paper, by taking as input a pixel-based 2D binary object, we present a logarithmic-time uniform solution for describing a chain homotopy operator ϕ for its adjacency graph. This solution is based on Membrane Computing techniques applied to the spanning forest problem and it can be easily extended to higher dimensions.},
	keywords = {Computational Algebraic Topology, Digital Topology, Effective Homology, Membrane computing, Tissue-like P systems},
	issn = {0938-1279},
	doi = {10.1007/s00200-012-0176-6 },
	url = {http://link.springer.com/article/10.1007\%2Fs00200-012-0176-6},
	author = {Hepzibah A. Christinal and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Pedro  Real}
}
@article {924,
	title = {Programas Moleculares y Sistemas L{\'o}gico-formales},
	journal = {Theoretical Computer Science},
	volume = {5},
	year = {2012},
	month = {11/2012},
	pages = {77-89},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {2182-2824 },
	url = {http://kairos.fc.ul.pt/},
	author = {{\'A}ngel Nepomuceno and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {895,
	title = {Modeling logic gene networks by means of probabilistic dynamic P systems},
	journal = {Asian Conference on Membrane Computing},
	year = {2012},
	month = {10/2012},
	pages = {30-60},
	address = {Wuhan, China},
	author = {Manuel Garc{\'\i}a-Quismondo and Luis Valencia-Cabrera and Yansen Su and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan and Hui Yu},
	editor = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {894,
	title = {New frontiers of the efficiency in tissue P systems},
	journal = {Asian Conference on Membrane Computing},
	year = {2012},
	month = {10/2012},
	pages = {61-73},
	address = {Wuhan, China},
	author = {Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font},
	editor = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {896,
	title = {On recent developments in P-lingua based simulators for Spiking Neural P Systems},
	journal = {Asian Conference on Membrane Computing},
	year = {2012},
	month = {10/2012},
	pages = {14-29},
	address = {Wuhan, China},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {897,
	title = {P systems as a modeling framework for molecular Systems Biology},
	journal = {Asian Conference on Membrane Computing},
	year = {2012},
	month = {10/2012},
	pages = {8-10},
	address = {Wuhan, China},
	author = {Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {925,
	title = {A Population-Membrane-System-Inspired Evolutionary Algorithm for Distribution Network Reconfiguration},
	journal = {Asian Conference on Membrane Computing (ACMC 2012)},
	year = {2012},
	month = {10/2012},
	pages = {139 -160},
	publisher = {Huazhong University of Science and Technology},
	address = {Wuhan, China},
	abstract = {This paper develops a population-membrane-system-inspired
evolutionary algorithm, PMSIEA, which is designed by using a popula-
tion P system and a quantum-inspired evolutionary algorithm (QIEA).
We use a population P system with three cells to organize three types of
QIEAs, where communications between cells are performed at the level
of genes, instead of the level of individuals reported in the existing mem-
brane algorithms in the literature. Knapsack problems are applied to
discuss the parameter setting and to test the effectiveness of PMSIEA.
Experimental results show that PMSIEA is superior to four representa-
tive QIEAs and our previous work with respect to the quality of solutions
and the elapsed time. We also use PMSIEA to solve the optimal distri-
bution system reconfiguration problem in power systems for minimizing
the power loss.
},
	keywords = {distribution system reconfiguration, Membrane computing, membrane-inspired evolutionary algorithm, population P system},
	author = {Gexiang Zhang and Miguel A. Guti{\'e}rrez-Naranjo and Yanhui Qin and Marian Gheorghe and Ji-Xiang Gheng},
	editor = {Linqiang Pan and Gheorghe Paun and Tao Song}
}
@article {889,
	title = {Heterotic Computing Examples with Optics, Bacteria, and Chemicals},
	journal = {Lecture Notes in Computer Science},
	volume = {7445},
	year = {2012},
	month = {09/2012},
	pages = {198-209},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Unconventional computers can perform embodied computation that can directly exploit the natural dynamics of the substrate. But such in materio devices are often limited, special purpose machines. To be practically useful, unconventional devices are usually be combined with classical computers or control systems. However, there is currently no established way to do this, or to combine different unconventional devices.
In this position paper we describe heterotic unconventional computation, an approach that focusses on combinations of unconventional devices. This will need a sound semantic framework defining how diverse unconventional computational devices can be combined in a way that respects the intrinsic computational power of each, whilst yielding a hybrid device that is capable of more than the sum of its parts. We also describe a suite of diverse physical implementations of heterotic unconventional computers, comprising computation performed by bacteria hosted in chemically built material, sensed and controlled optically and chemically.},
	isbn = {78-3-642-32893-0},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-32894-7_19},
	url = {http://www.springerlink.com/content/e3hx477775162748/},
	author = {Susan Stepney and Samson Abramsky and Matthias Bechmann and Jerzy Gorecki and Viv Kendon and Thomas J. Naughton and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero and Angelika Sebald}
}
@article {900,
	title = {On the power of enzymatic numerical P systems},
	journal = {Acta Informatica},
	volume = {49},
	year = {2012},
	month = {09/2012},
	pages = {395-412},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {We study the computing power of a class of numerical P systems introduced in the framework of autonomous robot control, namely enzymatic numerical P systems. Three ways of using the evolution programs are investigated: sequential, all-parallel and one-parallel (with the same variable used in all programs or in only one, respectively); moreover, both deterministic and non-deterministic systems are considered. The Turing universality of some of the obtained classes of numerical P systems is proved (for polynomials with the smallest possible degree, one, also introducing a new proof technique in this area, namely starting the universality proof from the characterization of computable sets of numbers by means of register machines). The power of many other classes remains to be investigated.},
	issn = {0001-5903},
	doi = {10.1007/s00236-012-0166-y},
	url = {http://link.springer.com/article/10.1007\%2Fs00236-012-0166-y},
	author = {Cristian I. Vasile and Ana B. Pavel and Ioan Dumitrache and Gheorghe Paun}
}
@article {884,
	title = {DCBA: Simulating population dynamics P systems with proportional object distribution},
	journal = {13th International Conference on Membrane Computing (CMC13)},
	year = {2012},
	month = {08/2012},
	pages = {291-310},
	address = {Budapest, Hungary},
	abstract = {Population Dynamics P systems (PDP systems, in short)
refer to a formal framework for ecological modelling. The semantics
of the model associates probabilities with rules, but inasmuch as
the model is based on P systems, the rules are also applied in a
maximally parallel way. Following the success of the first model using
this framework, initially called multienvironment probabilistic P systems,
several simulation algorithms have been developed in order to better
reproduce the behaviour of the ecosystems being modelled.
It is natural for those algorithms to classify the rules from the model
into blocks, comprising rules that share identical left-hand side. Previous
algorithms, such as the Binomial Block Based (BBB) or the Direct Non
Deterministic distribution with Probabilities (DNDP), do not define
a deterministic behaviour for blocks of rules competing for the same
resources. In this paper we introduce the Direct distribution based on
Consistent Blocks Algorithm (DCBA), a simulation algorithm which
address that inherent non-determinism of the model by distributing
proportionally the resources.
},
	keywords = {DCBA, Membrane computing, P-Lingua, pLinguaCore, Population Dynamics P systems, Probabilistic P systems, Simulation Algorithm},
	isbn = {978-963-311-372-1 },
	url = {http://www.sztaki.hu/tcs/proba/cmc13/CMC13-proceedings.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and {\'A}lvaro Romero-Jim{\'e}nez and Carmen Graciani-D{\'\i}az and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {884,
	title = {The efficiency of tissue P systems with cell separation relies on the environment},
	journal = {13th International Conference on Membrane Computing (CMC13)},
	year = {2012},
	month = {08/2012},
	pages = {277-290},
	address = {Budapest, Hungary},
	isbn = {978-963-311-372-1},
	url = {http://www.sztaki.hu/tcs/proba/cmc13/CMC13-proceedings.pdf},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and Luis Valencia-Cabrera}
}
@article {884,
	title = {A formal framework for P systems with dynamic structure},
	journal = {13th International Conference on Membrane Computing (CMC13)},
	year = {2012},
	month = {08/2012},
	pages = {199-210},
	address = {Budapest, Hungary},
	isbn = {978-963-311-372-1},
	url = {http://www.sztaki.hu/tcs/proba/cmc13/CMC13-proceedings.pdf},
	author = {Rudolf Freund and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Sergey Verlan}
}
@article {884,
	title = {Spiking neural P systems with functional astrocytes},
	journal = {13th International Conference on Membrane Computing (CMC13)},
	year = {2012},
	month = {08/2012},
	pages = {259-276},
	address = {Budapest, Hungary},
	isbn = {978-963-311-372-1},
	url = {http://www.sztaki.hu/tcs/proba/cmc13/CMC13-proceedings.pdf},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {884,
	title = {Using a kernel P system to solve the 3-Col problem},
	journal = {13th International Conference on Membrane Computing (CMC13)},
	year = {2012},
	month = {08/2012},
	pages = {243-258},
	address = {Budapest, Hungary},
	isbn = {978-963-311-372-1},
	url = {http://www.sztaki.hu/tcs/proba/cmc13/CMC13-proceedings.pdf},
	author = {Florentin Ipate and Ciprian Dragomir and Raluca Lefticaru and Laurentiu Mierla and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {876,
	title = {Improving GPU Simulations of Spiking Neural P Systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {15},
	year = {2012},
	month = {06/2012},
	pages = {5-20},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	edition = {Bio-Inspired Computing {\textendash} Theory and Applications (BIC-TA) - Selected papers},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {In this work we present further extensions and improvements
of a Spiking Neural P system (for short, SNP systems) simulator on graphics
processing units (for short, GPUs). Using previous results on representing SNP
system computations using linear algebra, we analyze and implement a compu-
tation simulation algorithm on the GPU. A two-level parallelism is introduced
for the computation simulations. We also present a set of benchmark SNP sys-
tems to stress test the simulation and show the increased performance obtained
using GPUs over conventional CPUs. For a 16 neuron benchmark SNP system
with 65536 nondeterministic rule selection choices, we report a 2.31 speedup of
the GPU-based simulations over CPU-based simulations.
},
	keywords = {CUDA, GPU Computing, Membrane computing, spiking neural network, spiking neural P systems},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum15/Number15_1/cuprins15_1.htm},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {877,
	title = {Solving Common Algorithmic Problem with recognizer tissue P systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {15},
	year = {2012},
	month = {06/2012},
	pages = {33-49},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	edition = {Bio-Inspired Computing {\textendash} Theory and Applications (BIC-TA) - Selected papers},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {Common Algorithmic Problem is an optimization problem,
which has the nice property that several other NP-complete problems can be
reduced to it in linear time. In this work, we deal with its decision version in
the framework of tissue P systems. A tissue P system with cell division is a
computing model which has two types of rules: communication and division
rules. The ability of cell division allows us to obtain an exponential amount
of cells in linear time and to design cellular solutions to computationally hard
problems in polynomial time. We here present an effective solution to Common
Algorithmic Decision Problem by using a family of recognizer tissue P systems
with cell division. Furthermore, a formal verification of this solution is given.},
	keywords = {membrane computing; tissue P system; cell division; common algorithmic problem},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum15/Number15_1/pdf/03-Niu.pdf},
	author = {Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {875,
	title = {Parallel Skeletonizing of Digital Imagery by Using Cellular Automata},
	journal = {Lecture Notes in Computer Science},
	volume = {7309 },
	year = {2012},
	month = {05/2012},
	pages = {39-48},
	publisher = {Springer Verlag},
	address = {Bertinoro, Italy},
	issn = {0302-9743},
	url = {http://ctic2012.dm.unibo.it/},
	author = {Francisco Pe{\~n}a-Cantillana and Antonio Berciano and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo},
	editor = {M. Ferri and P. Frosini and C. Landi and A. Cerri and B. Di-Fabio}
}
@article {868,
	title = {Asynchronous Spiking Neural P Systems with Local Synchronization},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {187-206},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Spiking neural P systems (SN P systems, for short) are a class of distributed
parallel computing devices inspired from the way neurons communicate by means of
spikes. Asynchronous SN P systems are non-synchronized systems, where the use of spik-
ing rules (even if they are enabled by the contents of neurons) is not obligatory. In this
paper, with a biological inspiration (in order to achieve some specic biological func-
tioning, neurons from the same functioning motif or community work synchronously to
cooperate with each other), we introduce the notion of local synchronization into asyn-
chronous SN P systems. The computation power of asynchronous SN P systems with
local synchronization is investigated. Such systems consisting of general neurons (resp.
unbounded neurons) and using standard spiking rules are proved to be universal. Asyn-
chronous SN P systems with local synchronization consisting of bounded neurons and
using standard spiking rules characterize the semilinear sets of natural numbers. These
results show that the local synchronization is useful, it provides some \programming
capacity" useful for achieving a desired computational power.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/Local_Syn_SNP2lq.pdf},
	author = {Tao Song and Linqiang Pan and Gheorghe Paun}
}
@article {867,
	title = {Cell Complexes and Membrane Computing for Thinning 2D and 3D Images},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {167-186},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {In this paper, we show a new example of bridging Algebraic Topology,
Membrane Computing and Digital Images. In [24], a new algorithm for thinning multi-
dimensional black and white digital images by using cell complexes was presented. Such
cell complexes allow a discrete partition of the space and the algorithm preserves topolog-
ical and geometrical properties of the image. In this paper, we present a parallel adapta-
tion of such algorithm to P systems, by introducing some concepts of Algebraic Topology
in the Membrane Computing framework. The chosen model for the implementation is
tissue-like P systems with promoters, inhibitors and priorities.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/MCThinning_bwmc.pdf},
	author = {Ra{\'u}l Reina-Molina and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {857,
	title = {Counting Cells with Tissue-like P Systems},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {69-78},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Counting the number of cells obtained in an experiment is crucial in many
areas in Biology. Nonetheless, this is usually performed by hand by the researcher due the
intrinsic difficulty of the task. In this paper, we present a set of techniques for counting
cells inspired in the treatment of Digital Images via tissue-like P systems with promoters.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/counting_cells_bwmc.pdf},
	author = {Ioan Ardelean and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Francisco Pe{\~n}a-Cantillana and Ra{\'u}l Reina-Molina and Iris Sarchizian}
}
@article {872,
	title = {DCBA: Simulating Population Dynamics P Systems with Proportional Object Distribution},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {27-56},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {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 rst model using this framework [5], initially
called multienvironment probabilistic P systems, several simulation algorithms have been
dened in order to better reproduce the behaviour of the ecosystems with the models.
BBB and DNDP are previous attempts, which dene blocks of rules having the
same left-hand side, but do not dene a deterministic behaviour when dierent rules are
competing for the same resources. That is, dierent blocks of rules present in their left-
hand 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.},
	keywords = {DCBA, Membrane computing, P-Lingua, pLinguaCore, Population Dynamics, Probabilistic P systems, Simulation Algorithm},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/dcba.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and {\'A}lvaro Romero-Jim{\'e}nez and Carmen Graciani-D{\'\i}az and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {859,
	title = {A Formal Framework for P Systems with Dynamic Structure},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {111-122},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {This article introduces a formalism/framework able to describe different
variants of P systems having a dynamic structure. This framework can be useful for
the definition of new variants of P systems with dynamic structure, for the comparison
of existing definitions as well as for their extension. We give a precise definition of the
formalism and show how existing variants of P systems with dynamic structure can be
translated to it.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/AgustinSerghei.pdf},
	author = {Rudolf Freund and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Sergey Verlan}
}
@article {855,
	title = {Frontiers of Membrane Computing: Open problems and research topics},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {171-250},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {This is a list of open problems and research topics collected after the Twelfth
Conference on Membrane Computing, CMC 2012 (Fontainebleau, France (23 - 26 August 2011), meant initially to be a working material for Tenth Brainstorming Week on
Membrane Computing, Sevilla, Spain (January 30 - February 3, 2012). The result was
circulated in several versions before the brainstorming and then modified according to
the discussions held in Sevilla and according to the progresses made during the meeting.
In the present form, the list gives an image about key research directions currently active
in membrane computing},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/megaPfinal.pdf},
	author = {Marian Gheorghe and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {863,
	title = {Image Thresholding with Cell-like P Systems},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {75-88},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {P systems are a new class of distributed parallel computing models. In this
paper, a novel three-level thresholding approach for image segmentation based on celllike P systems is proposed in order to improve the computational efficiency of multilevel thresholding. A cell-like P system with a specially designed membrane structure is
developed and an improved evolution mechanism is integrated into the cell-like P system.
Due to parallel computing ability and particular mechanism of the cell-like P system, the
presented thresholding approach can effectively search the optimal thresholds for threelevel thresholding based on total fuzzy entropy. Experimental results of both qualitative
and quantitative comparisons for the proposed approach and GA-based and PSO-based
approaches illustrate the applicability and effectiveness.},
	keywords = {Celllike P systems, Image segmentation, Membrane computing, Thresholding approach, Total fuzzy entropy},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/Hong\%20Peng\%20et\%20al\%20-\%2010th\%20BWMC.pdf},
	author = {Hong Peng and Jie Shao and Bing Li and Jun Wang and Mario J. P{\'e}rez-Jim{\'e}nez and Yang Jiang and Yufan Yang}
}
@article {865,
	title = {Improving the Efficiency of Tissue P Systems with Cell Separation},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {105-140},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Cell fission process consists of the division of a cell into two new cells such
that the contents of the initial cell is distributed between the newly created cells. This
process is modelled by a new kind of cell separation rules in the framework of Membrane
Computing. Specifically, in tissue-like membrane systems, cell separation rules have been
considered joint with communication rules of the form symport/antiport. These models
are able to create an exponential workspace, expressed in terms of the number of cells,
in linear time. On the one hand, an efficient and uniform solution to the SAT problem by
using cell separation and communication rules with length at most 8 has been recently
given. On the other hand, only tractable problems can be efficiently solved by using
cell separation and communication rules with length at most 1. Thus, in the framework
of tissue P systems with cell separation, and assuming that P is different from NP, a first frontier
between efficiency and non-efficiency is obtained when passing from communication rules
with length 1 to communication rules with length at most 8.
In this paper we improve the previous result by showing that the SAT problem can be
solved by a family of tissue P systems with cell separation in linear time, by using communication rules with length at most 3. Hence, we provide a new tractability borderline:
passing from 1 to 3 amounts to passing from non{\textendash}efficiency to efficiency, assuming that
P is different from NP.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/mario-sosik.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Petr Sosik}
}
@article {862,
	title = {Languages and P Systems: Recent Developments},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {61-74},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Languages appeared from the very beginning in membrane computing, by
their length sets or directly as sets of strings. We briefly recall here this relationship, with
some details about certain recent developments. In particular, we discuss the possibility
to associate a control word with a computation in a P system. An improvement of a result
concerning the control words of spiking neural P systems is given: regular languages can
be obtained as control words of such systems with only four neurons (and with usual
extended rules: no more spikes are produces than consumed). Several research topics are
pointed out.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/languagesinMC.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {869,
	title = {A Membrane-Inspired Evolutionary Algorithm with a Population P System and its Application to Distribution System Reconfiguration},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {277-292},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {This paper develops a membrane-inspired evolutionary algorithm, PSMA,
which is designed by using a population P system and a quantum-inspired evolutionary algorithm (QIEA). We use a population P system with three cells to organize three
types of QIEAs, where communications between cells are performed at the level of genes,
instead of the level of individuals reported in the existing membrane algorithms in the
literature. Knapsack problems are applied to discuss the parameter setting and to test
the effectiveness of PSMA. Experimental results show that PSMA is superior to four representative QIEAs and our previous work with respect to the quality of solutions and the
elapsed time. We also use PSMA to solve the optimal distribution system reconfiguration
problem in power systems for minimizing the power loss.},
	keywords = {Membrane computing; membrane-inspired evolutionary algorithm; population P system; distribution system reconfiguration},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/psma_bwmc.pdf},
	author = {Gexiang Zhang and Miguel A. Guti{\'e}rrez-Naranjo and Yanhui Qin and Marian Gheorghe}
}
@article {860,
	title = {On the Simulations of Evolution-Communication P Systems with Energy without Antiport Rules for GPUs},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {267-290},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {In this report, we present our initial proposal on simulating computations on
a restricted variant of Evolution-Communication P system with energy (ECPe system)
which will then be implemented in Graphics Processing Units (GPUs). This ECPe sys-
tems variant prohibits the use of antiport rules for communication. Several possible levels
of parallelizations for simulating ECPe systems computations on GPUs are emphasized.
Our work is based on a localized matrix representation for the mentioned variant given
in a previous literature. Our proposal employs a methodology for forward computing also
discussed in the said literature.},
	keywords = {GPU Computing, Membrane computing, parallel computing},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/ecpe-bwmc10.pdf},
	author = {Richelle A.B. Juayong and Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {866,
	title = {An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {141-166},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the tractability of decision problems. On the
one hand, the limitation on the efficiency of tissue P systems with cell division and
communication rules of length 1 has been established. On the other hand, polynomial
time solutions to NP{\textendash}complete problems by using families of tissue P systems with cell
division and communication rules of length at most 3 has been provided.
In this paper, we improve the previous result by showing that the HAM-CYCLE problem
can be solved in polynomial time by a family of tissue P systems with cell division by
using communication rules with length at most 2. Hence, a new tractability boundary is
given: passing from 1 to 2 amounts to passing from non{\textendash}efficiency to efficiency, assuming
that P is different from NP.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/mario-enrico-niall-revised.pdf},
	author = {Antonio E. Porreca and Niall Murphy and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {861,
	title = {Parallel Simulation of Probabilistic P Systems on Multicore Platforms},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {17-26},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Ecologists need to model ecosystems to predict how they will evolve over
time. Since ecosystems are non-deterministic phenomena, they must express the likeli-
hood of events occurring, and measure the uncertainty of their models{\textquoteright} predictions. One
method well suited to these demands is Population Dynamic P systems (PDP systems, in
short), which is a formal framework based on multienvironment probabilistic P systems.
In this paper, we show how to parallelize a Population Dynamics P system simulator,
used to model biological systems, on multi-core processors, such as the Intel i5 Nehalem
and i7 Sandy Bridge. A comparison of three dierent techniques, discuss their strengths
and weaknesses, and evaluate their performance on two generations of Intel processors
with large memory sub-system dierences is presented. We show that P systems are
memory bound computations and future performance optimization eorts should focus
on memory trac reductions. We achieve runtime gains of up to 2.5x by using all the
cores of a single socket 4-core Intel i7 built on the Sandy Bridge architecture. From our
analysis of these results we identify further ways to improve the runtime of our simulator.},
	keywords = {Multicore Computing, OpenMP, P systems, Parallel Simulation, Population Dynamics},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/parallel-dcba.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ian Karlin and Rune E. Jensen and Mario J. P{\'e}rez-Jim{\'e}nez and Anne C. Elster}
}
@article {864,
	title = {The Role of the Environment in Tissue P Systems with Cell Division},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2012},
	month = {02/2012},
	pages = {89-104},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Classical tissue P systems with cell division have a special alphabet whose
elements appear at the initial configuration of the system in an arbitrary large number
of copies. These objects are shared in a distinguished place of the system, called the environment. Besides, the ability of these computing devices to have infinite copies of some
objects has been widely exploited in the design of efficient solutions to computationally
hard problems.
This paper deals with computational aspects of tissue P systems with cell division
where there is not an environment having the property mentioned above. Specifically,
we establish the relationships between the polynomial complexity class associated with
tissue P systems with cell division and with or without environment. As a consequence,
we prove that it is not necessary to have infinite copies of some objects at the initial
configuration in order to solve NP{\textendash}complete problems in an efficient way.},
	keywords = {cell division, Computational Complexity, Environment of a tissue, Membrane computing, Tissue P Systems},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/mario-complejidad.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and Francisco J. Romero-Campero}
}
@article {854,
	title = {Simulating large-scale ENPS models by means of GPU},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {137-152},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Enzymatic Numerical P Systems (ENPS), an extension of Numerical P
Systems, have been successfully applied to model robot controllers. GPGPU is an
innovative technological paradigm which applies the parallel architecture of graphic cards
to solve parallel, general{purpose problems. In previous work, a GPU simulator for ENPS
was introduced. In this paper, a performance analysis on the simulator is performed in
order to experimentally measure the speed-up factors resulting from the simulations.},
	keywords = {Enzymatic Numerical P Systems, GPU, simulation},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/Simulating_complex_ENPS_models_by_means_of_GPU_complete.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Ana B. Pavel and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {858,
	title = {Skeletonizing Images by Using Spiking Neural P Systems},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {91-110},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Skeletonizing an image is representing a shape with a small amount of information by converting the initial image into a more compact representation and keeping
the meaning features. In this paper we use spiking neural P systems to solve this problem.
Based on such devices, a parallel software has been implemented on the GPU architecture. Some real-world applications and open lines for future research are also presented.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/skel_snps_bwmc.pdf},
	author = {Daniel D{\'\i}az-Pernil and Francisco Pe{\~n}a-Cantillana and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {856,
	title = {Towards an Integrated Approach for Model Simulation, Property Extraction and Verification of P Systems},
	journal = {Tenth Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2012},
	month = {02/2012},
	pages = {291-318},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {This paper presents an integrated approach for model simulation, property
extraction and formal verication of P systems, illustrated on a tissue P system with
active membranes solving the 3-colouring problem. The paper focuses on this problem
and reports the invariants and the properties extracted and veried using a series of tools
(Daikon, MeCoSim, Maple, Spin, ProB) and languages (P{Lingua, Promela, Event-B).
Appropriate tools and integration plugins, which facilitate and even automate the steps
involved in the aforementioned approach, have also been developed. The case study chosen
is complex (it involves an exponential growth of the number of states through the use of
membrane division rules) and the properties obtained are non-trivial.},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolI/papers/paper_pit_sev_sheff.pdf},
	author = {Raluca Lefticaru and Florentin Ipate and Luis Valencia-Cabrera and Adrian Turcanu and Cristina Tudose and Marian Gheorghe and Mario J. P{\'e}rez-Jim{\'e}nez and Ionut M. Niculescu and Ciprian Dragomir}
}
@article {881,
	title = {Designing a New Software Tool for Digital Imagery Based on P Systems},
	journal = {Natural Computing},
	volume = {11},
	year = {2012},
	pages = {381-386},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {In this paper we present a new software tool for dealing with the problem of segmentation in Digital
Imagery. The implementation is inspired in the design of a tissue-like P system which solves the problem in constant
time due the intrinsic parallelism of Membrane Computing devices.},
	keywords = {Digital imaginery, Membrane computing, Segmentation},
	issn = {1567-7818},
	doi = {10.1007/s11047-011-9287-4},
	url = {http://www.springer.com/computer/theoretical+computer+science/journal/11047},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Helena Molina-Abril and Pedro  Real}
}
@article {839,
	title = {dP automata versus right-linear simple matrix grammars},
	journal = {Lecture Notes in Computer Science},
	volume = {7160},
	year = {2012},
	pages = {376-387},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	isbn = {978-3-642-27653-8},
	issn = {0302-9743},
	url = {http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-27653-8},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {899,
	title = {Foreword},
	journal = {Natural Computing},
	volume = {11},
	year = {2012},
	pages = {351-352},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	issn = {1567-7818},
	doi = {10.1007/s11047-012-9315-z},
	url = {http://link.springer.com/article/10.1007/s11047-012-9315-z},
	author = {Atulya Nagar and Gheorghe Paun}
}
@article {822,
	title = {Formal verification of P systems with active membranes through model checking},
	journal = {Lecture Notes in Computer Science},
	volume = {7184},
	year = {2012},
	pages = {215-225},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Formal verification of P systems using model checking has attracted a significant amount of research in recent years. However, up to now only P systems with static structure have been considered. This paper makes significant advances in this area by considering P systems with active membranes, in particular P systems with division rules. The paper presents a theoretical framework for addressing this problem and reports on a complex case study involving a well-known NP-complete problem solved using P systems with membrane division rules. This is implemented in Promela and non trivial properties are verified using Spin. },
	issn = {0302-9743},
	doi = {10.1007/978-3-642-28024-5_15},
	url = {http://www.springerlink.com/content/86113w5748425306/},
	author = {Florentin Ipate and Raluca Lefticaru and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Cristina Tudose}
}
@article {742,
	title = {The GPU on the Simulation of Cellular Computing Models},
	journal = {Soft Computing},
	volume = {16},
	year = {2012},
	pages = {231-246},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	abstract = {Membrane Computing is a discipline aiming to abstract formal com-
puting models, called membrane systems or P systems, from the structure and
functioning of the living cells as well as from the cooperation of cells in tissues,
organs, and other higher order structures. This framework provides polynomial
time solutions to NP-complete problems by trading space for time, and whose
efficient simulation poses challenges in three different aspects: an intrinsic mas-
sively parallelism of P systems, an exponential computational workspace, and
a non-intensive floating point nature. In this paper, we analyze the simulation
of a family of recognizer P systems with active membranes that solves the Sat-
isfiability (SAT) problem in linear time on different instances of Graphics Pro-
cessing Units (GPUs). For an efficient handling of the exponential workspace
created by the P systems computation, we enable different data policies to
increase memory bandwidth and exploit data locality through tiling and dy-
namic queues. Parallelism inherent to the target P system is also managed to
demonstrate that GPUs offer a valid alternative for high-performance comput-
ing at a considerably lower cost. Furthermore, scalability is demonstrated on
the way to the largest problem size we were able to run, and considering the
new hardware generation from Nvidia, Fermi, for a total speed-up exceeding
four orders of magnitude when running our simulations on the Tesla S2050
server.

},
	keywords = {GPUs, High performance computing, Manycore, P systems, SAT problem},
	issn = {1432-7643},
	doi = {10.1007/s00500-011-0716-1},
	url = {http://www.springerlink.com/content/t315824k54044l7p/},
	author = {Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Gin{\'e}s D. Guerrero and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez and Manuel Ujald{\'o}n}
}
@article {834,
	title = {An infinite hierarchy of languages defined by dP systems},
	journal = {Theoretical Computer Science},
	volume = {431 (2012)},
	year = {2012},
	pages = {4-12},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation of these separate strings; the overall string is distributed to the dP automaton components in a balanced way, i.e., in equal parts up to one symbol, like in the communication complexity area. The question whether or not the number of components induces an infinite hierarchy of the recognized languages was formulated as an open problem in the literature. We solve here affirmatively this question (by connecting P automata with right linear simple matrix grammars), then we also briefly discuss the relation between the balanced and the non-balanced way of splitting the input string among components; settling this latter problem remains as a research topic. Some other open problems are also formulated.},
	keywords = {Membrane computing; dP system; Infinite hierarchy; Simple matrix grammar},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2011.12.053},
	url = {http://www.sciencedirect.com/science/article/pii/S030439751101019X},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {873,
	title = {Languages and P systems: Recent developments},
	journal = {Computer Science Journal of Moldova},
	volume = {20},
	year = {2012},
	pages = {72-92},
	publisher = {Institute of Mathematics and Computer Science},
	address = {Chisinau, Moldova},
	abstract = {Languages appeared from the very beginning in membrane computing, by
their length sets or directly as sets of strings. We briefly recall here this relationship, with
some details about certain recent developments. In particular, we discuss the possibility
to associate a control word with a computation in a P system. An improvement of a result
concerning the control words of spiking neural P systems is given: regular languages can
be obtained as control words of such systems with only four neurons (and with usual
extended rules: no more spikes are produces than consumed). Several research topics are
pointed out.},
	issn = {1561-4042},
	url = {http://www.gcn.us.es/10BWMC/10BWMCvolII/papers/languagesinMC.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {919,
	title = {Membrane Computing. An introduction. Chinese Edition},
	year = {2012},
	pages = {iii+391},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	isbn = {978-7-5609-7825-3},
	author = {Gheorghe Paun}
}
@article {835,
	title = {P automata revised},
	journal = {Theoretical Computer Science},
	year = {2012},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable language is obtained from a language recognized by a P automaton, to which an initial (arbitrarily large) string is added. Then, we discuss possibilities of extending P automata, following suggestions from string finite automata. For instance, automata with a memory (corresponding to push-down automata) are considered and their power is briefly investigated, as well as some closure properties of the family of languages recognized by P automata. In the context, a brief survey of results about P and dP automata (a distributed version of P automata) is provided, and several further research topics are formulated.},
	keywords = {Membrane computing; P automata; Turing computability; Closure properties},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2012.01.036},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397512000837?v=s5},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {821,
	title = {A P-Lingua based simulator for Spiking Neural P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {7184},
	year = {2012},
	pages = {257-281},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The research within the field of Spiking Neural P systems (SN P systems, for short) is focusing mainly in the study of the computational completeness (they are equivalent in power to Turing machines) and computational efficiency of this kind of systems. These devices have been shown capable of providing polynomial time solutions to computationally hard problems by making use of an exponential workspace constructed in a natural way. In order to experimentally explore this computational power, it is necessary to develop software that provides simulation tools (simulators) for the existing variety of SN P systems. Such simulators allow us to carry out computations of solutions to NP-complete problems on certain instances. Within this trend, P-Lingua provides a standard language for the definition of P systems. As part of the same project, pLinguaCore library provides particular implementations of parsers and simulators for the models specified in P-Lingua. In this paper, an extension of the P-Lingua language to define SN P systems is presented, along with an upgrade of pLinguaCore including a parser and a new simulator for the variants of these systems included in the language. },
	issn = {0302-9743},
	doi = {10.1007/978-3-642-28024-5_18},
	url = {http://www.springerlink.com/content/jrtrt4273v3086m7/},
	author = {Luis F. Mac{\'\i}as-Ramos and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {874,
	title = {Parallel Skeletonizing of Digital Imagery by Using Cellular Automata},
	journal = {Lecture Notes in Computer Science},
	volume = {7309 },
	year = {2012},
	pages = {39-48},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	issn = {0302-9743},
	author = {Francisco Pe{\~n}a-Cantillana and Antonio Berciano and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {springerlink:10.1007/978-3-642-33636-2_15,
	title = {Population Dynamics P Systems on CUDA},
	journal = {Lecture Notes in Bioinformatics},
	volume = {7605},
	year = {2012},
	note = {10.1007/978-3-642-33636-2_15},
	pages = {247-266},
	publisher = {Springer Berlin / Heidelberg},
	edition = {Computational Methods in Systems Biology},
	abstract = {Population Dynamics P systems (PDP systems, in short) provide a new formal bio-inspired modeling framework, which has been successfully used by ecologists. These models are validated using software tools against actual measurements. The goal is to use P systems simulations to adopt a priori management strategies for real ecosystems. Software for PDP systems is still in an early stage. The simulation of PDP systems is both computationally and data intensive for large models. Therefore, the development of efficient simulators is needed for this field. In this paper, we introduce a novel simulator for PDP systems accelerated by the use of the computational power of GPUs. We discuss the implementation of each part of the simulator, and show how to achieve up to a 7x speedup on a NVIDA Tesla C1060 compared to an optimized multicore version on a Intel 4-core i5 Xeon for large systems. Other results and testing methodologies are also included.},
	keywords = {CUDA, Ecological Modeling, GPU Computing, Membrane computing, Parallel Simulation, Population Dynamics},
	isbn = {978-3-642-33635-5},
	doi = {10.1007/978-3-642-33636-2_15},
	url = {http://dx.doi.org/10.1007/978-3-642-33636-2_15},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Adolfo Gastalver-Rubio and Anne C. Elster and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gilbert, David and Heiner, Monika}
}
@article {826,
	title = {A Spiking Neural P System Simulator Based on CUDA},
	journal = {Lecture Notes in Computer Science},
	volume = {7184},
	year = {2012},
	pages = {87-103},
	publisher = {Springer Verlag ProBusiness Berlin},
	abstract = {In this paper we present a Spiking Neural P system (SNP system) simulator based on graphics processing units (GPUs). In particular we implement the simulator using NVIDIA CUDA enabled GPUs. The massively parallel architecture of current GPUs is very suitable for the maximally parallel computations of SNP systems. We simulate a wider variety of SNP systems, after presenting a previous work on SNP system matrix representation which led to their simulation in GPUs, and the simulation algorithm included here. Finally, we compare and present the performance speedups of the CPU-GPU based simulator over the CPU only simulator. },
	isbn = {978-3-642-28023-8},
	doi = {10.1007/978-3-642-28024-5_8},
	url = {http://www.springerlink.com/content/978-3-642-28023-8$\#$section=1017938\&page=1},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {838,
	title = {Towards bridging two cell-inspired models: P systems and R systems},
	journal = {Theoretical Computer Science},
	volume = {429},
	year = {2012},
	pages = {258-264},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We examine, from the point of view of membrane computing, the two basic assumptions of reaction systems, the {\textquotedblleft}threshold{\textquotedblright} and {\textquotedblleft}no permanence{\textquotedblright} ones. In certain circumstances (e.g., defining the successful computations by local halting), the second assumption can be incorporated in a transition P system or in a symport/antiport P system without losing the universality. The case of the first postulate remains open: the reaction systems deal, deterministically, with finite sets of symbols, which is not of much interest for computing; three ways to introduce nondeterminism are suggested and left as research topics.},
	keywords = {Membrane computing, P system, Reaction system (R system), Universality},
	issn = {0304-3975},
	doi = {http://dx.doi.org/10.1016/j.tcs.2011.12.046},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397511010127},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {918,
	title = {Towards Fypercomputations  (in Membrane Computing)},
	journal = {Lecture Notes in Computer Science},
	volume = {7300},
	year = {2012},
	pages = {207-220},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Looking for ideas which would lead to computing devices able to compute beyond the Turing barrier is already a well established research area of computing theory; such devices are said to be able of doing hypercomputations. It is also a dream and a concern of computability to speed-up computing devices; we propose here a name for the case when this leads to polynomial solutions to problems known to be (at least) NP-complete: fypercomputing-with the initial F coming from fast. In short: fypercomputing means going polynomially beyond NP. The aim of these notes is to briefly discuss the existing ideas in membrane computing which lead to fypercomputations and to imagine new ones, some of them at the level of speculations, subject for further investigation. },
	keywords = {Complexity; Hypercomputing; Membrane computing; Turing computing},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-31644-9-14},
	url = {http://www.scopus.com/record/display.url?eid=2-s2.0-84866988988\&origin=resultslist\&sort=plf-f\&src=s\&st1=George+Paun\&sid=Gm8vRBqePqkt9Oqhy9PyzBi\%3a440\&sot=b\&sdt=b\&sl=43\&s=AUTHOR-NAME\%28George+Paun\%29+AND+PUBYEAR+\%3E+2008\&relpos=0\&relpos=0\&searchTerm=AUTHOR},
	author = {Gheorghe Paun}
}
@proceedings {749,
	title = {Proceedings of the Ninth Brainstorming Week on Membrane Computing},
	journal = {Ninth Brainstorming  Week on Membrane Computing},
	year = {2011},
	month = {31/01/2011},
	pages = {xiv+374},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	url = {http://www.gcn.us.es/9bwmc_proceedings},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Francisco J. Romero-Campero and Luis Valencia-Cabrera}
}
@proceedings {785,
	title = {Proceedings of the 12th International Conference on Membrane Computing (CMC12)},
	journal = {12th International Conference on Membrane Computing (CMC12)},
	year = {2011},
	month = {23/08/2011},
	pages = {vi + 511},
	address = {Fontainebleau, France},
	url = {http://cmc12.lacl.fr/cmc12proceedings.pdf},
	author = {Marian Gheorghe and Gheorghe Paun and Sergey Verlan}
}
@article {846,
	title = {Implementing ENPS by means of GPUs for AI applications},
	journal = {Interdisciplinary Aspects of Artificial Intelligence},
	year = {2011},
	month = {12/2011},
	pages = {27-33},
	publisher = {University of West Bohemia, Pilsen},
	address = {Pilsen, Czech Republic},
	abstract = {A P system represents a distributed and parallel computing model in which basic data
structures are, for instance, multisets and strings. Enzymatic Numerical P Systems are a type of
P systems whose basic data structures are sets of numerical variables. Separately, GPGPU is a
novel technological paradigm which focuses on the development of tools for graphic cards to solve
general purpose problems. This paper proposes an ENPS simulator based on GPUs and presents
general concepts about its design and some future ideas and perspectives.},
	keywords = {CUDA, ENPS, GPU, Membrane computing, simulation},
	url = {http://beyondai.zcu.cz/files/BAI2011_proceedings.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {828,
	title = {The Infobiotics Workbench: an integrated in silico modelling platform for Systems and Synthetic Biology},
	journal = {Bioinformatics},
	volume = {27},
	year = {2011},
	month = {12/2011},
	pages = {3323-3324},
	publisher = {Oxford},
	address = {Oxford, U.K.},
	issn = {1367-4803},
	url = {http://www.ncbi.nlm.nih.gov/pubmed?term=\%22Blakes\%20J\%22\%5BAuthor\%5D},
	author = {Johnathan Blakes and Jamie Twycross and Francisco J. Romero-Campero and Natalio Krasnogor}
}
@article {802,
	title = {Spiking Neural P System Simulations on a High Performance GPU Platform},
	journal = {Lecture Notes in Computer Science},
	volume = {7017},
	year = {2011},
	note = {Algorithms and Architectures for Parallel Processing
ICA3PP Workshops, (ADCN 2011)},
	month = {10/2011},
	pages = {99-108},
	publisher = {Springer},
	edition = {ICA3PP 2011 Workshops, Part II},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present our results in adapting a Spiking Neural P system (SNP system) simulator to a high performance graphics
processing unit (GPU) platform. In particular, we extend our simulations to larger and more complex SNP systems using an NVIDIA Tesla C1060
GPU. The C1060 is manufactured for high performance computing and massively parallel computations, matching the maximally parallel nature of SNP systems. Using our GPU accelerated simulations we present speedups of around 200{\texttimes} for some SNP systems, compared to CPU only
simulations.
},
	isbn = {978-3-642-24668-5},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-24669-2_10},
	url = {http://www.springerlink.com/content/f490qnv027884g27/},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Yang Xiang and Alfredo Cuzzocrea and Michael Hobbs and Wanlei Zhou}
}
@article {795,
	title = {An Improved GPU Simulator for Spiking Neural P Systems},
	journal = {Sixth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)},
	year = {2011},
	month = {09/2011},
	pages = {262 - 267},
	address = {Penang, Malaysia},
	abstract = {Spiking Neural P (SNP) systems, variants of Psystems (under Membrane and Natural computing), are computing models that acquire abstraction and inspiration from the way neurons {\textquoteright}compute{\textquoteright} or process information. Similar to other P system variants, SNP systems are Turing complete models that by nature compute non-deterministically and in a maximally parallel manner. P systems usually trade (often exponential) space for (polynomial to constant) time. Due to this nature, P system variants are currently limited to parallel simulations, and several variants have already been simulated in parallel devices. In this paper we present an improved SNP system simulator based on graphics processing units (GPUs). Among other reasons, current GPUs are architectured for massively parallel computations, thus making GPUs very suitable for SNP system simulation. The computing model, hardware/software considerations, and simulation algorithm are presented, as well as the comparisons of the CPU only and CPU-GPU based simulators.},
	isbn = {978-1-4577-1092-6},
	doi = {10.1109/BIC-TA.2011.37 },
	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6046910},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {792,
	title = {Looking for small efficient P systems},
	journal = {Fundamenta Informaticae},
	volume = {110},
	year = {2011},
	month = {09/2011},
	pages = {295-308},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {In 1936 A. Turing showed the existence of a universal machine able to simulate any Turing machine given its description. In 1956, C. Shannon formulated for the first time the problem of finding the smallest possible universal Turing machine according to some critera to measure its size such as the number of states and symbols. Within the framework of Membrane Computing different studies have addressed this problem: small universal symport/antiport P systems (by considering the number of membranes, the weight of the rules and the number of objects as a measure of the size of the system), small universal splicing P systems (by considering the number of rules as a measure of the size of the system), and small universal spiking neural P systems (by considering the number of neurons as a measure of the size of the system). In this paper the problem of determining the smallest possible efficient P system is explicitly formulated. Efficiency within the framework of Membrane Computing refers to the capability of solving computationally hard problems (i.e. problems such that classical electronic computer cannot solve instances of medium/large size in any reasonable amount of time) in polynomial time. A descriptive measure to define precisely the notion of small P system is presented in this paper.},
	keywords = {Membrane computing, SAT problem, Small effcient P systems, Small universal P Systems},
	issn = {0169-2968},
	doi = {10.3233/FI-2011-544},
	url = {http://iospress.metapress.com/content/a602986l41270452/?p=a7b191063cc84e26b09025bfd0833931\&pi=21},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font and Francisco J. Romero-Campero}
}
@article {803,
	title = {A Uniform Solution to Common Algorithmic Problem by Tissue P Systems with Cell Division},
	journal = {Sixth International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2011},
	year = {2011},
	month = {09/2011},
	pages = {302-326},
	publisher = {IEEE Computer Society},
	address = {Penang, Malaysia},
	abstract = {Common algorithmic problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. A tissue P system with cell division is a computing model which has two basic characters: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. We here present an effective solution to the common algorithmic decision problem using a family of recognizer tissue P systems with cell division.},
	isbn = {978-1-4577-1092-6},
	doi = {10.1109/BIC-TA.2011.43  },
	author = {Yunyun Niu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {R. Abdullah and A.T. Khader and I. Venkat and Li-Pei Wong and K. G. Subramanian}
}
@article {827,
	title = {A computational study of liposome logic: towards cellular computing from the bottom up},
	journal = {Systems and Synthetic Biology},
	volume = {4},
	year = {2011},
	month = {09/2010},
	pages = {157-179},
	publisher = {Springer},
	address = {Berlin, Germany},
	abstract = {n this paper we propose a new bottom-up approach to cellular computing, in which computational chemical processes are encapsulated within liposomes. This "liposome logic" approach (also called vesicle computing) makes use of supra-molecular chemistry constructs, e.g. protocells, chells, etc. as minimal cellular platforms to which logical functionality can be added. Modeling and simulations feature prominently in "top-down" synthetic biology, particularly in the specification, design and implementation of logic circuits through bacterial genome reengineering. The second contribution in this paper is the demonstration of a novel set of tools for the specification, modelling and analysis of "bottom-up" liposome logic. In particular, simulation and modelling techniques are used to analyse some example liposome logic designs, ranging from relatively simple NOT gates and NAND gates to SR-Latches, D Flip-Flops all the way to 3 bit ripple counters. The approach we propose consists of specifying, by means of P systems, gene regulatory network-like systems operating inside proto-membranes. This P systems specification can be automatically translated and executed through a multiscaled pipeline composed of dissipative particle dynamics (DPD) simulator and Gillespie{\textquoteright}s stochastic simulation algorithm (SSA). Finally, model selection and analysis can be performed through a model checking phase. This is the first paper we are aware of that brings to bear formal specifications, DPD, SSA and model checking to the problem of modeling target computational functionality in protocells. Potential chemical routes for the laboratory implementation of these simulations are also discussed thus for the first time suggesting a potentially realistic physiochemical implementation for membrane computing from the bottom-up.},
	issn = {1872-5325},
	url = {http://www.ncbi.nlm.nih.gov/pubmed/21886681},
	author = {James Smaldon and Francisco J. Romero-Campero and Francisco Fern{\'a}ndez-Trillo and Marian Gheorghe and Cameron Alexander and Natalio Krasnogor}
}
@article {788,
	title = {Formal Verication of P Systems with Active Membranes through Model Checking},
	journal = {12th International Conference on Membrane Computing (CMC12)},
	year = {2011},
	month = {08/2011},
	pages = {241-252},
	address = {Fontainebleau, France},
	abstract = {Formal verification of P systems using model checking has
attracted a significant amount of research in recent years. However, up
to now only P systems with static structure have been considered. This
paper makes significant advances in this area by considering P systems
with active membranes, in particular P systems with division rules. The
paper presents a theoretical framework for addressing this problem and
reports on a complex case study involving a well-known NP-complete
problem solved using P systems with membrane division rules. This is
implemented in Promela and non trivial properties are verified using
Spin.},
	url = {http://cmc12.lacl.fr/cmc12proceedings.pdf},
	author = {Florentin Ipate and Raluca Lefticaru and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Cristina Tudose}
}
@article {789,
	title = {A P-Lingua based Simulator for Spiking Neural P Systems},
	journal = {Proceedings of the 12th International Conference on Membrane Computing (CMC12)},
	year = {2011},
	month = {08/2011},
	pages = {323-346},
	address = {Fontainebleau, France},
	abstract = {The research within the field of Spiking Neural P systems
(SN P systems, for short) is focusing mainly in the study of the
computational complexity and efficiency of this kind of systems.
These devices have been shown capable of providing polynomial time
solutions to computationally hard problems. In order to experimentally
explore this computational power, it is necessary to develop software
that provides simulation tools (simulators) for the existing variety of
SN P systems. Such simulators allow us to carry out computations of
solutions to computationally hard problems on certain instances. Within
this trend, P-Lingua provides a standard language for the definition of
P systems. As part of the same project, pLinguaCore library provides
particular implementations of parsers and simulators for the models
specified in P-Lingua. In this paper, an extension of the P-Lingua
language to define SN P systems is presented, along with an upgrade
of pLinguaCore including a parser and a new simulator for the variants
of these systems included in the language.},
	url = {http://cmc12.lacl.fr/cmc12proceedings.pdf},
	author = {Luis F. Mac{\'\i}as-Ramos and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {786,
	title = {Proceedings of the 12th International Conference on Membrane Computing (CMC12). Preface},
	journal = {Proceedings of the 12th International Conference on Membrane Computing (CMC12)},
	year = {2011},
	month = {08/2011},
	pages = {i-iii},
	address = {Fontainebleau, France},
	url = {http://cmc12.lacl.fr/cmc12proceedings.pdf},
	author = {Marian Gheorghe and Gheorghe Paun and Sergey Verlan}
}
@article {787,
	title = {A Spiking Neural P system simulator based on CUDA},
	journal = {12th International Conference on Membrane Computing (CMC12)},
	year = {2011},
	month = {08/2011},
	pages = {77-92},
	address = {Fontainebleau, France},
	abstract = {In this paper we present a Spiking Neural P system (SNP
system) simulator based on graphics processing units (GPUs). In particular
we implement the simulator using NVIDIA CUDA enabled GPUs.
The massively parallel architecture of current GPUs is very suitable for
the maximally parallel computations of SNP systems. We simulate a
wider variety of SNP systems, after presenting a previous work on SNP
system matrix representation which led to their simulation in GPUs, and
the simulation algorithm included here. Finally, we compare and present
the performance speedups of the CPU-GPU based simulator over the
CPU only simulator.},
	keywords = {CUDA, GPU Computing, Membrane computing, parallel computing, spiking neural P systems},
	url = {http://cmc12.lacl.fr/cmc12proceedings.pdf},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {778,
	title = {Spiking neural P systems with neuron division and budding},
	journal = {Science China. Information Sciences},
	volume = {8},
	year = {2011},
	month = {08/2011},
	pages = {1596-1607},
	publisher = {Springer},
	edition = {54},
	address = {Beijing, China},
	abstract = {Spiking neural P systems are a class of distributed and parallel computing models inspired by spiking neurons. In this work, the features of neuron division and neuron budding are introduced into the framework of spiking neural P systems, which are processes inspired by neural stem cell division. With neuron division and neuron budding, a spiking neural P system can generate exponential work space in polynomial time as the case for P systems with active membranes. In this way, spiking neural P systems can efficiently solve computationally hard problems by means of a space-time tradeoff, which is illustrated with an efficient solution to SAT problem. },
	keywords = {Membrane computing, Natural computing, neuron division, Spiking neural P system},
	issn = {1674-733X},
	doi = {10.1007/s11432-011-4303-y},
	url = {http://www.springerlink.com/content/h583132743t72273/},
	author = {Linqiang Pan and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {726,
	title = {Modeling population growth of Pyrenean Chamois (Rupicapra p. pyrenaica) by using P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	month = {08/2010},
	pages = {144-159},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {P systems provide a high level computational modeling framework which integrates the structural and dynamic aspects of ecosystems in a comprehensive and relevant way. In previous works, several ecosystems modeled by using P systems were presented. The good results obtained encourage us to study new ecosystems such as the one presented in this paper. Pyrenean Chamois (Rupicapra p. pyrenaica) is an ungulate species inhabiting the Catalan Pyrenees. In recent years, several diseases have caused a drastic decrease in the number of individuals. Since they provide significant economic contributions in the area and constitutes an important food resource for obligate and facultative scavengers, it is very interesting to provide a model in order to facilitate the management of their ecosystems},
	isbn = {78-3-86805-721-8},
	issn = {0302-9743},
	url = {http://springerlink.com/content/y87522j29m145434},
	author = {M. Angels Colomer and Santiago Lav{\'\i}n and Ignasi Marco and Antoni Margalida and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy and Eduardo Serrano and Luis Valencia-Cabrera}
}
@article {805,
	title = {Guest Editorial Preface. Special Issue on Membrane Computing},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	month = {07/2011},
	pages = {i-iii},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011070105},
	url = {http://www.igi-global.com/journal/international-journal-natural-computing-research/1148},
	author = {Pierluigi Frisco and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {804,
	title = {Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	month = {07/2011},
	pages = {49-60},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices {\textendash} tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.},
	keywords = {cryptography, Membrane computing, Polynomial-Time Algorithm, Prime Factorization, Tissue P System},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011070105},
	url = {http://www.igi-global.com/article/linear-time-solution-prime-factorization/58066},
	author = {Xingyi Zhang and Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {806,
	title = {Local Search with P Systems: A Case Study},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	month = {07/2011},
	pages = {47-55},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {Local search is currently one of the most used methods for finding solutions in real-life problems. It is usually
considered when the research is interested in the final solution of the problem instead of the how the solution
is reached. In this paper, the authors present an implementation of local search with Membrane Computing
techniques applied to the N-queens problem as a case study. A CLIPS program inspired in the Membrane
Computing design has been implemented and several experiments have been performed. The obtained results
show better average times than those obtained with other Membrane Computing implementations that solve
the N-queens problem.},
	keywords = {CLIPS, Local Search, Membrane computing, N-Queens, P systems, Problem},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011070105},
	url = {http://www.igi-global.com/article/local-search-systems/57970},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {723,
	title = {A New Way to Obtain Homology Groups in Binary 2D Images Using Membrane Computing},
	journal = {XII Encuentro de Algebra Computacional y Aplicaciones EACA 2010},
	year = {2011},
	month = {07/2010},
	pages = {107-112},
	publisher = {Universidade de Santiago de Compostela Publicaci{\'o}ns},
	address = {Santiago de Compostela, Spain},
	isbn = {978-84-9887-518-8 },
	url = {http://www.usc.es/regaca/eaca2010/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Pedro  Real and Vanesa S{\'a}nchez-Canales}
}
@article {718,
	title = {Computation of Rumsey numbers by P systems with active membranes},
	journal = {International Journal of Foundations of Computer Science},
	volume = {22},
	year = {2011},
	month = {06/2011},
	pages = {29-38},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	author = {Linqiang Pan and Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {844,
	title = {Current developments on computational modeling using P Systems},
	journal = {Computability in Europe 2011 (CIE 2011), },
	year = {2011},
	month = {06/2011},
	pages = {250-251},
	publisher = {Springer Verlag},
	address = {Sofia, Bulgaria},
	isbn = {978-3-642-21874-3},
	url = {http://cie2011.fmi.uni-sofia.bg},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {833,
	title = {Membrane Computing at Twelve Years(Back to Turku). UC 2011:},
	journal = {Lecture Notes in Computer Science},
	year = {2011},
	month = {06/2011},
	pages = {36-37},
	publisher = {Springer-Verlag},
	address = {Turku, Finland},
	isbn = {978-3-642-21340-3},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-21341-0},
	url = {http://www.springerlink.com/content/978-3-642-21340-3/$\#$section=905126\&page=1},
	author = {Gheorghe Paun}
}
@article {766,
	title = {A software tool for generating graphics by means of P systems},
	journal = {Natural Computing},
	volume = {10},
	year = {2011},
	month = {06/2011},
	pages = {879-890},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {The hand-made graphical representation of the configuration of a P system becomes a hard task when the number of membranes and objects increases. In this paper we present a new software tool, called JPLANT, for computing and representing the evolution of a P system model with membrane creation. We also present some experiments performed with JPLANT and point out new lines for the research in computer graphics with membrane systems. },
	keywords = {Graphical representation, Membrane computing, P systems, Software},
	issn = {1567-7818 },
	doi = {10.1007/s11047-010-9198-9},
	url = {http://dx.doi.org/10.1007/s11047-010-9198-9},
	author = {Elena Rivero-Gil and Miguel A. Guti{\'e}rrez-Naranjo and {\'A}lvaro Romero-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {771,
	title = {A tissue P systems based uniform solution to Tripartite Matching problem},
	journal = {Fundamenta Informaticae},
	volume = {109},
	year = {2011},
	month = {06/2011},
	pages = {179-188},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	url = {http://www.mimuw.edu.pl/~fundam/FI/previous/abs109.html},
	author = {Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez and Miquel Rius-Font}
}
@article {744,
	title = {P and dP automata: A survey},
	journal = {Lecture Notes in Computer Science},
	volume = {6570},
	year = {2011},
	month = {04/2011},
	pages = {102-115},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {This is a quick survey of basic notions and results related to P automata (P systems with symport/antiport rules working in the accepting mode), with some emphasis on the recently introduced dP automata (a distributed version of the standard P automata), ending with some open problems and research topics which we find of interest in this area. },
	isbn = {978-3-642-19390-3},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-19391-0},
	url = {http://www.springerlink.com/content/1x4w1580260x4833/},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Cristian Calude and Grzegorz Rozenberg and Arto Salomaa}
}
@article {748,
	title = {The Spanish Network on Biomolecular and Biocellular Computing: Bio-inspired Natural Computing in Spain},
	journal = {ERCIM (European Research Consortium for Informatics)},
	volume = {85},
	year = {2011},
	month = {04/2011},
	pages = {25},
	publisher = {ERCIM EEIG},
	address = {Cedex, France},
	abstract = {The Spanish Network on Biomolecular and Biocellular Computing (Redbiocom) is a consortium of seven Spanish
research groups whose research activities focus on the bio-inspired approach to Natural Computing. The Network
was founded in 2009 and it was funded by the Spanish Ministry of Science and Innovation under the
Complementary Action TIN2008-04487-E/TIN.},
	issn = {0926-4981},
	url = {http://ercim-news.ercim.eu/},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Alfonso Ortega and Jos{\'e} M. Sempere}
}
@article {831,
	title = {Foreword. Natural Computing 10(1): 1-2 (2011)},
	journal = {Natural Computing},
	volume = {10},
	year = {2011},
	month = {03/2011},
	pages = {1-2},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	issn = {1567-7818},
	doi = {10.1007/s11047-010-9203-3},
	url = {http://www.springerlink.com/content/k48814x5m1921311/},
	author = {Giuditta Franco and Gheorghe Paun}
}
@article {738,
	title = {Spiking neural P system without delay simulator implementation using GPGPUs},
	journal = {Eleventh Philippine Computing Science Congress},
	year = {2011},
	month = {03/2011},
	pages = {35-43},
	publisher = {Computing Society of the Philippines},
	address = {Naga, Philippines},
	issn = {1908-1146},
	url = {https://sites.google.com/a/dcs.upd.edu.ph/csp-proceedings/pcsc2011},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {760,
	title = {Designing Tissue-like P Systems for Image Segmentation on Parallel Architectures},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {43-62},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Problems associated with the treatment of digital images have several in-
teresting features from a bio-inspired point of view. One of them is that they can be
suitable for parallel processing, since the same sequential algorithm is usually applied in
different regions of the image. In this paper we report a work-in-progress of a hardware
implementation in Field Programmable Gate Arrays (FPGAs) of a family of tissue-like
P systems which solves the segmentation problem in digital images.},
	url = {http://www.gcn.us.es/9BWMC/volume/03tissue_fpga.pdf},
	author = {Javier Carnero and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {756,
	title = {dP automata versus right-linear simple matrix grammars},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {293-304},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {We consider dP automata with the input string distributed in an arbitrary
(hence not necessary balanced) way, and we investigate their language accepting power,
both in the case when a bound there is on the number of objects present inside the system
and in the general case. The relation with right-linear simple matrix grammars is useful
in this respect. Some research topics and open problems are also formulated.},
	url = {http://www.gcn.us.es/9BWMC/volume/21dPsystemsCris.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {763,
	title = {Forward and Backward Chaining with P Systems},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {221-236},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {On the one hand, one of the concepts which lies at the basis of membrane
computing is the multiset rewriting rule. On the other hand, the paradigm of rules is
profusely used in computer science for representing and dealing with knowledge. There-
fore, it makes much scene to establish a "bridge" between these domains, for instance,
by designing P systems reproducing forward and backward chaining which can be used
as tools for reasoning in propositional logic. Our work shows again, how powerful and
intuitive the formalism of membrane computing is and how it can be used to represent
concepts and notions from totally unrelated areas.},
	url = {http://www.gcn.us.es/9BWMC/volume/15fbcpIvanov.pdf},
	author = {Sergiu Ivanov and Artiom Alhazov and Vladimir Rogojin and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {753,
	title = {Implementing local search with Membrane Computing},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {159-168},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Local search is currently one of the most used methods for {\textasciimacron}nding solution
in real-life problems. In this paper we present an implementation of local search with
Membrane Computing techniques applied to the N-queens problem as a case study. A
CLIPS program inspired in the Membrane Computing design has been implemented and
several experiments have been performed.},
	url = {http://www.gcn.us.es/9BWMC/volume/10local_search.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {764,
	title = {Integer Linear Programming for Tissue-like P Systems},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {343-353},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {In this paper we report a work-in-progress whose {\textasciimacron}nal target is the imple-
mentation of tissue-like P system in a cluster of computers which solves some instances
of the segmentation problem in 2D Digital Imagery. We focus on the theoretical aspects
and the problem of choosing a maximal number of application of rules by using Integer
Linear Programming techniques. This study is on the basis of a future distribution of the
parallel work among the processors.},
	url = {http://www.gcn.us.es/9BWMC/volume/25Miguelilp-for-tlp.pdf},
	author = {Ra{\'u}l Reina-Molina and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {758,
	title = {Linear time solution to prime factorization by tissue P systems with cell division},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {355-372},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Prime factorization is useful and crucial for public-key cryptography, and its
application in public-key cryptography is possible only because prime factorization has
been presumed to be di{\textpm}cult. A polynomial-time algorithm for prime factorization on a
quantum computer is given by P. W. Shor in 1997. In this work, a linear-time solution
for prime factorization is given on a kind of biochemical computational devices { tissue
P systems with cell division, instead of physical computational devices.},
	url = {http://www.gcn.us.es/9BWMC/volume/26factorization.pdf},
	author = {Xingyi Zhang and Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {731,
	title = {Membrane Computing 11th International Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected Papers. Preface},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	month = {02/2011},
	pages = {v-vi},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	isbn = {978-3-642-18123-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-18123-8},
	url = {http://www.springerlink.com/content/978-3-642-18122-1$\#$section=843535\&page=4\&locus=0},
	author = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {759,
	title = {A New P System to Model the Subalpine and Alpine Plant Communities},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {91-112},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	url = {http://www.gcn.us.es/9BWMC/volume/06lleida.pdf},
	author = {M. Angels Colomer and Christian Fondevilla and Luis Valencia-Cabrera}
}
@article {761,
	title = {P Systems with Replicator Dynamics: A Proposal},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {63-70},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {This short note proposes some ideas for considering evolutionary game the-
ory in the area of membrane computing.},
	url = {http://www.gcn.us.es/9BWMC/volume/04Matteo.pdf},
	author = {Matteo Cavaliere and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {762,
	title = {Simulating Spiking Neural P Systems Without Delays Using GPUs},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {23-42},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {We present in this paper our work regarding simulating a type of P sys-
tem known as a spiking neural P system (SNP system) using graphics processing units
(GPUs). GPUs, because of their architectural optimization for parallel computations,
are well-suited for highly parallelizable problems. Due to the advent of general purpose
GPU computing in recent years, GPUs are not limited to graphics and video processing
alone, but include computationally intensive scientic and mathematical applications as
well. Moreover P systems, including SNP systems, are inherently and maximally parallel
computing models whose inspirations are taken from the functioning and dynamics of a
living cell. In particular, SNP systems try to give a modest but formal representation of
a special type of cell known as the neuron and their interactions with one another. The
nature of SNP systems allowed their representation as matrices, which is a crucial step
in simulating them on highly parallel devices such as GPUs. The highly parallel nature
of SNP systems necessitate the use of hardware intended for parallel computations. The
simulation algorithms, design considerations, and implementation are presented. Finally,
simulation results, observations, and analyses using an SNP system that generates all
numbers in N - 1 are discussed, as well as recommendations for future work.},
	url = {http://www.gcn.us.es/9BWMC/volume/02snp-gpu.pdf},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {765,
	title = {Smoothing Problem in 2D Images with Tissue-like P Systems and Parallel Implementation},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {317-328},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {Smoothing is often used in Digital Imagery to reduce noise within an image.
In this paper we present a Membrane Computing algorithm for smoothing 2D images in
the framework of tissue-like P systems. The algorithm has been implemented by using a
novel device architecture called CUDATM, (Compute Uni{\textasciimacron}ed Device Architecture). We
present some examples, compare the obtained time and present some research lines for
the future.},
	url = {http://www.gcn.us.es/9BWMC/volume/23smoothing_v5.pdf},
	author = {Francisco Pe{\~n}a-Cantillana and Daniel D{\'\i}az-Pernil and Hepzibah A. Christinal and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {755,
	title = {Spiking Neural dP Systems},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {193-208},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	url = {http://www.gcn.us.es/9BWMC/volume/12multiAlfonso.pdf},
	author = {Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {754,
	title = {Spiking Neural P systems with several types of spikes},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {183-192},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {With a motivation related to gene expression, where enzymes act in series,
somewhat similar to the train spikes traveling along the axons of neurons, we consider
an extension of spiking neural P systems, where several types of \spikes" are allowed.
The power of the obtained spiking neural P systems is investigated and the modeling of
gene expression in these terms is discussed. Some further extensions are mentioned, such
as considering a process of decay in time of the spikes.},
	url = {http://www.gcn.us.es/9BWMC/volume/12multiAlfonso.pdf},
	author = {Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Alfonso Rodr{\'\i}guez-Pat{\'o}n}
}
@article {757,
	title = {Towards bridging two cell-inspired models: P systems and R systems},
	journal = {Ninth Brainstorming Week on Membrane Computing},
	year = {2011},
	month = {02/2011},
	pages = {305-316},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	abstract = {We examine, from the point of view of membrane computing, the two basic
assumptions of reaction systems, the \threshold" and \no permanence" ones. In certain
circumstances (e.g., de{\textasciimacron}ning the successful computations by local halting), the second
assumption can be incorporated in a transition P system or in a symport/antiport P
system without losing the universality. The case of the {\textasciimacron}rst postulate remains open: the
reaction systems deal, deterministically, with {\textasciimacron}nite sets of symbols, which is not of much
interest for computing; three ways to introduce nondeterminism are suggested and left
as research topics.},
	url = {http://www.gcn.us.es/9bwmc_proceedings},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {707,
	title = {A bio-inspired computing model as a new tool for modeling ecosystems: The avian scavengers as a case study},
	journal = {Ecological Modelling},
	volume = {222},
	year = {2011},
	month = {01/2011},
	pages = {33-47 },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {The models used for ecosystems modeling are generally based on differential equations. However, in recent years new computational models based on biological processes, or bioinspired models, have arisen, among which are P systems. These are inspired by the functions of cells and present important advantages with respect to traditional models, such as a high computational efficiency, modularity and their ability to work in parallel. They are simple, individual-based models that use biological parameters that can be obtained experimentally. In this work, we present the framework for a model based on P systems applied to the study of an ecosystem in which three avian scavengers (predators) interact with 10 wild and domestic ungulates (preys). The computation time for 100 repetitions, corresponding to 14 simulation years each, with an initial population composed of 385,422 individuals, was 30 min. Our results suggest that the model presented, based on P systems, correctly simulates the population dynamics in the period of time analyzed. We discuss the usefulness of this tool in simulating complex ecosystems dynamics to aid managers, conservationists and policy-makers in making appropriate decisions for the improvement of management and conservation programs.},
	keywords = {Avian scavengers, Conservation, Ecosystem, P systems},
	issn = {0304-3800},
	doi = {http://dx.doi.org/10.1016/j.ecolmodel.2010.09.012},
	url = {http://dx.doi.org/10.1016/j.ecolmodel.2010.09.012},
	author = {M. Angels Colomer and Antoni Margalida and Delf{\'\i} Sanuy and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {829,
	title = { Deterministic and stochastic P systems for modelling cellular processes},
	journal = {Natural Computing},
	volume = {9},
	year = {2011},
	pages = {457-473},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {This paper presents two approaches based on metabolic and stochastic P systems, together with their associated analysis methods, for modelling biological systems and illustrates their use through two case studies.},
	keywords = {Membrane computing, Modelling, P systems, Synthetic Biology, Systems Biology},
	issn = {1567-7818},
	doi = {10.1007/s11047-009-9158-4},
	url = {http://www.springerlink.com/content/p38705n34230m423/},
	author = {Marian Gheorghe and Vincenzo Manca and Francisco J. Romero-Campero}
}
@article {801,
	title = {Comparing simulation algorithms for multienvironment probabilistic P system over a standard virtual ecosystem},
	journal = {Natural Computing},
	volume = {11},
	year = {2011},
	pages = {369-379},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {Membrane Computing has recently proved to be a suitable framework for addressing the modelling of dynamical biological systems in general, and ecosystems in particular. Due to the inherent randomness and uncertainty in biological systems, when designing a model the relevant tasks to be addressed are the validation and virtual experimentation processes, rather than the formal verification. It is therefore crucial to rely on software implementations of efficient simulation algorithms. This paper presents a simple (but realistic enough) ecosystem where a carnivore and several herbivorous species interact. The model of this ecosystem has been used to compare experimentally the performance of two different simulation algorithms. },
	keywords = {Ecosystem modelling, Membrane computing, Probabilistic simulation algorithms},
	issn = {1567-7818},
	doi = {10.1007/s11047-011-9289-2},
	url = {http://www.springerlink.com/content/x20788w42x138967/},
	author = {M. Angels Colomer and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {2113,
	title = {A computational modeling for real ecosystems based on P systems},
	journal = {Natural Computing},
	volume = {10},
	year = {2011},
	pages = {39-53},
	doi = {10.1007/s11047-010-9191-3},
	author = {M. Cardona and M.A. Colomer and Margalida, A. and Palau, A. and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and D. Sanuy}
}
@article {728,
	title = {Depth-First search with P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	pages = {257-264},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The usual way to find a solution for an NP complete problem in Membrane Computing is by brute force algorithms. These solutions work from a theoretical point of view but they are implementable only for small instances of the problem. In this paper we provide a family of P systems which brings techniques from Artificial Intelligence into Membrane Computing and apply them to solve the N-queens problem. },
	isbn = {978-84-9887-518-8},
	issn = {0302-9743},
	url = {http://springerlink.com/content/b48t6171201g6183},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {782,
	title = {Forward and Backward Chaining with P Systems },
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {56-66},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {One of the concepts that lie at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing with knowledge. Therefore, establishing a {\textquotedblleft}bridge{\textquotedblright} between these domains is important, for instance, by designing P systems reproducing the modus ponens-based forward and backward chaining that can be used as tools for reasoning in propositional logic. In this paper, the authors show how powerful and intuitive the formalism of membrane computing is and how it can be used to represent concepts and notions from unrelated areas.},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011040105},
	url = {http://www.igi-global.com/bookstore/article.aspx?titleid=57971},
	author = {Sergiu Ivanov and Artiom Alhazov and Vladimir Rogojin and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {780,
	title = {Guest Editorial Preface Special Issue on Membrane Computing},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {i-iii},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	issn = {1947-928X},
	url = {Guest Editorial Preface Special Issue on Membrane Computing},
	author = {Pierluigi Frisco and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {783,
	title = {Implementation on CUDA of the Smoothing Problem with Tissue-Like P Systems},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {25-34},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {Smoothing is often used in Digital Imagery for improving the quality of an image by reducing its level of noise. This paper presents a parallel implementation of an algorithm for smoothing 2D images in the framework of Membrane Computing. The chosen formal framework has been tissue-like P systems. The algorithm has been implemented by using a novel device architecture called CUDA (Compute Unified Device Architecture) which allows the parallel NVIDIA Graphics Processors Units (GPUs) to solve many complex computational problems. Some examples are presented and compared; research lines for the future are also discussed.},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011070103},
	url = {http://www.igi-global.com/bookstore/article.aspx?titleid=58064},
	author = {Francisco Pe{\~n}a-Cantillana and Daniel D{\'\i}az-Pernil and Hepzibah A. Christinal and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {784,
	title = {Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {49-60},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices {\textendash} tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011070105},
	url = {http://www.igi-global.com/bookstore/article.aspx?titleid=58066},
	author = {Xingyi Zhang and Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {781,
	title = {Local Search with P Systems: A Case Study },
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {47-55},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {Local search is currently one of the most used methods for finding solutions in real-life problems. It is usually considered when the research is interested in the final solution of the problem instead of the how the solution is reached. In this paper, the authors present an implementation of local search with Membrane Computing techniques applied to the N-queens problem as a case study. A CLIPS program inspired in the Membrane Computing design has been implemented and several experiments have been performed. The obtained results show better average times than those obtained with other Membrane Computing implementations that solve the N-queens problem.},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011040104},
	url = {http://www.igi-global.com/bookstore/article.aspx?titleid=57970},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {727,
	title = {Matrix representation of Spiking Neural P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	pages = {377-392},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, a discrete structure representation of SN P systems with extended rules and without delay is proposed. Specifically, matrices are used to represent SN P systems. In order to represent the computations of SN P systems by matrices, configuration vectors are defined to monitor the number of spikes in each neuron at any given configuration; transition net gain vectors are also introduced to quantify the total amount of spikes consumed and produced after the chosen rules are applied. Nondeterminism of the systems is assured by a set of spiking transition vectors that could be used at any given time during the computation. With such matrix representation, it is quite convenient to determine the next configuration from a given configuration, since it involves only multiplication and addition of matrices after deciding the spiking transition vector. },
	isbn = {978-84-9887-518-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-18123-8_29},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-18123-8_29},
	author = {XiangXiang Zeng and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {743,
	title = {Membrane Computing (Tutorial)},
	journal = {Lecture Notes in Computer Science},
	volume = {6714},
	year = {2011},
	pages = {38-39},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	issn = {0302-9743},
	author = {Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {730,
	title = {Membrane Computing 11th International Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected Papers},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	pages = {ix+392},
	publisher = {Springer Verlag ProBusiness Berlin},
	address = {Berlin, Germany},
	isbn = {978-3-642-18123-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-18123-8},
	url = {http://www.springerlink.com/content/978-3-642-18122-1$\#$section=843535\&page=8\&locus=58},
	author = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {732,
	title = {Membrane Computing at Twelve Years},
	journal = {Lecture Notes in Computer Science},
	volume = {6501},
	year = {2011},
	pages = {1-2},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	isbn = {978-3-642-18123-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-18123-8},
	url = {http://www.springerlink.com/content/978-3-642-18122-1$\#$section=843536\&page=1\&locus=-3},
	author = {Gheorghe Paun}
}
@article {768,
	title = {Membrane computing at twelve years. Back to Turku.},
	journal = {Lecture Notes in Computer Science},
	volume = {6714},
	year = {2011},
	pages = {36-37},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The talk is a quick introduction to membrane computing, by briefly presenting twelve basic ideas (in the development of which the author was involved - several other ideas deserve to be mentioned), with some emphasis on two recently investigated notions, the spiking neural P systems (SN P systems, for short), inspired from neural biology, and the dP systems, a distributed class of P systems (initially introduced for so-called symport-antiport P systems, but extended also to SN P systems, a case which is discussed here in some details). },
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/y21846k082434323/},
	author = {Gheorghe Paun}
}
@article {767,
	title = {Notes about spiking neural P systems},
	journal = {Annals of Bucharest University Mathematics-Informatics},
	year = {2011},
	publisher = {Bucharest University Press},
	address = {Bucharest, Romania},
	issn = {1010-5433},
	author = {Mihai Ionescu and Gheorghe Paun}
}
@article {719,
	title = {On a partial affirmative answer for a Paun{\textquoteright}s conjecture},
	journal = {International Journal of Foundations of Computer Science},
	volume = {22},
	year = {2011},
	pages = {55-64},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	author = {Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miguel A. Guti{\'e}rrez-Naranjo and Miquel Rius-Font}
}
@article {777,
	title = {A Parallel Implementation of the Thresholding Problem by Using Tissue-Like P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {6855 },
	year = {2011},
	pages = {277-284},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	issn = {0302-9743},
	url = {http://congreso.us.es/caip2011/},
	author = {Francisco Pe{\~n}a-Cantillana and Daniel D{\'\i}az-Pernil and Ainhoa Berciano and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {832,
	title = {Preface},
	journal = {Fundamenta Informaticae},
	volume = {110},
	year = {2011},
	pages = {1},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	url = {http://fi.mimuw.edu.pl/index.php/FI},
	author = {Juhani Karhumaki and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {779,
	title = {Simulating Spiking Neural P Systems Without Delays Using GPUs},
	journal = {International Journal of Natural Computing Research},
	volume = {2},
	year = {2011},
	pages = {19-31},
	publisher = {IGI Global},
	address = {Hershey, Pennsylvania (USA)},
	abstract = {In this paper, the authors discuss the simulation of a P system variant known as Spiking Neural P systems (SNP systems), using Graphics Processing Units (GPUs). GPUs are well suited for highly parallel computations because of their intentional and massively parallel architecture. General purpose GPU computing has seen the use of GPUs for computationally intensive applications, not just in graphics and video processing. P systems, including SNP systems, are maximally parallel computing models taking inspiration from the functioning and dynamics of a living cell. In particular, SNP systems take inspiration from a type of cell known as a neuron. The nature of SNP systems allowed for their representation as matrices, which is an elegant step toward their simulation on GPUs. In this paper, the simulation algorithms, design considerations, and implementation are presented. Finally, simulation results, observations, and analyses using a simple but non-trivial SNP system as an example are discussed, including recommendations for future work.},
	issn = {1947-928X},
	doi = {10.4018/jncr.2011040102},
	url = {http://www.igi-global.com/bookstore/article.aspx?titleid=57968},
	author = {Francis Cabarle and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {720,
	title = {A simulation algorithm for multienvironment probabilistic P systems: A formal verification},
	journal = {International Journal of Foundations of Computer Science},
	volume = {22},
	year = {2011},
	pages = {107-118},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Fernando Sancho-Caparrini}
}
@article {717,
	title = {Special Issue-Natural Computing: Theory and applications. Preface},
	journal = {International Journal of Foundations of Computer Science},
	volume = {22},
	year = {2011},
	pages = {1-6},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	author = {Rudolf Freund and Marian Gheorghe and Solomon Marcus and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {807,
	title = {Spiking Neural dP Systems},
	journal = {Fundamenta Informaticae},
	volume = {11},
	year = {2011},
	pages = {423-436},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	doi = {10.3233/FI-2011-544},
	url = {http://www.gcn.us.es/9bwmc_proceedings},
	author = {Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {661,
	title = {P systems simulations on massively parallel architectures},
	journal = {Third International Workshop on Parallel Architectures and Bioinspired Algorithms},
	year = {2010},
	note = {Third International Workshop on Parallel Architectures and Bioinspired Algorithms (WPABA{\textquoteright} 10) in conjuntion with the Nineteenth International Conference on Parallel Architectures and Compulations Techniques (PACT{\textquoteright} 10)},
	month = {September 2010},
	pages = {17-26},
	address = {Vienna, Austria},
	abstract = {Membrane Computing is an emergent research area studying the behaviour of living cells to define bio-inspired computing devices, also called P systems. Such devices provide polynomial time solutions to NP-complete problems by trading time for space. The efficient simulation of P systems poses challenges in three different aspects: an intrinsic massively parallelism of P systems, an exponential computational workspace, and a non-intensive floating point nature. In this paper, we analyze the simulation of a family of recognizer P systems with active membranes that solves the Satisfiability (SAT) problem in linear time on three different architectures: a shared memory system, a distributed memory system, and a set of Graphics Processing Units (GPUs). For an efficient handling of the exponential workspace created by the P systems computation, we enable different data policies on those architectures to increase memory bandwidth and exploit data locality through tiling. Parallelism inherent to the target P system is also managed on each architecture to demonstrate that GPUs offer a valid alternative for high-performance computing at a considerably lower cost: Considering the largest problem size we were able to run on the three parallel platforms involving four processors, execution times were 20049.70 ms. using OpenMP on the shared memory multiprocessor, 4954.03 ms. using MPI on the distributed memory multiprocessor and 565.56 ms. using CUDA in our four GPUs, which results in speed factors of 35.44x and 8.75x, respectively. },
	isbn = {978-84-693-6141-2},
	url = {http://bioinspired.dacya.ucm.es/lib/exe/fetch.php?media=wpaba2010proc.pdf},
	author = {Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Gin{\'e}s D. Guerrero and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez and Manuel Ujald{\'o}n}
}
@article {660,
	title = {Enhancing the Simulation of P Systems for the SAT Problem on GPUs},
	journal = { Symposium on Application Accelerators in High Performance Computing},
	year = {2010},
	month = {July 2010},
	address = {Knoxville, USA},
	abstract = {GPUs constitute nowadays a solid alternative for
high performance computing, and the advent of CUDA/OpenCL
allow programmers a friendly model to accelerate a broad range
of applications. The way GPUs exploit parallelism differ from
multi-core CPUs, which raises new challenges to take advantage
of its tremendous computing power. In this respect, P systems or
Membrane Systems provide a high-level computational modeling
framework that combines the structure and dynamic aspects
of biological systems while being inherently parallel and non-
deterministic. In this work, we implement on GPUs the simula-
tion for a solution provided by Membrane Computing to solve the
Satisfiability (SAT) problem. The overall speed up reaches 100x
versus a sequential CPU, with an additional 16x due to CUDA
optimizations. A promising scalability is also proven on more
sophisticated GPU clusters and/or demanding problem sizes.},
	url = {http://saahpc.ncsa.illinois.edu/10/agenda.html},
	author = {Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Jos{\'e} M. Garc{\'\i}a and Miguel A. Mart{\'\i}nez-del-Amor and Mario J. P{\'e}rez-Jim{\'e}nez and Manuel Ujald{\'o}n}
}
@article {663,
	title = {Depth-first Search with P Systems},
	journal = {Eleventh International Conference on Membrane Computing (CMC11)},
	year = {2010},
	month = {August 2010},
	pages = {257-267 },
	publisher = {Pro BUSINESS GmbH},
	address = {Jena, Germany},
	abstract = {The usual way to find a solution for an NP complete problem
with Membrane Computing techniques is by brute force algorithms
where all the feasible solutions are generated and they are checked simultaneously
by using massive parallelism. These solutions work from
a theoretical point of view but they are implementable only for small
instances of the problem. In this paper we provide a family of P systems
which brings techniques from Artificial Intelligence into Membrane
Computing and apply them to solve the N-queens problem.},
	isbn = {978-3-86805-721-8},
	url = {http://cmc11.uni-jena.de/proceedings/gutierrez.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun}
}
@article {612,
	title = {Computational Complexity in Membrane Computing},
	journal = {Algebraic Computing, Soft Computing, and Program Verification},
	year = {2010},
	month = {April 2010},
	address = {Castro Urdiales, Spain},
	url = {http://www.gimac.uma.es/hard\&soft2010/Home.html},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {610,
	title = {Length of rules and tractability in tissue-like P systems},
	journal = {Algebraic Computing, Soft Computing, and Program Verification},
	year = {2010},
	month = {April 2010},
	address = {Castro Urdiales, Spain},
	url = {http://www.gimac.uma.es/hard\&soft2010/Home.html},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Ignacio P{\'e}rez-Hurtado}
}
@article {611,
	title = {P-Lingua: a programming language for membrane computing},
	journal = {Algebraic Computing, Soft Computing, and Program Verification},
	year = {2010},
	month = {April 2010},
	address = {Castro Urdiales, Spain},
	url = {http://www.gimac.uma.es/hard\&soft2010/Home.html},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Ignacio P{\'e}rez-Hurtado}
}
@article {659,
	title = {An Overview of P System Simulation on GPUs},
	journal = {I Jornadas J{\'o}venes Investigadores},
	year = {2010},
	month = {17 April 2010},
	pages = {2-7},
	address = {C{\'a}ceres, Spain},
	abstract = {P systems are inherently non-deterministic and parallel theoretical computing devices defined inside the research field of Membrane Computing. Many P system simulators have been presented in this area, but they are inefficient since they can not handle the parallelism of these devices. Nowadays,
we are witnessing the consolidation of the GPUs as a parallel framework to compute general purpose applications. In [1], GPUs are presented as an alternative parallel architecture to improve the performance in the simulation of P systems. In this paper, we present the state of the art in the simulation of P systems with active membranes, showing the simulator developed so far, and providing some aspects to consider in order to improve the performance.
},
	isbn = {978-84-693-1707-5},
	url = {http://www.jovenesinvestigadores.com/},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Ignacio P{\'e}rez-Hurtado}
}
@article {658,
	title = {Spiking Neural P Systems with Weights},
	journal = {Neural Computation},
	volume = {22},
	year = {2010},
	month = {10/2010},
	pages = {2615-2646},
	publisher = {MIT Press},
	address = {Massachusets, USA},
	abstract = {A variant of spiking neural P systems with positive or negative weights on synapses is introduced, where the rules of a neuron fire when the potential of that neuron equals a given value. The involved values{\textemdash}weights, firing thresholds, potential consumed by each rule{\textemdash}can be real (computable) numbers, rational numbers, integers, and natural numbers. The power of the obtained systems is investigated. For instance, it is proved that integers (very restricted: 1, -1 for weights, 1 and 2 for firing thresholds, and as parameters in the rules) suffice for computing all Turing computable sets of numbers in both the generative and the accepting modes. When only natural numbers are used, a characterization of the family of semilinear sets of numbers is obtained. It is shown that spiking neural P systems with weights can efficiently solve computationally hard problems in a nondeterministic way. Some open problems and suggestions for further research are formulated.},
	issn = {0899-7667},
	doi = {10.1162/NECO_a_00022},
	url = {http://www.mitpressjournals.org/doi/abs/10.1162/NECO_a_00022},
	author = {Jun Wang and Hendrik J. Hoogeboom and Linqiang Pan and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {664,
	title = {A Bio-inspired Software for Segmenting Digital Images},
	journal = {2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications BIC-TA},
	volume = {2},
	year = {2010},
	month = {09/2010},
	pages = {1377-1381 },
	publisher = {IEEE, Inc.},
	address = {Liverpool, UK},
	isbn = {978-1-4244-6438-8},
	url = {http://bic-ta.hnu.cn/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Helena Molina-Abril and Pedro  Real},
	editor = {Atulya Nagar and R. Thamburaj and K. Li and Z. Tang and R. Li}
}
@article {671,
	title = {Computing Homology Groups in Binary 2D Imagery by Tissue-like P Systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {13},
	year = {2010},
	month = {09/2010},
	pages = {141-152},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. This is a classical problem in Homology Theory which tries to calculate the number of connected components and the representative curves of the holes of these components from a given binary 2D image. To this aim, we present a family of P systems which solves all the instances of the problem in the framework of Tissue-like P systems with catalysts. This is a new framework which combines the membrane structure and symport-antiport communication rules of tissue-like P systems with the power of catalysts.},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum13/Number13_2/abstracts.htm$\#$4},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Pedro  Real and Vanesa S{\'a}nchez-Canales}
}
@article {672,
	title = {Foreword. Special issue on Membrane Computing},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {13},
	year = {2010},
	month = {09/2010},
	pages = {111-112},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum13/Number13_2/cuprins13_2.htm},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {696,
	title = {A new simulation algorithm for multienvironment probabilistic P systems},
	journal = {IEEE Fifth International Conference on Bio-inpired Computing: Theories and Applications (BIC-TA 2010)},
	volume = {1},
	year = {2010},
	month = {09/2010},
	pages = {59-68},
	publisher = {IEEE Press.},
	address = {Changsha, China},
	abstract = {Multienvironment P systems are the base of a
general framework for modeling ecosystems dynamics. On one
hand, this modeling framework represents the structural and
dynamical aspects of real ecosystems in a discrete, modular and
compressive way. On the other hand, the inherent randomness
and uncertainty of biological systems are captured by using
probabilistic strategies. Nowadays, the simulation of these P
systems based models is fundamental for experimentation and
validation. In this paper, we introduce a new simulation algorithm,
called DNDP, which performs object distribution and
maximal consistency in the application of rules, that are crucial
aspects of these systems.
The paper also depicts a parallel implementation of the
algorithm, and a comparison with the existing algorithm in
PLinguaCore is provided. In order to test the performance of the
presented algorithm, several experiments (simulations) have been
carried out over four simple P systems with the same skeleton
and different number of environments.},
	isbn = {978-1-4244-6439-5},
	url = {http://www.cs.us.es/~marper/investigacion/dndp.pdf},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and M. Angels Colomer},
	editor = {K. Li and Z. Tang and R. Li and Atulya Nagar and R. Thamburaj}
}
@article {673,
	title = {On Communication Complexity in Evolution-Communication P Systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {13},
	year = {2010},
	month = {09/2010},
	pages = {113-130},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {Looking for a theory of communication complexity for P systems, we consider here so-called evolution-communication (EC for short) P systems, where objects evolve by multiset rewriting rules without target commands and pass through membranes by means of symport/antiport rules. We first propose a way to measure the communication costs by means of {\textquotedblleft}quanta of energy{\textquotedblright} (produced by evolution rules and) consumed by communication rules. EC P systems with such costs are proved to be Turing complete in all three cases with respect to the relation between evolution and communication operations: priority of communication, mixing the rules without priority for any type, priority of evolution (with the cost of communication increasing in this ordering in the universality proofs).
More appropriate measures of communication complexity are then defined, as dynamical parameters, counting the communication steps or the number (and the weight) of communication rules used during a computation. Such parameters can be used in three ways: as properties of P systems (considering the families of sets of numbers generated by systems with a given communication complexity), as conditions to be imposed on computations (accepting only those computations with a communication complexity bounded by a given threshold), and as standard complexity measures (defining the class of problems which can be solved by P systems with a bounded complexity). Because we ignore the evolution steps, in all three cases it makes sense to consider hierarchies starting with finite complexity thresholds. We only give some preliminary results about these hierarchies (for instance, proving that already their lower levels contain complex {\textendash} e.g., non-semilinear {\textendash} sets), and we leave open many problems and research issues.},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum13/Number13_2/abstracts.htm$\#$2},
	author = {Henry Adorna and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {698,
	title = {Simulating Tritrophic Interactions by Means of P Systems},
	journal = {IEEE Fifth International Conference on Bio-inpired Computing: Theories and Applications (BIC-TA 2010)},
	volume = {2},
	year = {2010},
	month = {09/2010},
	pages = {637-643},
	publisher = {IEEE Press.},
	address = {Liverpool, UK},
	abstract = {P systems provide a high level computational modelling
framework that combines the structural and dynamical
aspects of ecosystems in a compressive and relevant way. The
inherent randomness and uncertainty in biological systems is
captured by using probabilistic strategies. The design of efficient
simulation algorithms in order to reproduce the behavior of these
computational models over conventional computers is fundamental
for the validation and virtual experimentation processes.
In this paper, we describe the modelling framework and two
different simulation algorithms. As a case study, a P system
based model of an ideal ecosystem with three trophic levels is
designed and simulated by both simulation algorithms, providing
comparisons of efficiency between them.},
	isbn = {978-1-4244-6438-8},
	url = {http://www.cs.us.es/~marper/investigacion/tritrophic.pdf},
	author = {M. Angels Colomer and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Atulya Nagar and R. Thamburaj and K. Li and Z. Tang and R. Li}
}
@article {682,
	title = {Solving Sudoku with Membrane Computing},
	journal = {2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications BIC-TA},
	volume = {I},
	year = {2010},
	month = {09/2010},
	pages = {610-615 },
	publisher = {IEEE, Inc.},
	address = {Changsha, China},
	isbn = {978-1-4244-6438-8},
	url = {http://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=16823},
	author = {Daniel D{\'\i}az-Pernil and Carlos M. Fern{\'a}ndez-M{\'a}rquez and Manuel Garc{\'\i}a-Quismondo and Miguel A. Guti{\'e}rrez-Naranjo and Miguel A. Mart{\'\i}nez-del-Amor},
	editor = {K. Li and Z. Tang and R. Li and Atulya Nagar and R. Thamburaj}
}
@article {670,
	title = {Thresholding of 2D Images with Cell-like P Systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {13},
	year = {2010},
	month = {09/2010},
	pages = {131-140},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {Thresholding is the process of splitting a digital image into sets of pixels in order to make it easier to analyze. Pixels are ordered according to a scale of one of their features as brightness or color and the final image is obtained by comparing the measure of the feature with some thresholds. In this paper we present a family of cell-like P systems which solve the thresholding problem in linear time on the number of pixels},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum13/Number13_2/abstracts.htm$\#$3},
	author = {Hepzibah A. Christinal and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {697,
	title = {A uniform framework for modeling based on P Systems},
	journal = {IEEE Fifth International Conference on Bio-inpired Computing: Theories and Applications (BIC-TA 2010)},
	volume = {1},
	year = {2010},
	month = {09/2010},
	pages = {616-621},
	publisher = {IEEE Press.},
	address = {Changsha, China},
	abstract = {In this paper, a P systems based general framework
for modeling the dynamics of a population biology is presented.
Multienvironment probabilistic functional P systems with active
membranes provide the syntactical specification, and the semantics
is captured by using stochastic or probabilistic strategies
implemented through simulation algorithms.},
	isbn = {978-1-4244-6439-5},
	url = {http://www.cs.us.es/~marper/investigacion/marco-bicta-2010.pdf},
	author = {M. Angels Colomer and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {K. Li and Z. Tang and R. Li and Atulya Nagar and R. Thamburaj}
}
@article {699,
	title = {Matrix representation of Spiking Neural P Systems},
	journal = {Eleventh International Conference on Membrane Computing (CMC11)},
	year = {2010},
	month = {08/2010},
	pages = {425-439},
	publisher = {Verlag ProBusiness Berlin},
	address = {Jena, Germany},
	abstract = {Spiking neural P systems (SN P systems, for short) are a
class of distributed parallel computing devices inspired from the way neurons
communicate by means of spikes. In this work, a discrete structure
representation of SN P systems with extended rules and without delay is
proposed. Specifically, matrices are used to represent SN P systems. In
order to represent the computations of SN P systems by matrices, configuration
vectors are defined to monitor the number of spikes in each
neuron at any given configuration; transition net gain vectors are also
introduced to quantify the total amount of spikes consumed and produced
after the chosen rules are applied. Nondeterminism of the systems
is assured by a set of spiking transition vectors that could be used at
any given time during the computation. With such matrix representation,
it is quite convenient to determine the next configuration from a
given configuration, since it involves only multiplication and addition of
matrices after deciding the spiking transition vector.},
	isbn = {978-3-86805-721-8},
	url = {http://cmc11.uni-jena.de/proceedings.html},
	author = {XiangXiang Zeng and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun}
}
@article {690,
	title = {Membrane Computing and Programming},
	journal = {Journal of Logic and Algebraic Programming},
	volume = {79},
	year = {2010},
	month = {08/2010},
	pages = {289-290},
	publisher = {Elsevier B.V.},
	address = {North Holland},
	issn = {1567-8326},
	doi = {http://dx.doi.org/10.1016/j.jlap.2010.05.001},
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6W8D-505NRWN-1\&_user=603129\&_coverDate=08\%2F31\%2F2010\&_rdoc=1\&_fmt=high\&_orig=search\&_origin=search\&_sort=d\&_docanchor=\&view=c\&_acct=C000031118\&_version=1\&_urlVersion=0\&_userid=603129\&md5=461a3304a},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Gheorghe Stefanescu}
}
@article {695,
	title = {Modeling population growth of Pyrenean Chamois (Rupicapra p. pyrenayca) by using P systems},
	journal = {Eleventh International Conference on Membrane Computing (CMC11)},
	year = {2010},
	month = {08/2010},
	pages = {121-135},
	publisher = {Verlag ProBusiness Berlin},
	address = {Jena, Germany},
	abstract = {P systems provide a high level computational modeling framework
which integrates the structural and dynamic aspects of ecosystems
in a comprehensive and relevant way. In previous work [1, 2], there have
been presented several ecosystems modeled by P systems. The good results
obtained suggest studying new ecosystems as the one presented in
this paper. Pyrenean Chamois is a species inhabiting the Catalan Pyrenees.
In recent years it has been hit by diseases that cause a drastic
decrease in the number of individuals. Its presence leads to signicant
economic contributions in the area, so it is very interesting to provide a
model in order to facilitate the management.},
	isbn = {978-3-86805-721-8},
	url = {http://cmc11.uni-jena.de/proceedings/colomer.pdf},
	author = {M. Angels Colomer and Santiago Lav{\'\i}n and Ignasi Marco and Antoni Margalida and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy and Emmanuel Serrano and Luis Valencia-Cabrera},
	editor = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun}
}
@article {614,
	title = {A P-Lingua based simulator for Tissue Psystems},
	journal = {Journal of Logic and Algebraic Programming},
	volume = {79},
	year = {2010},
	note = {Membrane computing and programming },
	month = {08/2010},
	pages = {374-382},
	publisher = {Elsevier B.V.},
	address = {North Holland},
	abstract = {Investigations within the field of tissue-like P systems are being conducted, on one hand studying their computational efficiency, and on the other hand exploring the possibilities to use them as a computational modelling framework to biological phenomena.

In both cases it is necessary to develop software that provides simulation tools (simulators) for the existing variety of tissue P systems. Such simulators allow us to carry on computations of solutions to computationally hard problems on certain (small) instances. Moreover, they also provide a way to verify tissue-like models for real biological processes, by means of experimental data.},
	keywords = {Membrane computing, P{\textendash}Lingua, Simulators, Tissue P Systems},
	issn = {1567-8326},
	doi = {dx.doi.org/10.1016/j.jlap.2010.03.009},
	url = { http://dx.doi.org/10.1016/j.jlap.2010.03.009},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {674,
	title = {Preface. Proceedings First Workshop on Applications of Membrane computing, Concurrency and Agent-based modelling in POPulation biology },
	journal = {Electronic Proceedings in Theoretical Computer Science},
	volume = {33},
	year = {2010},
	month = {08/2010},
	address = {Jena, Germany},
	issn = {2075-2180},
	doi = {10.4204/EPTCS.33},
	url = {http://arxiv.org/html/1008.3147},
	author = {Paolo Milazzo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {691,
	title = {A quick introduction to membrane computing},
	journal = {Journal of Logic and Algebraic Programming},
	volume = {79},
	year = {2010},
	month = {08/2010},
	pages = {291-294},
	publisher = {Elsevier B.V.},
	address = {North Holland},
	abstract = {Membrane computing is a branch of natural computing inspired from the architecture and the functioning of biological cells. The obtained computing models are distributed parallel devices, called P systems, processing multisets of objects in the compartments defined by hierarchical or more general arrangements of membranes. Many classes of P systems were investigated {\textendash} mainly from the point of view of computing power and computing efficiency; also, a series of applications (especially in modeling biological processes) were reported. This note is a short and informal introduction to this research area, introducing a few basic notions, research topics, types of results, and pointing out to some relevant references.},
	keywords = {Natural computing; Membrane computing; P system; Turing computability},
	issn = {1567-8326},
	doi = {http://dx.doi.org/10.1016/j.jlap.2010.04.002},
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6VBS-516Y4T5-3\&_user=603129\&_coverDate=10\%2F11\%2F2010\&_rdoc=1\&_fmt=high\&_orig=search\&_origin=search\&_sort=d\&_docanchor=\&view=c\&_acct=C000031118\&_version=1\&_urlVersion=0\&_userid=603129\&md5=9e594779e},
	author = {Gheorghe Paun}
}
@article {615,
	title = {Simulating a P system based efficient solution to SAT by using GPUs },
	journal = {Journal of Logic and Algebraic Programming},
	volume = {79},
	year = {2010},
	note = {Membrane computing and programming },
	month = {08/2010},
	pages = {317-325},
	publisher = {Elsevier B.V.},
	address = {North Holland},
	abstract = {P systems are inherently parallel and non-deterministic theoretical computing devices defined inside the field of Membrane Computing. Many P system simulators have been presented in this area, but they are inefficient since they cannot handle the parallelism of these devices. Nowadays, we are witnessing the consolidation of the GPUs as a parallel framework to compute general purpose applications. In this paper, we analyse GPUs as an alternative parallel architecture to improve the performance in the simulation of P systems, and we illustrate it by using the case study of a family of P systems that provides an efficient and uniform solution to the SAT problem. Firstly, we develop a simulator that fully simulates the computation of the P system, demonstrating that GPUs are well suited to simulate them. Then, we adapt this simulator to the GPU architecture idiosyncrasies, improving the performance of the previous simulator.},
	keywords = {GPUs, Membrane computing, P systems, SAT},
	issn = {1567-8326},
	doi = {dx.doi.org/10.1016/j.jlap.2010.03.008},
	url = {http://dx.doi.org/10.1016/j.jlap.2010.03.008},
	author = {Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Gin{\'e}s D. Guerrero and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {613,
	title = {Computational complexity of tissue-like P systems},
	journal = {Journal of Complexity},
	volume = {26},
	year = {2010},
	month = {06/2010},
	pages = {296-315},
	publisher = {Elsevier },
	abstract = {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 . We discuss future research topics and open problems.},
	keywords = {Cell separation, Membrane computing, SAT, Tissue P Systems},
	issn = {0885-064X},
	doi = {dx.doi.org/10.1016/j.jco.2010.03.001},
	url = {http://dx.doi.org/10.1016/j.jco.2010.03.001},
	author = {Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {495,
	title = {On spiking neural P systems},
	journal = {Natural Computing},
	volume = {9},
	year = {2010},
	month = {06/2010},
	pages = {475-491},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.},
	keywords = {Asynchronous, Finite automaton, Finite state transducer, Formal Verification, Sequential, Spiking neural P system, Systolic trellis automaton, Universality},
	issn = {1567-7818},
	doi = {10.1007/s11047-009-9159-3},
	url = {http://www.springerlink.com/content/krhu646461138370/},
	author = {Oscar Ibarra and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {656,
	title = {Preface. Special issue on Models and Algorithms for Natural Processes honoring Professor Giancarlo Maur},
	journal = {Natural Computing},
	volume = {9},
	year = {2010},
	month = {06/2010},
	pages = {381-382},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	issn = {1567-7818},
	doi = {10.1007/s11047-009-9161-9},
	url = {http://www.springerlink.com/content/b11v7003715r2820/},
	author = {Paola Bonizzoni and Gheorghe Paun and Grzegorz Rozenberg and Claudio Zandron}
}
@article {657,
	title = {Solving Problems in a Distributed Way in Membrane Computing: dP Systems},
	journal = {International Journal of Computers, Communications and Control},
	volume = {5},
	year = {2010},
	month = {06/2010},
	pages = {238-250},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {Although P systems are distributed parallel computing devices, noexplicit way of handling the input in a distributed way in this framework wasconsidered so far. This note proposes a distributed architecture (based on cell-likeP systems, with their skin membranes communicating through channels as intissue-like P systems, according to specified rules of the antiport type), whereparts of a problem can be introduced as inputs in various components and thenprocessed in parallel. The respective devices are called dP systems, with the caseof accepting strings called dP automata. The communication complexity can beevaluated in various ways: statically (counting the communication rules in a dPsystem which solves a given problem), or dynamically (counting the number ofcommunication steps, of communication rules used in a computation, or the numberof objects communicated). For each measure, two notions of {\textquotedblleft}parallelizability" canbe introduced. Besides (informal) definitions, some illustrations of these idea areprovided for dP automata: each regular language is {\textquotedblleft}weakly parallelizable" (i.e., itcan be recognized in this framework, using a constant number of communicationsteps), and there are languages of various types with respect to Chomsky hierarchywhich are {\textquotedblleft}efficiently parallelizable" (they are parallelizable and, moreover, areaccepted in a faster way by a dP automaton than by a single P automaton). Several suggestions for further research are made.},
	keywords = {chomsky hierarchy, communication complexity, distributed computing, Membrane computing, P system},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=408},
	attachments = {http://www.gcn.us.es/biblio/themes/files/408.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {517,
	title = {A linear-time solution to the Partition problem in a cellular tissue-like model},
	journal = {Journal of Computational and Theoretical Nanoscience},
	volume = {7},
	year = {2010},
	month = {05/2010},
	pages = {884-889},
	publisher = {American Scientific Publishers},
	issn = {1936-6612},
	url = {http://www.aspbs.com/ctn/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {578,
	title = {Evolving Cell Models for Systems and Synthetic Biology},
	journal = {Systems and Synthetic Biology},
	volume = {4},
	year = {2010},
	month = {03/2010},
	pages = {55-84},
	publisher = {Springer},
	address = {Berlin, Germany},
	abstract = { This paper proposes a new methodology for the automated design of cell models for systems and synthetic biology. Our modelling framework is based on P systems, a discrete, stochastic and modular formal modelling language. The automated design of biological models comprising the optimization of the model structure and its stochastic kinetic constants is performed using an evolutionary algorithm. The evolutionary algorithm evolves model structures by combining different modules taken from a predefined module library and then it fine-tunes the associated stochastic kinetic constants. We investigate four alternative objective functions for the fitness calculation within the evolutionary algorithm: (1) equally weighted sum method, (2) normalization method, (3) randomly weighted sum method, and (4) equally weighted product method. The effectiveness of the methodology is tested on four case studies of increasing complexity including negative and positive autoregulation as well as two gene networks implementing a pulse generator and a bandwidth detector. We provide a systematic analysis of the evolutionary algorithm{\textquoteright}s results as well as of the resulting evolved cell models. },
	keywords = {Systems biology. Synthetic biology. P systems. Evolutionary algorithms. Automated model design},
	issn = {1872-5325},
	doi = {10.1007/s11693-009-9050-7},
	url = {http://www.springerlink.com/content/66671m1186474455/},
	author = {Hongqing Cao and Francisco J. Romero-Campero and Stephan Heeb and Miguel C{\'a}mara and Natalio Krasnogor}
}
@article {516,
	title = {Simulation of P systems with active membranes on CUDA},
	journal = {Briefings in Bioinformatics},
	volume = {11},
	year = {2010},
	note = {Parallel and Ubiquitous methods and tools in Systems Biology
Impact Factor of 9.283},
	month = {03/2010},
	pages = {313-322},
	publisher = {Oxford University Press},
	abstract = {P systems or Membrane Systems provide a high-level computational modelling framework that combines the structure and dynamic aspects of biological systems in a relevant and understandable way. They are inherently parallel and non-deterministic computing devices. In this article, we discuss the motivation, design principles and key of the implementation of a simulator for the class of recognizer P systems with active membranes running on a (GPU). We compare our parallel simulator for GPUs to the simulator developed for a single central processing unit (CPU), showing that GPUs are better suited than CPUs to simulate P systems due to their highly parallel nature.},
	keywords = {CUDA, GPU, Membrane computing, Natural computing, P systems, parallel computing},
	issn = {1477-4054},
	doi = {10.1093/bib/bbp064},
	url = {http://bib.oxfordjournals.org/cgi/content/abstract/bbp064v1},
	author = {Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Gin{\'e}s D. Guerrero and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {636,
	title = {An Application of Genetic Algorithms to Membrane Computing},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {101-108},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/08GEscuela.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/08GEscuela.pdf},
	author = {Gabriela Escuela and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {637,
	title = {Array Tissue-like P Systems},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {37-52},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	url = {http://www.gcn.us.es/8BWMC/volume/03array_tps_sevilla.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/03array_tps_sevilla.pdf},
	author = {Hepzibah A. Christinal and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {634,
	title = {A Cellular Sudoku Solver},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {77-88},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/06sudokuMiguel.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/06sudokuMiguel.pdf},
	author = {Daniel D{\'\i}az-Pernil and Carlos M. Fern{\'a}ndez-M{\'a}rquez and Manuel Garc{\'\i}a-Quismondo and Miguel A. Guti{\'e}rrez-Naranjo and Miguel A. Mart{\'\i}nez-del-Amor}
}
@article {635,
	title = {A Cellular Way to Obtain Homology Groups in Binary 2D Images},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {89-100},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/07homol_br.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/07homol_br.pdf},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Pedro  Real and Vanesa S{\'a}nchez-Canales}
}
@article {643,
	title = {First Steps Towards Linking Membrane Depth and the Polynomial Hierarchy},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {255-266},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/20polyheir.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/20polyheir.pdf},
	author = {Niall Murphy and Antonio E. Porreca}
}
@article {638,
	title = {How Does a P System Sound? },
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {123-132},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/10music.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/10music.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Miguel A. Guti{\'e}rrez-Naranjo and Daniel Ram{\'\i}rez-Mart{\'\i}nez}
}
@article {639,
	title = {Membrane Computing Meets Artificial Intelligence: A Case Study},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {133-144},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/11Miguelsearch.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/11Miguelsearch.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {359,
	title = {A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors },
	journal = {Theory of Computing Systems},
	volume = {46},
	year = {2010},
	note = {online version (http://dx.doi.org/10.1007/s00224-008-9124-z)},
	month = {02/2010},
	pages = {174-192},
	publisher = {Springer New York},
	abstract = {We consider three complexity classes defined on Accepting Hybrid Networks of Evolutionary Processors (AHNEP) and compare them with the classical complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the family of languages decided by AHNEPs in polynomial time. A language is in P if and only if it is decided by an AHNEP in polynomial time and space. We also show that PSPACE equals the family of languages decided by AHNEPs in polynomial length. },
	keywords = {Evolution strategies; Evolutionary processor; Network of evolutionary processors; Turing machine; Computational complexity classes},
	issn = {1432-4350},
	doi = {10.1007/s00224-008-9124-z},
	url = {http://www.springerlink.com/content/865688637337gu63/},
	author = {Florin Manea and Maurice Margenstern and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {640,
	title = {On Communication Complexity in Evolution-Communication P Systems},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {1-22},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/01commcomplexity.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/01commcomplexity.pdf},
	author = {Henry Adorna and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {641,
	title = {Solving Problems in a Distributed Way in Membrane Computing: dP  Systems},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {219-234},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/17dPsystems.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/17dPsystems.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {648,
	title = {Spiking Neural P Systems: An improved normal form},
	journal = {Theoretical Computer Science},
	volume = {411},
	year = {2010},
	month = {02/2010},
	pages = {906-918},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Spiking neural P systems (in short, SN P systems) are computing devices based on the way the neurons communicate through electrical impulses (spikes). These systems involve various ingredients; among them, we mention forgetting rules and the delay in firing rules. However, it is known that the universality can be obtained without using these two features. In this paper we improve this result in two respects: (i) each neuron contains at most two rules (which is optimal for systems used in the generative mode), and (ii) the rules in the neurons using two rules have the same regular expression which controls their firing. This result answers a problem left open in the literature, and, in this context, an incompleteness in some previous proofs related to the elimination of forgetting rules is removed. Moreover, this result shows a somewhat surprising uniformity of the neurons in the SN P systems able to simulate Turing machines, which is both of a theoretical interest and it seems to correspond to a biological reality. When a bound is imposed on the number of spikes present in a neuron at any step of a computation (such SN P systems are called finite), two surprising results are obtained. First, a characterization of finite sets of numbers is obtained in the generative case (this contrasts the case of other classes of SN P systems, where characterizations of semilinear sets of numbers are obtained for finite SN P systems). Second, the accepting case is strictly more powerful than the generative one: all finite sets and also certain arithmetical progressions can be accepted. A precise characterization of the power of accepting finite SN P systems without forgetting rules and delay remains to be found.},
	keywords = {Membrane computing; Spiking neural P system; Turing computability; Semilinear set},
	issn = {0304-3975},
	doi = {doi:10.1016/j.tcs.2009.11.010 },
	url = {http://www.pubzone.org/dblp/journals/tcs/PanP10},
	author = {Linqiang Pan and Gheorghe Paun}
}
@article {642,
	title = {Tissue-like P Systems without Environment},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {53-64},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/04DiazPernilEnvironment.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/04DiazPernilEnvironment.pdf},
	author = {Hepzibah A. Christinal and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {644,
	title = {When Matrices Meet Brains},
	journal = {Eighth Brainstorming  Week on Membrane Computing},
	year = {2010},
	month = {02/2010},
	pages = {255-266},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/8BWMC/volume/24SNP_Matrix2b.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/24SNP_Matrix2b.pdf},
	author = {XiangXiang Zeng and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Linqiang Pan}
}
@article {509,
	title = {Characterizing tractability by tissue-like P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {289-300},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In the framework of recognizer cell{\textendash}like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP{\textendash}complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time.
In this paper, we study the computational efficiency of recognizer tissue P systems with communication (symport/antiport) rules and division rules. Some results have been already obtained in this direction: (a) using communication rules and making no use of division rules, only tractable problems can be efficiently solved; (b) using communication rules with length three and division rules, NP{\textendash}complete problems can be efficiently solved. In this paper, we show that the length of communication rules plays a relevant role from the efficiency point of view for this kind of P systems.
},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_21},
	url = {http://springerlink.com/content/h2272531j487qu50/?p=75abf8145d6743f3ae89252f7fba0541\&pi=20},
	author = {Rosa Guti{\'e}rrez-Escudero and Mario J. P{\'e}rez-Jim{\'e}nez and Miquel Rius-Font}
}
@article {513,
	title = {A Computational Complexity Theory in Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {(invited talk). 
Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {125-148},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P /= NP conjecture within the framework of a bio-inspired and non-conventional computing model are deduced. },
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_10},
	url = {http://springerlink.com/content/q3u67763r37q6362/?p=be4b72c586c644468162938b28dbcac8\&pi=9},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {511,
	title = {Implementing P systems parallelism by means of GPUs},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers},
	month = {01/2010},
	pages = {227-241},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Software development for Membrane Computing is growing up yielding new applications. Nowadays, the efficiency of P systems simulators have become a critical point when working with instances of large size. The newest generation of GPUs (Graphics Processing Units) provide a massively parallel framework to compute general purpose computations. We present GPUs as an alternative to obtain better performance in the simulation of P systems and we illustrate it by giving a solution to the N-Queens problem as an example. },
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_17},
	url = {http://springerlink.com/content/p711691h1p64x7u3/?p=700938793a854ec885f89e0657ea06f4\&pi=16},
	author = {Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Gin{\'e}s D. Guerrero and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {510,
	title = {An overview of P-Lingua 2.0},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {264-288},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {P{\textendash}Lingua is a programming language for membrane computing which aims to be a standard to define P systems. In order to implement this idea, a Java library called pLinguaCore has been developed as a software framework for cell{\textendash}like P systems. It is able to handle input files (either in XML or in P{\textendash}Lingua format) defining P systems from a number of different cell{\textendash}like P system models. Moreover, the library includes several built{\textendash}in simulators for each supported model. For the sake of software portability, pLinguaCore can export a P system definition to any convenient output format (currently XML and binary formats are available). This software is not a closed product, but it can be extended to accept new input or output formats and also new models or simulators.
The term P{\textendash}Lingua 2.0 refers to the software package consisting of the above mentioned library together with a user interface called pLinguaPlugin (more details can be found at http://www.p-lingua.org).
Finally, in order to illustrate the software, this paper includes an application using pLinguaCore for describing and simulating ecosystems by means of P systems.
},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_20},
	url = {http://springerlink.com/content/9019651332615113/?p=4515b9a3d094496995e253d08e41004d\&pi=19},
	author = {Manuel Garc{\'\i}a-Quismondo and Rosa Guti{\'e}rrez-Escudero and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {512,
	title = {A P system based model of an ecosystem of some scavenger birds},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {182-195},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In [1], we presented a P system in order to study the evolution of the bearded vulture in the Pyrenees (NE Spain). Here, we present a new model that overcomes some limitations of the previous work incorporating other scavenger species and additional prey species that provide food for the scavenger intraguild and interact with the Bearded Vulture in the ecosystem. After the validation, the new model can be a useful tool for the study of the evolution and management of the ecosystem. P systems provide a high level computational modelling framework which integrates the structural and dynamical aspects of ecosystems in a compressive and relevant way. The inherent randomness and uncertainty in ecosystems is captured by using probabilistic strategies.},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_14},
	url = {http://springerlink.com/content/ek1778t6081r040k/?p=4515b9a3d094496995e253d08e41004d\&pi=13},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Antoni Margalida and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy}
}
@article {508,
	title = {Searching previous configurations in Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {301-315},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Searching all the configurations C' which produce a given configuration C is an extremely hard task. The current approximations are based on heavy hand-made calculus by considering the specific features of the given configuration. In this paper we present a general method for characterizing all the configurations C' which produce a given configuration C in the framework of transition P systems without cooperation and without dissolution. },
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_22},
	url = {http://springerlink.com/content/a18862111260731l/?p=75abf8145d6743f3ae89252f7fba0541\&pi=21},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@proceedings {645,
	title = {Proceedings of the Eighth Brainstorming Week on Membrane Computing},
	journal = {Eighth Brainstorming Week on Membrane Computing},
	year = {2010},
	month = {01/02/2010},
	pages = {XI+342},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-2357-6},
	url = {http://www.gcn.us.es/?q=proc8bwmc},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {592,
	title = {Active membranes},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {282-301},
	publisher = {Oxford University Press},
	chapter = {11},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {522,
	title = {Complexity: membrane division, membrane creation},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {302-336},
	publisher = {Oxford University Press},
	chapter = {12},
	address = {New York (United States)},
	isbn = {978-0-19-955667-0},
	url = {http://www.us.oup.com/us/catalog/general/subject/Mathematics/ComputerScience/?view=usa\&sf=toc\&ci=9780199556670},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Damien Woods},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {594,
	title = {Computability Elements for Membrane Computing},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {58-82},
	publisher = {Oxford University Press},
	chapter = {3},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {655,
	title = {A computational modeling for real ecosystems based on P systems},
	journal = {Natural Computing},
	volume = {10},
	year = {2010},
	pages = {39-53},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {In this paper, a P systems based general framework for modeling ecosystems dynamics is presented. Particularly, ecosystems are specified by means of multienvironment P systems composed of a finite number of environments, each of them having an extended P system with active membranes. The semantics is of a probabilistic type and it is implemented by assigning each rule of the system a probabilistic constant which depends on the environment and the run time. As a case study, two real ecosystems are described: scavenger birds in the Catalan Pyrenees and the zebra mussel (Dreissena Polymorpha) in Ribarroja reservoir (Spain). },
	keywords = {Dynamics, Ecosystem, Mussel, P-System, Probabilistic, Scavenger},
	issn = {1567-7818},
	doi = {10.1007/s11047-010-9191-3},
	url = {http://www.springerlink.com/content/k5346u33465h5u50/},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Antoni Margalida and Antoni Palau and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy}
}
@article {596,
	title = {An Introduction to and an Overview of Membrane Computing},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {1-27},
	publisher = {Oxford University Press},
	chapter = {1},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun and Grzegorz Rozenberg},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {714,
	title = {La mitosis celular: una sorprendente frontera de la eficiencia},
	journal = {Liber amicorum Angel Nepomuceno},
	year = {2010},
	pages = {99-108},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-5116-6},
	url = {http://www.cs.us.es/~marper/investigacion/mitosis-angel},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Fernando Soler-Toscano and H. von Ditmarsch and Francisco J. Salguero}
}
@article {694,
	title = {MeCoSim: A general purpose software tool for simulating biological phenomena by means of P Systems},
	journal = {IEEE Fifth International Conference on Bio-inpired Computing: Theories and Applications (BIC-TA 2010)},
	volume = {I},
	year = {2010},
	pages = {637-643},
	publisher = {IEEE, Inc.},
	address = {Changsha, China},
	abstract = {In recent years, the increasing importance of the
computational systems biology is leading to an impressive growth
of the knowledge of several real-life phenomena. In this framework,
membrane computing is an emergent branch within natural
computing that has been succesfully used to model biological
phenomena. The study of these phenomena usually requires the
execution of virtual experiments using mechanisms of simulation,
implying the development of ad-hoc tools to simulate. However,
the advance of the research is demanding general solutions
to avoid the necessity of custom software developments for
each matter of study, when there are some common problems
to resolve. MeCoSim (Membrane Computing Simulator) is a
first step in this direction providing the users a customizable
application to generate custom simulators based on membrane
computing by simply writing a configuration file.},
	isbn = {978-1-4244-6439-5},
	url = {http://www.cs.us.es/~marper/investigacion/mecosim.pdf},
	author = {Ignacio P{\'e}rez-Hurtado and Luis Valencia-Cabrera and Mario J. P{\'e}rez-Jim{\'e}nez and M. Angels Colomer and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {K. Li and Z. Tang and R. Li and Atulya Nagar and R. Thamburaj}
}
@article {593,
	title = {Membrane Computing and Economics},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {632-644},
	publisher = {Oxford University Press},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {518,
	title = {Membrane Computing, WMC 2009},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	pages = {IX+487},
	publisher = {Springer-Verlag},
	edition = {1},
	address = {Berl{\'\i}n, Alemania},
	isbn = {978-3-642-11466-3},
	doi = {http://dx.doi.org/10.1007/978-3-642-11467-0},
	url = {http://www.springer.com/computer/foundations/book/978-3-642-11466-3},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Arto Salomaa}
}
@article {597,
	title = {Other Topics},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {654-663},
	publisher = {Oxford University Press},
	chapter = {23},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun and Grzegorz Rozenberg},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {549,
	title = {The Oxford Handbook of Membrane Computing},
	journal = {Oxford University Press},
	year = {2010},
	pages = {xiv+664},
	publisher = {Oxford University Press},
	abstract = {Part of the broader research field of natural computing, Membrane Computing is an area within computing science that aims to abstract computing ideas and models from the structure and functioning of living cells, as well as from the way the cells are organized in tissues or higher order structures. This handbook provides both a comprehensive survey of available knowledge and established research topics, and a guide to recent developments in the field, covering the subject from theory to applications. The handbook is suitable both for introducing novices to this area of research, and as a main source of reference for active researchers. It sets out the necessary biological and formal background, with the introductory chapter serving as a gentle introduction to and overview of membrane computing. Individual chapters, written by leading researchers in membrane computing, present the state of the art of all main r{\textquoteleft}search trends and include extensive bibliographies.},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {595,
	title = {P Systems with Objects on Membranes},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {363-388},
	publisher = {Oxford University Press},
	chapter = {14},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Matteo Cavaliere and Shankara N. Krishna and Andrei Paun and Gheorghe Paun},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {591,
	title = {Probabilistic/Stochastic Models},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {455-474},
	publisher = {Oxford University Press},
	chapter = {18},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.oup.com.au/titles/academic/maths/9780199556670},
	author = {Paolo Cazzaniga and Marian Gheorghe and Natalio Krasnogor and Giancarlo Mauri and Dario Pescini and Francisco J. Romero-Campero},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {669,
	title = {Proceedings First Workshop on Applications of Membrane Computing, Concurrency and Agent-based modelling in Population Biology },
	journal = {Electronic Proceedings in Theoretical Computer Science},
	volume = {33},
	year = {2010},
	address = {Jena, Germany},
	issn = {2075-2180},
	doi = {10.4204/EPTCS.33},
	url = {http://arxiv.org/html/1008.3147},
	author = {Paolo Milazzo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {737,
	title = {Proceedings of the Eleventh International Conference on Membrane Computing},
	year = {2010},
	pages = {482},
	publisher = {Verlag ProBusiness Berlin},
	abstract = {Having now for the first time the status of a conference, CMC11 is pleased to continue the fruitful tradition of 10 previous events of the International Workshop on Membrane Computing (WMC) inspired by the idea of bringing together researchers working in membrane computing or related areas in a friendly atmosphere enhancing communication and cooperation. This volume contains seven abstracts of keynote and invited talks together with 26 accepted papers and six contributions accepted as extended abstracts. Membrane computing is an area of computer science aiming to abstract computing ideas and models from the structure and the functioning of living cells. From a systems biological point of view, membrane systems provide a discrete modelling approach to describe biological reaction systems composed of interconnected membranes. },
	isbn = {978-3-86805-721-8},
	url = {http://cmc11.uni-jena.de/proceedings.html},
	author = {Marian Gheorghe and Thomas Hinze and Gheorghe Paun}
}
@article {713,
	title = {Razonando sobre soluciones mec{\'a}nicas, inductivas y cualitativas},
	journal = {Estudios de L{\'o}gica, Lenguaje y Epistemolog{\'\i}a},
	year = {2010},
	pages = {211-229},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-614-4291-1},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {D. Fern{\'a}ndez and E.F. G{\'o}mez-Caminero and I. Hern{\'a}ndez}
}
@article {523,
	title = {Software for P systems},
	journal = {The Oxford Handbook of Membrane Computing},
	year = {2010},
	pages = {437-454},
	publisher = {Oxford University Press},
	chapter = {17},
	address = {Oxford (U.K.)},
	isbn = {9780199556670},
	url = {http://www.us.oup.com/us/catalog/general/subject/Mathematics/ComputerScience/?view=usa\&sf=toc\&ci=9780199556670},
	author = {Daniel D{\'\i}az-Pernil and Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {501,
	title = {Analysis of P systems simulation on CUDA},
	journal = {XX Jornadas de Paralelismo},
	year = {2009},
	note = {Webpage of the conference: http://jornadas2009.gac.des.udc.es/},
	month = {September 2009},
	pages = {289-294},
	publisher = {Servizo de Publicaci{\'o}ns, Universidade da Coru{\~n}a},
	address = {A coru{\~n}a, Spain},
	abstract = {GPUs (Graphics Processing Unit) have been con- 
solidated as a massively data-parallel coprocessor to
develop many general purpose computations, and en-
able developers to utilize several levels of parallelism
to obtain better performance of their applications.
The massively parallel nature of certain computa-
tions leads to use GPUs as an underlying architec-
ture, becoming a good alternative to other paral-
lel approaches. P systems or membrane systems
are theoretical devices inspired in the way that liv- 
ing cells work, providing computational models and
a high level computational modeling framework for
biological systems. They are massively parallel dis-
tributed, and non-deterministic systems. In this pa-
per, we evaluate the GPU as the underlying archi-
tecture to simulate the class of recognizer P systems
with active membranes. We analyze the performance
of three simulators implemented on CPU, CPU-GPU 
and GPU respectively. We compare them using a pre-
sented P system as a benchmark, showing that the
GPU is better suited than the CPU to simulate those
P systems due to its massively parallel nature.},
	isbn = {84-9749-346-8},
	url = {http://www.p-lingua.org/~miguel/papers/2009/psystem_jornadas09.pdf},
	author = {Gin{\'e}s D. Guerrero and Jos{\'e} M. Cecilia and Jos{\'e} M. Garc{\'\i}a and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {502,
	title = {Simulation of P Systems with active membranes on CUDA},
	journal = {2009 International Workshop on High Performance Computational Systems Biology},
	year = {2009},
	note = {Webpage of the conference: http://www.cosbi.eu/hibi09/ },
	month = {October 2009},
	pages = {61-71},
	publisher = {IEEE Computer Society},
	address = {Trento, Italy},
	abstract = {P systems or membrane systems provide a high
level computational modeling framework that combines the
structural and dynamic aspects of biological systems in a
relevant and understandable way. P systems are massively
parallel distributed, and non-deterministic systems. In this
paper, we describe the implementation of a simulator for the
class of recognizer P systems with active membranes by using
the GPU (Graphics Processing Unit). We compare the high-
performance parallel simulator for the GPU to the simulator
developed on a single CPU (Central Processing Unit), and we
show that the GPU is better suited than the CPU to simulate
P systems due to its highly parallel nature.
},
	isbn = {978-0-7695-3809-9},
	doi = {10.1109/HiBi.2009.13},
	url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\&arnumber=5298701\&isnumber=5298664},
	author = {Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Jos{\'e} M. Garc{\'\i}a and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {500,
	title = {A massively parallel framework using P systems and GPUs},
	journal = {Symposium on Application Accelerators in High Performance Computing},
	year = {2009},
	note = {Poster also available: http://www.p-lingua.org/~miguel/papers/2009/psystem_poster_saahpc09.pdf
Webpage of the conference: http://saahpc.ncsa.illinois.edu/09/agenda.html},
	month = {July 2009},
	address = {Illinois, USA},
	abstract = {Since CUDA programing model appeared on the 
general purpose computations, the developers can extract all 
the power contained in GPUs (Graphics Processing Unit) across        
many computational domains. Among these domains, P systems                                                                     
or membrane systems provide a high level computational mod-                                                                   
eling framework that allows, in theory, to obtain polynomial                                                                    
time solutions to NP-complete problems by trading time for
space, and also to model biological phenomena in the area of         
computational systems biology. P systems are massively parallel     
distributed devices and their computation can be divided in two                                                                  
levels of parallelism: membranes, that can be expressed as blocks                                                                   
in CUDA programming model; and objects, that can be expressed                                                                  
as threads in CUDA programming model. In this paper, we
present our initial ideas of developing a simulator for the class of
recognizer P systems with active membranes by using the CUDA      
programing model to exploit the massively parallel nature of                                                                     
those systems at maximum. Experimental results of a preliminary                                                              
version of our simulator on a Tesla C1060 GPU show a 60X of                                                               
speed-up compared to the sequential code.                                                                     },
	url = {http://www.p-lingua.org/~miguel/papers/2009/psystem_saahpc09.pdf},
	author = {Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Jos{\'e} M. Garc{\'\i}a and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {646,
	title = {First steps towards a CPU made of Spiking Neural P systems},
	journal = {International Journal of Computers, Communications and Control},
	volume = {4},
	year = {2009},
	month = {30/2009},
	pages = {244-252},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {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 natural numbers expressed in binary form, encoded as appropriate sequences of spikes. A single system accepts as inputs numbers of any size. The present work may be considered as a first step towards the design of a CPU based on the working of spiking neural P systems.},
	keywords = {Arithmetic operations, Membrane computing, spiking neural P systems},
	issn = {1841-9836},
	url = {http://journal.univagora.ro/?page=article_details\&id=369},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Alberto Leporati}
}
@article {647,
	title = {P Systems: Computing the Period of Irreducible Markov Chains},
	journal = {International Journal of Computers, Communications and Control},
	volume = {4},
	year = {2009},
	month = {30/2009},
	pages = {291-300},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the sequence of distributions at time n converges to the stationary distribution, that is, the
Markov chain is approaching equilibrium as n tends to infinity.
In this paper, a characterization of the aperiodicity in existential terms of some state is
given. At the same time, a Psystem with external output is associated with any irreducible Markov chain. The designed system provides the aperiodicity of that Markov chain and spends a polynomial amount of resources with respect to the size of the input. A comparative analysis with respect to another known solution is described.},
	keywords = {Markov chain, Membrane computing, P systems},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=374},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font}
}
@proceedings {483,
	title = {Proceedings of the Tenth Workshop on Membrane Computing},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	note = {Gheorghe Paun; Mario J. P{\'e}rez-Jim{\'e}nez; Agustin Riscos-N{\'u}{\~n}ez (eds.)},
	month = {24/08/2009},
	pages = {X+565},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {474,
	title = {A computational complexity theory in membrane computing},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/8/2009},
	pages = {82-105},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {In this paper, a computational complexity theory within the framework
of Membrane Computing is introduced. Polynomial complexity classes associated with
different models of cell-like and tissue-like membrane systems are defined and the most
relevant results obtained so far are presented. Many attractive characterizations of P =
NP conjecture within the framework of a bio-inspired and non-conventional computing
model are deduced.
},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {475,
	title = {A P system based model of an ecosystem of some scavenger birds},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/8/2009},
	pages = {153-168},
	publisher = {Marpapublicidad},
	abstract = {The Bearded Vulture (Gypaetus Barbatus) is an endangered species in Eu-
rope that feeds almost exclusively on bone remains provided by wild and domestic ungu-
lates. In [1], we presented a P system in order to study the evolution of these species in
the Pyrenees (NE Spain). Here, we present a new model that overcomes some limitations
of the previous work incorporating other scavenger species (predatory) and additional
prey species that provide food for the scavenger intraguild and interact with the Bearded
Vulture in the ecosystem. After the validation, the new model can be a useful tool for
the study of the evolution and management of the ecosystem. P systems provide a high
level computational modelling framework which integrates the structural and dynamical
aspects of ecosystems in a compressive and relevant way. The inherent randomness and
uncertainty in ecosystems is captured by using probabilistic strategies.
},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Antoni Margalida and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {478,
	title = {Characterizing tractability by tissue-like P systems},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {269-281},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {In the framework of cell-like membrane systems it is well known that the
construction of exponential number of objects in polynomial time is not enough to ef-
ciently solve NP-complete problems. Nonetheless, it may be sufficient to create an
exponential number of membranes in polynomial time. In the framework of recognizer
polarizationless P systems with active membranes, the construction of an exponential
workspace expressed in terms of number of membranes and objects may not suffice to
efficiently solve computationally hard problems.
In this paper we study the computational efficiency of recognizer tissue P systems
with communication (symport/antiport) rules and division rules. Some results have been
already obtained in this direction: (a) using communication rules and forbidding division
rules, only tractable problems can be efficiently solved; (b) using communication rules
with length three and division rules, NP-complete problems can be efficiently solved. In
this paper we show that the length of communication rules plays a relevant role from the
efficiency point of view for this kind of P systems.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Rosa Guti{\'e}rrez-Escudero and Mario J. P{\'e}rez-Jim{\'e}nez and Miquel Rius-Font},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {477,
	title = {A first attempt to model notch signalling by means of P systems},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {265-268},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {During mammalian central nervous system development, an enormous variety
of cell types are generated. This cell diversity is due in part to asymmetrical cell
division. Indeed, in some sense Notch signals link the fate decisions of one cell to those
of its neighbours. This fundamental signalling pathway has not yet been modeled within
membrane computing framework.},
	url = {http://www.gcn.us.es/files/265notch.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Beverley M. Henley and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {476,
	title = {An overview of P-lingua 2.0},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {240-264},
	publisher = {Marpapublicidad},
	abstract = {P-Lingua is a programming language for membrane computing which aims
to be a standard to dene P systems. In order to implement this idea, a Java library
called pLinguaCore has been developed as a software framework for cell-like P systems.
It is able to handle input les (either in XML or in P-Lingua format) dening P systems
from a number of dierent cell{like P system models. Moreover, the library includes
several built-in simulators for each supported model. For the sake of software portability,
pLinguaCore can export a P system denition to any convenient output format (currently
XML and binary formats are available). This software is not a closed product, but it can
be extended to accept new input or output formats and also new models or simulators.
The term P-Lingua 2.0 refers to the software package consisting of the above mentioned
library together with a user interface called pLinguaPlugin (more details can be
found at http://www.p-lingua.org).
Finally, in order to illustrate the software, this paper includes an application using
pLinguaCore for describing and simulating ecosystems by means of P systems.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Manuel Garc{\'\i}a-Quismondo and Rosa Guti{\'e}rrez-Escudero and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {479,
	title = {Searching previous configurations in membrane computing},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {282-297},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {Searching all the configurations C{\textquoteright} which produce a given configuration C
is an extremely hard task. The current approximations are based on heavy hand-made
calculus by considering the specic features of the given conguration. In this paper we
present a general method for characterizing all the configurations C{\textquoteright} which produce a
given conguration C in the framework of transition P systems without cooperation and
without dissolution.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {480,
	title = {Simulating active membrane systems using GPUs},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {369-384},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {Software development for cellular computing is growing up yielding new applications.
In this paper, we describe a simulator for the class of recognizer P systems
with active membranes, which exploits the massively parallel nature of P systems computations
by using GPUs (Graphics Processing Units). The newest generation of GPUs
provide a massively parallel framework to compute general purpose computations. We
present GPUs as an alternative to obtain better performance in the simulation of P
systems and we illustrate it by giving a solution to the N-Queens problem as an example.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Jos{\'e} M. Garc{\'\i}a},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {481,
	title = {Spiking neural P systems with weights and thresholds},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {514-533},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {A variant of spiking neural P systems is introduced, with (positive or nega-
tive) weights on synapses and with the restriction that the rules of a neuron fires when
the potential of that neuron equals a given threshold. The involved numbers - weights,
thresholds, potential consumed by each rule - can be real (computable) numbers, ratio-
nal, integer, natural numbers. The power of the obtained systems is investigated. For
instance, it is shown that integer numbers (very restricted: 1;-1 for weights, 1 and 2 for
thresholds and for writing the rules) suffice in order to compute all Turing computable
sets of numbers, both in the generative and the accepting modes. Using only natural
numbers we characterize the family of semilinear sets of numbers. Some open problems
and suggestions for further research are formulated.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Jun Wang and Hendrik J. Hoogeboom and Linqiang Pan and Gheorghe Paun},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {482,
	title = {Uniformity: uncovering the frontier of parallelism},
	journal = {10th Workshop on Membrane Computing},
	year = {2009},
	month = {24-27/08/2009},
	pages = {556-560},
	publisher = {Marpapublicidad},
	address = {Curtea de Arges, Rumania},
	abstract = {We summarise some current results for active membrane systems using uniformity
below P. Many of the systems we consider are easily to simulate on parallel
hardware and provide interesting new directions for the complexity theory of membrane
systems as well as those seeking to simulate membrane systems.},
	url = {http://www.gcn.us.es/?q=procwmc10},
	author = {Niall Murphy and Damien Woods},
	editor = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {606,
	title = {An Approach to the Engineering of Cellular Models Based on P Systems},
	journal = {5th Conference on Computability in Europe, CiE 2009},
	volume = {5635},
	year = {2009},
	month = {19/07/2009},
	pages = {430-436},
	publisher = {Springer Berlin / Heidelberg},
	address = {Heidelberg, Germany},
	abstract = {Living cells assembled into colonies or tissues communicate using complex systems. These systems consist in the interaction between many molecular species distributed over many compartments. Among the different cellular processes used by cells to monitor their environment and respond accordingly, gene regulatory networks, rather than individual genes, are responsible for the information processing and orchestration of the appropriate response.
In this respect, synthetic biology has emerged recently as a novel discipline aiming at unravelling the design principles in gene regulatory systems by synthetically engineering transcriptional networks which perform a specific and prefixed task. Formal modelling and analysis are key methodologies used in the field to engineer, assess and compare different genetic designs or devices.},
	isbn = {978-3-642-03072-7},
	doi = {10.1007/978-3-642-03073-4},
	url = {http://www.springerlink.com/content/l175644g32973123/},
	attachments = {http://www.gcn.us.es/biblio/themes/files/engineering_of_cellular_models.pdf},
	author = {Francisco J. Romero-Campero and Natalio Krasnogor},
	editor = {Klaus Ambos-Spies and Benedikt L{\"o}we and Wolfgang Merkle}
}
@article {497,
	title = {Complexity aspects of polarizationless membrane systems},
	journal = {Natural Computing},
	volume = {8},
	year = {2009},
	month = {12/2009},
	pages = {703-717},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {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 solve computationally hard problems. We show that such systems are able to solve the PSPACE-complete problem Quantified 3-sat, provided that non-elementary membrane division is controlled by the presence of a (possibly non-elementary) membrane.},
	issn = {1567-7818},
	doi = {10.1007/s11047-008-9100-1},
	url = {http://www.springerlink.com/content/a8q346311328p807/},
	author = {Alberto Leporati and Claudio Ferretti and Giancarlo Mauri and Mario J. P{\'e}rez-Jim{\'e}nez and Claudio Zandron}
}
@article {498,
	title = {Efficient simulation of tissue-like P systems by transition cell-like P systems},
	journal = {Natural Computing},
	volume = {8},
	year = {2009},
	month = {12/2009},
	pages = {797-806},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.},
	issn = {1567-7818 },
	doi = {10.1007/s11047-008-9102-z},
	url = {http://dx.doi.org/10.1007/s11047-008-9102-z},
	author = {Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {361,
	title = {Uniform solutions to SAT and Subset Sum by spiking neural P systems},
	journal = {Natural Computing},
	volume = {8},
	year = {2009},
	month = {12/2009},
	pages = {681-702},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving computationally hard problems, addressing two problems which were already recently considered in this respect: SubsetSum and SAT. For both of them we provide uniform constructions of standard spiking neural P systems (i.e., not using extended rules or parallel use of rules) which solve these problems in a constant number of steps, working in a non-deterministic way. This improves known results of this type where the construction was non-uniform, and/or was using various ingredients added to the initial definition of spiking neural P systems (the SN P systems as defined initially are called here {\textquotedblleft}standard{\textquotedblright}). However, in the SubsetSum case, a price to pay for this improvement is that the solution is obtained either in a time which depends on the value of the numbers involved in the problem, or by using a system whose size depends on the same values, or again by using complicated regular expressions. A uniform solution to SAT is also provided, that works in constant time. },
	keywords = {Membrane computing; Spiking neural P system; SAT problem; Subset sum problem; Complexity},
	issn = {1567-7818},
	doi = {10.1007/s11047-008-9091-y},
	url = {http://dx.doi.org/10.1007/s11047-008-9091-y},
	author = {Alberto Leporati and Giancarlo Mauri and Claudio Zandron and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {448,
	title = {Descriptional complexity of tissue-like P systems with cell division},
	journal = {Lecture Notes in Computer Science},
	volume = {5715},
	year = {2009},
	month = {09/2009},
	pages = {168-178},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {In this paper we address the problem of describing the complexity of the evolution of a tissue-like P system with cell division. In the computations of such systems the number of (parallel) steps is not sufficient to evaluate the complexity. Following this consideration, Sevilla Carpets were introduced as a tool to describe the space-time complexity of P systems.
Sevilla Carpets have already been used to compare two different solutions of the Subset Sum problem (both designed in the framework of P systems with active membranes) running on the same instance. In this paper we extend the comparison to the framework of tissue-like P systems with cell division.
},
	isbn = {978-3-642-03744-3},
	doi = {10.1007/978-3-642-03745-0_21},
	url = {http://www.springerlink.com/content/u40g73212807k276/},
	author = {Daniel D{\'\i}az-Pernil and Pilar Gallego-Ortiz and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {450,
	title = {Membrane dissolution and division in P},
	journal = {Lecture Notes in Computer Science},
	volume = {5717},
	year = {2009},
	month = {09/2009},
	pages = {262-276},
	publisher = {Springer Berlin / Heidelberg},
	address = {Heidelberg, Alemania},
	abstract = {Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such systems. In particular we examine systems with dissolution, elementary division and where each membrane initially has at most one child membrane. Even though such systems may create exponentially many membranes, each with different contents, we show that their power is upperbounded by P.
This work is supported by a Project of Excellence TIC-581 from the Junta de Andaluc{\'\i}a, project TIN 2006 13425 of Ministerio de Educaci{\'o}n y Ciencia of Spain, and the Irish Research Council for Science, Engineering and Technology.},
	isbn = {978-3-642-03744-3 },
	doi = {10.1007/978-3-642-03745-0_28},
	url = {http://www.springerlink.com/content/087g35593267861m/},
	author = {Damien Woods and Niall Murphy and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {452,
	title = {P-Lingua 2.0: A software framework for cell-like P systems},
	journal = {International Journal of Computers, Communications and Control},
	volume = {IV},
	year = {2009},
	month = {09/2009},
	pages = {234-243},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {P-Lingua is a programming language for membrane computing. It was first presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9). In this paper, the models, simulators and formats included in P-Lingua in version 2.0 are explained. We focus on the stochastic model, associatedsimulators and updated features. Finally, we present one of the first applications based on P-Lingua: a tool for describing and simulating ecosystems.
},
	keywords = {Membrane computing, P systems, P-Lingua, Programming languages, software development},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=368},
	author = {Manuel Garc{\'\i}a-Quismondo and Rosa Guti{\'e}rrez-Escudero and Miguel A. Mart{\'\i}nez-del-Amor and Enrique F. Orejuela-Pinedo and Ignacio P{\'e}rez-Hurtado}
}
@article {580,
	title = {Spiking neural P systems with anti-spikes},
	journal = {International Journal of Computers, Communications and Control},
	volume = {IV},
	year = {2009},
	month = {09/2009},
	pages = {273-282},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {Besides usual spikes employed in spiking neural P systems, we consider "anti-spikes", which participate in spiking and forgetting rules, but also annihilate spikes when meeting in the same neuron.This simple extension of spiking neural P systems is shown to considerably simplify the universality proofs in this area: all rules become of the form bc  \rightarrow b{\textquoteright} or bc \rightarrow lambda, where b,b{\textquoteright}  are spikes or anti-spikes. Therefore, the regular expressions which control the spiking are the simplest possible, identifying only a singleton. A possible variation is not to produce anti-spikes in neurons, but to consider some {\textquoteleft}{\textquoteleft}inhibitory synapses", which transform the spikes which pass along them into anti-spikes. Also in this case, universality is rather easy to obtain, with rules of the above simple forms.},
	keywords = {Computability, Membrane computing, P system, Spiking neural P system},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=372},
	author = {Linqiang Pan and Gheorghe Paun}
}
@article {492,
	title = {An approach to ballistic deposition based on Membrane Computing},
	journal = {International Journal of Unconventional Computing},
	volume = {5},
	year = {2009},
	month = {06/2009},
	pages = {427-439},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {Ballistic Deposition was proposed by Vold [10] and Sutherland [9] as a model for colloidal aggregation. These early works were later extended to simulate the process of vapour 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 first particle it contacts, which may result in lateral growth. In this paper we present a first P system model for Ballistic Deposition with d = 1.},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUC\%205.5\%20contents.html},
	author = {Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {493,
	title = {Foreword. Special issue: Membrane Computing. Fifth Brainstorming Week on Membrane Computing.},
	journal = {International Journal of Unconventional Computing},
	volume = {5},
	year = {2009},
	month = {06/2009},
	pages = {389-390},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {The present volume contains a selection of papers resulting from the Fifth Brainstorming Week on Membrane Computing (BWMC5), held in Sevilla, from January 29 to February 2, 2007. The meeting was organized by the Research Group on Natural Computing (RGNC) from Department of Computer, Science and Artificial Intelligence of Sevilla University. The previous editions of this series of meetings were organized in Tarragona (2003), and Sevilla (2004, 2005, 2006), and on those occasions special issues of Natural Computing (volume 2, number 3, 2003), New Generation Computing (volume 22, number 4, 2004), Journal of Universal Computer Science (volume 10, number 5, 2004), Soft Computing (volume 9, number 9, 2005), International Journal of Foundations of Computer Science (volume 17, number 1, 2006), and Theoretical Computer Science (volume 372, numbers 2{\textendash}3, 2007) were published.
Membrane computing is an area of natural computing which studies models of computation inspired by the structure and functioning of living cells, and organization of cells in tissues and other structures. The resulting models (called P systems) are distributed parallel computing devices, processing multisets in compartments defined by membranes. Recently, also models inspired from the way the neurons communicate by means of electrical impulses (spikes) were introduced, under the name of spiking neural P systems.
Most classes of P systems are computationally universal and, if an exponential working space can be produced in polynomial time (e.g., by membrane division), then they are able to solve computationally hard problems in a feasible time. A series of applications were reported, especially in biology and bio-medicine, but also in computer graphics, cryptography, linguistics, economics, approximate optimization, etc. Several simulation programs (useful in applications) are available by now.
A comprehensive information about this research area (considered in 2003 by ISI as {\textquotedblleft}fast emerging research front in computer science{\textquotedblright}) can be found at the Website http://psystems.disco.unimib.it. A friendly introduction to this research area can be found in the first chapter of the volume Applications of Membrane Computing, Springer-Verlag, Berlin, 2006, edited by G. Ciobanu, Gh. P˘aun, M.J. P{\'e}rez-Jim{\'e}nez; a detailed presentation of this research area at the level of the beginning of 2002 can be found in the monograph Gh. Paun, Membrane Computing. An Introduction, Springer-Verlag, Berlin, 2002.
At the previously mentioned web address one can also find the proceedings of BWMC5 published in 2007 by Fenix Editora, Sevilla, containing all papers resulting from BWMC5. As usual, the meeting was extremely successful, in both the number of participants {\textendash} about 45 {\textendash} and, especially, the efficiency of interaction, with many discussions and considerable joint work, with many papers either continued or initiated during the meeting.
For the present volume we have selected only a few of these papers; they have been thoroughly reworked after the meeting and then they went through the standard refereeing procedure of the journal. All selected papers are significantly contributing to the development of the field and they were selected in such a way to cover a variety of topics currently investigated in membrane computing. For instance, basic ideas of membrane computing are addressed (versions of parallelism, controls in using the rules), for {\textquotedblleft}standard{\textquotedblright} P systems and generalizations (e.g., networks of cells), power and efficiency issues for spiking neural Psystems, as well a surprising application (in modeling ballistic deposition). Besides sound new results, all these papers contain stimulating ideas and research topics for further investigations.
As mentioned above, the Fifth Brainstorming on Membrane Computing was organized by the Research Group on Natural Computing from Sevilla University (http://www.gcn.us.es), with the support of the project TIN2006-13425 of the Ministerio de Educaci{\'o}n y Ciencia of Spain, of the III Plan Propio of Sevilla University, and of the Research Group PAI TIC 193 of the Junta de Andalucia.

},
	issn = {1548-7199},
	url = {http://www.oldcitypublishing.com/IJUC/IJUC\%205.5\%20contents.html},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {491,
	title = {Solving the independent Set problem by using tissue-like P systems with cell division},
	journal = {Methods and Models in Artificial and Natural Computation},
	volume = {5601},
	year = {2009},
	note = {A Homage to Professor Mira{\textquoteright}s Scientific Legacy. Lecture Notes on Computer Science},
	month = {06/2009},
	pages = {213-222},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {Tissue-like P systems with cell division is a computing model in the framework of Membrane Computing inspired by the intercellular communication and neuronal synaptics. It considers the cells as unit processors and the computation is performed by the parallel application of given rules. Division rules allow an increase of the number of cells during the computation. We present a polynomial-time solution for the Independent Set problem via a uniform family of such systems.},
	isbn = {978-3-642-02263-0},
	doi = {10.1007/978-3-642-02264-7},
	url = {http://www.springerlink.com/content/4k32v721u7725mx7/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {490,
	title = {On the efficiency of cell-like and tissue-like recognizing membrane systems},
	journal = {International Journal of Intelligent Systems},
	volume = {24},
	year = {2009},
	month = {05/2009},
	pages = {747-765},
	abstract = {Cell-like recognizing membrane systems are computational devices in the framework of membrane computing inspired from the structure of living cells, where biological membranes are arranged hierarchically. In this paper tissue-like recognizing membrane systems are presented. The idea is to consider that membranes are placed in the nodes of a graph, mimicking the cell intercommunication in tissues.
In this context, polynomial complexity classes associated with recognizing membrane systems can be defined. We recall the definition for cell-like systems, and we introduce the corresponding complexity classes for the tissue-like case. Moreover, in this paper two efficient solutions to the satisfiability problem are analyzed and compared from a complexity point of view. {\textcopyright} 2009 Wiley Periodicals, Inc.},
	issn = {0884-8173 },
	url = {http://www3.interscience.wiley.com/journal/122383409/abstract?CRETRY=1\&SRETRY=0},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {471,
	title = {A bibliography of spiking neural P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {207-212},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Gheorghe Paun}
}
@article {459,
	title = {Cell-like versus tissue-like P systems by means of Sevilla Carpets },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {109-121},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Sevilla Carpets are a handy tool for comparing computations performed
by different systems solving the same problem. Such Sevilla Carpets provide on one
hand quantitative information through parameters such as Weight, Surface and Average
weight, and on the other hand they also provide a fast glimpse on the complexity of the
computation thanks to their graphical representation.
   Up to now, Sevilla Carpets were only used on Cell-like P systems. In this paper
we present a first comparison by means of Sevilla Carpets of the computations of three
P systems (designed within different models), all of them solving the same instance of
the Subset Sum problem. Two of these solutions use Cell-like P systems with active
membranes, while the third one uses Tissue-like P systems with cell division.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Daniel D{\'\i}az-Pernil and Pilar Gallego-Ortiz and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {458,
	title = {Characterizing the aperiodicity of irreducible markov chains by using P Systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {81-96},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {It is well known that any irreducible and aperiodic Markov chain has exactly
one stationary distribution, and for any arbitrary initial distribution, the sequence of
distributions at time n converges to the stationary distribution, that is, the Markov
chain is approaching equilibrium as n {\textrightarrow} $\infty$.
    In this paper, a characterization of the aperiodicity in existential terms of some state
is given. At the same time, a P system with external output is associated with any
irreducible Markov chain. The designed system provides the aperiodicity of that Markov
chain and spends a polynomial amount of resources with respect to the size of the input.
A formal verification of this solution is presented and a comparative analysis with respect
to another known solution is described.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {461,
	title = {Characterizing tractability by tissue-like P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {169-180},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {In the framework of cell{\textendash}like membrane systems it is well known that the
construction of exponential number of objects in polynomial time is not enough to ef-
ficiently solve NP{\textendash}complete problems. Nonetheless, it may be sufficient to create an
exponential number of membranes in polynomial time. In the framework of recognizer
polarizationless P systems with active membranes, the construction of an exponential
workspace expressed in terms of number of membranes and objects may not suffice to
efficiently solve computationally hard problems.
    In this paper we study the computational efficiency of recognizer tissue P systems
with communication (symport/antiport) rules and division rules. Some results have been
already obtained in this direction: (a) using communication rules and forbidding division
rules, only tractable problems can be efficiently solved; (b) using communication rules
with length three and division rules, NP{\textendash}complete problems can be efficiently solved. In
this paper we show that the allowed length of communication rules plays a relevant role
from the efficiency point of view of the systems.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Rosa Guti{\'e}rrez-Escudero and Mario J. P{\'e}rez-Jim{\'e}nez and Miquel Rius-Font}
}
@article {465,
	title = {The computational complexity of uniformity and semi-uniformity in membrane systems},
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {73-84},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {We investigate computing models that are presented as families of finite
computing devices with a uniformity condition on the entire family. Examples include
circuits, membrane systems, DNA computers, cellular automata, tile assembly systems,
and so on. However, in this list there are actually two distinct kinds of uniformity condi-
tions.
    The first is the most common and well-understood, where each input length is mapped
to a single computing device that computes on the finite set of inputs of that length. The
second, called semi-uniformity, is where each input is mapped to a computing device for
that input. The former notion is well-known and used in circuit complexity, while the
latter notion is frequently found in literature on nature-inspired computing models, from
the past 20 years or so.
    Are these two notions distinct or not? For many models it has been found that these
notion are in fact the same, in the sense that the choice of uniformity or semi-uniformity
leads to characterisations of the same complexity classes. Here, we buck this trend and
show that these notions are actually distinct: we give classes of uniform membrane sys-
tems that are strictly weaker than their semi-uniform counterparts. This solves a known
open problem in the theory of membrane systems.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Niall Murphy and Damien Woods}
}
@article {463,
	title = {Computing backwards with P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {211-226},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Searching all the configurations C ' such that produce a given configuration
C, or, in other words, computing backwards in Membrane Computing is an extremely
hard task. The current approximations are based in heavy hand-made calculus by consid-
ering the specific features of the given configuration. In this paper we present a general
method for characterizing all the configurations C ' such that produce a given configura-
tion C in transition P systems without cooperation and without dissolution.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {469,
	title = {Efficiency of tissue P systems with cell separation },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {169-196},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {The most investigated variants of P systems in the last years are cell-like
models, especially in terms of efficiency. Recently, different new models of tissue-like
(symport/antiport) P systems have received important attention. This paper presents a
new class of tissue P systems with cell separation, where cell separation can generate new
workspace. Its efficiency is investigated, specifically, (a) only tractable problem can be
efficiently solved by using cell separation and communication rules with length at most
1, and (b) an efficient (uniform) solution to SAT problem by using cell separation and
communication rules with length at most 6 is presented. Further research topics and open
problems are discussed, too.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {466,
	title = {New normal forms for spiking neural P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {127-138},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {We consider a natural restriction in the architecture of a spiking neural P
system, namely, to have neurons of a small number of types (i.e., using a small number of
sets of rules), and we prove that three types of neurons are sufficient in order to generate
each recursively enumerable set of numbers as the distance between the first two spikes
emitted by the system or as the number of spikes in a specified neuron, in the halting
configuration. The case we investigate is that of spiking neural P systems with standard
rules, with delays, but without using forgetting rules; similar normal forms remain to be
found for other types of systems.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Linqiang Pan and Gheorghe Paun}
}
@article {464,
	title = {Notch signalling and cellular fate choices: A short review },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {227-230},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {During mammalian central nervous system (CNS) development, an enor-
mous variety of cell types are generated. This cell diversity is due in part to asymmetrical
cell division. Asymmetrical segregation of Numb, a cell-determinant protein, can result
in the differential activation of the Notch pathway. The Notch pathway defines one of
the few fundamental signalling pathways that govern metazoan development. Notch sig-
nals link the fate decisions of one cell to those of its neighbours. Notch activation has a
profound effect on many aspects of nervous system development. Here we present a brief
overview of Notch signalling and reiterate some relevant questions relating to the Notch
pathway.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Beverley M. Henley}
}
@article {457,
	title = {P system based model of an ecosystem of the scavenger birds },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {65-80},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {The Bearded Vulture (Gypaetus Barbatus) is an endangered species in Eu-
rope that feeds almost exclusively on bone remains provided by wild and domestic ungu-
lates. In [1], we presented a P system in order to study the evolution of these species in
the Pyrenees (NE Spain). Here, we present a new model that overcomes some limitations
of the previous work incorporating other scavenger species (predatory) and additional
prey species that provide food for the scavenger intraguild and interact with the Bearded
Vulture in the ecosystem. After the validation, the new model can be a useful tool for
the study of the evolution and management of the ecosystem. P systems provide a high
level computational modelling framework which integrates the structural and dynamical
aspects of ecosystems in a compressive and relevant way. The inherent stochasticity and
uncertainty in ecosystems is captured by using probabilistic strategies.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Antoni Margalida and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy}
}
@article {460,
	title = {P-Lingua 2.0: New features and first applications},
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {141-168},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {P-Lingua is a programming language for membrane computing. It was first
presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9).
In this paper, the models, simulators and formats included in P-Lingua in version 2.0 are
explained. We focus on the stochastic model, associated simulators and updated features.
Finally, we present two new applications based on P-Lingua 2.0: a tool for describing and
simulating ecosystems and a framework (currently under development) for P systems
design.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/7BWMC/volume/18_plingua_2_0.pdf},
	author = {Manuel Garc{\'\i}a-Quismondo and Rosa Guti{\'e}rrez-Escudero and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {462,
	title = {Performing arithmetic operations with spiking neural P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	year = {2009},
	month = {02/02/2009},
	pages = {181-198},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {We consider spiking neural P systems as devices which can be used to per-
form some basic arithmetic operations, namely addition, subtraction, comparison and
multiplication by a fixed factor. The input to these systems are natural numbers ex-
pressed in binary form, encoded as appropriate sequences of spikes. A single system
accepts as inputs numbers of any size. The present work may be considered as a first
step towards the design of a CPU based on the working of spiking neural P systems.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Alberto Leporati}
}
@proceedings {453,
	title = {Seventh Brainstorming Week on Membrane Computing. Volumen I},
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	note = {Rosa Guti{\'e}rrez-Escudero; Miguel {\'A}ngel Guti{\'e}rrez-Naranjo; Gheorghe Paun; Ignacio P{\'e}rez-Hurtado; Agust{\'\i}n Riscos-N{\'u}{\~n}ez (eds)},
	month = {02/02/2009},
	pages = {X+248},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Rosa Guti{\'e}rrez-Escudero and Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@proceedings {454,
	title = {Seventh Brainstorming Week on Membrane Computing. Volumen II},
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	note = {Miguel {\'A}ngel Mart{\'\i}nez-del-Amor; Enrique Francisco Orejuela-Pinedo; Gheorghe Paun; Ignacio P{\'e}rez-Hurtado; Agust{\'\i}n Riscos-N{\'u}{\~n}ez (eds.)},
	month = {02/02/2009},
	pages = {X+254},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Enrique F. Orejuela-Pinedo and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {456,
	title = {Simulation of recognizer P systems by using manycore GPUs },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {45-58},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Software development for cellular computing is growing up yielding new
applications. In this paper, we describe a simulator for the class of recognizer P systems
with active membranes, which exploits the massively parallel nature of the P systems
computations by using a massively parallel computer architecture, such as Compute
Unified Device Architecture (CUDA) from Nvidia, to obtain better performance in the
simulations. We illustrate it by giving a solution to the N-Queens problem as an example.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Jos{\'e} M. Cecilia and Gin{\'e}s D. Guerrero and Jos{\'e} M. Garc{\'\i}a}
}
@article {455,
	title = {Solving the N-Queens puzzle with P systems },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2009},
	month = {02/02/2009},
	pages = {199-210},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {The N -queens puzzle consists on placing N queens on an N {\texttimes} N grid in such
way that no two queens are on the same row, column or diagonal line. In this paper we
present a family of P systems with active membranes (one P system for each value of N )
that provides all the possible solutions to the puzzle.
},
	isbn = {978-84-613-2837-6},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {470,
	title = {Some open problems collected during 7th BWMC },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {197-206},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {A few open problems and research topics collected during the 7th Brain-
storming Week on Membrane Computing are briefly presented; further details can be
found in the papers included in the volume.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Gheorghe Paun}
}
@article {467,
	title = {Spiking neural P systems with anti-spikes },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {139-150},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {Besides usual spikes employed in spiking neural P systems, we consider
{\textquotedblleft}anti-spikes{\textquotedblright}, which participate in spiking and forgetting rules, but also annihilate spikes
when meeting in the same neuron. This simple extension of spiking neural P systems
is shown to considerably simplify the universality proofs in this area: all rules become
of the form bc {\textrightarrow} b or bc {\textrightarrow} λ, where b, b are spikes or anti-spikes. Therefore, the
regular expressions which control the spiking are the simplest possible, identifying only
a singleton. A possible variation is not to produce anti-spikes in neurons, but to consider
some {\textquotedblleft}inhibitory synapses{\textquotedblright}, which transform the spikes which pass along them into anti-
spikes. Also in this case, universality is rather easy to obtain, with rules of the above
simple forms.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Linqiang Pan and Gheorghe Paun}
}
@article {468,
	title = {Spiking neural P systems with neuron division and budding },
	journal = {7th Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2009},
	month = {02/02/2009},
	pages = {151-168},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {In order to enhance the efficiency of spiking neural P systems, we introduce
the features of neuron division and neuron budding, which are processes inspired by neural
stem cell division. As expected (as it is the case for P systems with active membranes),
in this way we get the possibility to solve computationally hard problems in polynomial
time. We illustrate this possibility with SAT problem.
},
	isbn = {978-84-613-2839-0},
	url = {http://www.gcn.us.es/?q=node/414},
	author = {Linqiang Pan and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {581,
	title = {A framework for complexity classes in membrane computing},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {225},
	year = {2009},
	month = {01/2009},
	pages = {319-328},
	publisher = {Elsevier Science Publishers B. V.},
	address = {Amsterdam, The Netherlands},
	abstract = {The purpose of the present work is to give a general idea about the existing results and open problems concerning the study of complexity classes within the membrane computing framework. To this aim, membrane systems (seen as computing devices) are briefly introduced, providing the basic definition and summarizing the key ideas, trying to cover the various approaches that are under investigation in this area - of course, special attention is paid to the study of complexity classes. The paper concludes with some final remarks that hint the reasons why this field (as well as other unconventional models of computation) is attracting the attention of a growing community. },
	issn = {1571-0661},
	url = {http://portal.acm.org/citation.cfm?id=1486437},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {449,
	title = {Hebbian learning from spiking neural P systems view},
	journal = {Lecture Notes in Computer Science},
	volume = {5391},
	year = {2009},
	month = {01/2009},
	pages = {217-230},
	publisher = {Springer Berlin / Heidelberg},
	address = {Heidelberg, Alemania},
	abstract = {Spiking neural P systems and artificial neural networks are computational devices which share a biological inspiration based on the flow of information among neurons. In this paper we present a first model for Hebbian learning in the framework of spiking neural P systems by using concepts borrowed from neuroscience and artificial neural network theory. },
	isbn = {978-3-540-95884-0},
	doi = {10.1007/978-3-540-95885-7_16},
	url = {http://www.springerlink.com/content/d548306632p77n64/},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {451,
	title = {Modeling ecosystems using P systems: the bearded vulture, a case study},
	journal = {Lecture Notes in Computer Science},
	volume = {5391},
	year = {2009},
	month = {01/2009},
	pages = {137-156},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The Bearded Vulture (Gypaetus barbatus) is an endangered species in Europe that feeds almost exclusively on bone remains of wild and domestic ungulates. In this paper, we present a model of an ecosystem related to the Bearded Vulture in the Pyrenees (NE Spain), by using P systems. The evolution of six species is studied: the Bearded Vulture and five subfamilies of domestic and wild ungulates upon which the vulture feeds. P systems provide a high level computational modeling framework which integrates the structural and dynamic aspects of ecosystems in a comprehensive and relevant way. P systems explicitly represent the discrete character of the components of an ecosystem by using rewriting rules on multisets of objects which represent individuals of the population and bones. The inherent stochasticity and uncertainty in ecosystems is captured by using probabilistic strategies. In order to experimentally validate the P system designed, we have constructed a simulator that allows us to analyze the evolution of the ecosystem under different initial conditions.},
	isbn = {978-3-540-95884-0},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-95885-7_11},
	url = {http://www.springerlink.com/content/g88tq90540671158/},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy and Antoni Margalida}
}
@article {571,
	title = {Modular Assembly of Cell Systems Biology Models Using P systems},
	journal = {International Journal of Foundations of Computer Science},
	volume = {20},
	year = {2009},
	month = {01/2009},
	pages = {427-442},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {In this paper we propose an extension of a systems/synthetic biology modelling
framework based on P systems that explicitly includes modularity. Modularisation in
cellular systems can be produced by chemical specificity, spatial localisation and/or temporal
modulation within cellular compartments. The first two of these modularisation
features, the focus of this paper, can be easily specified and analysed in P systems using
sets of rewriting rules to describe chemical specificity and membranes to represent spatial
localisation. Our methodology enables the assembly of cell systems biology models by
combining modules which represent functional subsystems. A case study consisting of a
bacterial colony system is presented to illustrate our approach.},
	keywords = {Modular Biology, P systems, Synthetic Biology, Systems Biology},
	issn = {0129-0541},
	doi = {10.1142/S0129054109006668},
	url = {http://www.cs.nott.ac.uk/~nxk/PAPERS/IJFCS_Nottingham.pdf},
	author = {Francisco J. Romero-Campero and Jamie Twycross and Miguel C{\'a}mara and Malcolm Bennett and Marian Gheorghe and Natalio Krasnogor}
}
@article {446,
	title = {A multiscale modelling framework based on P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {5391},
	year = {2009},
	month = {01/2009},
	pages = {63-77},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {Cellular systems present a highly complex organization at different scales including the molecular, cellular and colony levels. The complexity at each one of these levels is tightly interrelated. Integrative systems biology aims to obtain a deeper understanding of cellular systems by focusing on the systemic and systematic integration of the different levels of organization in cellular systems.
The different approaches in cellular modeling within systems biology have been classified into mathematical and computational frameworks. Specifically, the methodology to develop computational models has been recently called executable biology since it produces executable algorithms whose computations resemble the evolution of cellular systems.
In this work we present P systems as a multiscale modeling framework within executable biology. P system models explicitly specify the molecular, cellular and colony levels in cellular systems in a relevant and understandable manner. Molecular species and their structure are represented by objects or strings, compartmentalization is described using membrane structures and finally cellular colonies and tissues are modeled as a collection of interacting individual P systems.
The interactions between the components of cellular systems are described using rewriting rules. These rules can in turn be grouped together into modules to characterize specific cellular processes. One of our current research lines focuses on the design of cell systems biology models exhibiting a prefixed behavior through the automatic assembly of these cellular modules. Our approach is equally applicable to synthetic as well as systems biology.
},
	isbn = {978-3-540-95884-0},
	doi = {10.1007/978-3-540-95885-7_5},
	url = {http://www.springerlink.com/content/n226127713438106/},
	author = {Francisco J. Romero-Campero and Jamie Twycross and Cao Hongqing and Johnathan Blakes and Natalio Krasnogor}
}
@article {447,
	title = {A P-lingua programming environment for Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {5391},
	year = {2009},
	month = {01/2009},
	pages = {187-203},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {A new programming language for membrane computing, P-Lingua, is developed in this paper. This language is not designed for a specific simulator software. On the contrary, its purpose is to offer a general syntactic framework that could define a unified standard for membrane computing, covering a broad variety of models. At the present stage, P-Lingua can only handle P systems with active membranes, although the authors intend to extend it to other models in the near future.
P-Lingua allows to write programs in a friendly way, as its syntax is very close to standard scientific notation, and parameterized expressions can be used as shorthand for sets of rules. There is a built-in compiler that parses these human-style programs and generates XML documents that can be given as input to simulation tools, while different plugins can be designed to produce specific adequate outputs for existing simulators.
Furthermore, we present in this paper an integrated development environment that plays the role of an interface where P-Lingua programs can be written and compiled. We also present a simulator for the class of recognizer P systems with active membranes, and we illustrate it by following the writing, compiling and simulating processes with a family of P systems solving the SAT problem.},
	isbn = {978-3-540-95884-0},
	doi = {10.1007/978-3-540-95885-7_14},
	url = {http://www.springerlink.com/content/74177526wg3p7j1j/},
	author = {Daniel D{\'\i}az-Pernil and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {949,
	title = { Analele Universitatii din Bucuresti. Seria Informatica},
	journal = {Analele Universitatii din Bucuresti. Seria Informatica},
	year = {2009},
	pages = {1-22},
	publisher = {Facultatea de Matematica si Informatica, Universitatea din Bucuresti},
	edition = { LVIII},
	address = {Bucharest, Romania},
	issn = {1224-7170},
	author = {Rudolf Freund and Marian Kogler and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {569,
	title = {Asynchronous spiking neural P systems},
	journal = {Theoretical Computer Science},
	volume = {410},
	year = {2009},
	pages = {2352-2364},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2009.02.031},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.64.2211\&rep=rep1\&type=pdf},
	author = {Matteo Cavaliere and Omer Egecioglu and Oscar Ibarra and Mihai Ionescu and Gheorghe Paun and Sara Woodworth}
}
@article {599,
	title = {DNA computing by splicing and by insertion-deletion},
	journal = {Handbook of Natural Computing},
	year = {2009},
	publisher = {Springer-Verlag},
	isbn = {978-3-540-92911-6},
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-92911-6},
	author = {Gheorghe Paun},
	editor = {Grzegorz Rozenberg and Thomas B{\"a}ck and Joost N. Kok}
}
@article {519,
	title = {Efficient computation in rational-valued P systems},
	journal = {Mathematical Structures in Computer Science},
	volume = {19},
	year = {2009},
	pages = {1125-1139},
	publisher = {Cambridge University Press },
	abstract = {In this paper, we describe a new representation for deterministic rational-valued P systems that allows us to form a bridge between membrane computing and linear algebra. On the one hand, we prove that an efficient computation for these P systems can be described using linear algebra techniques. In particular, we show that the computation for getting a configuration in such P systems can be carried out by multiplying appropriate matrices. On the other hand, we also show that membrane computing techniques can be used to get the nth power of a given matrix.},
	issn = {0960-1295 },
	url = {http://journals.cambridge.org/action/displayAbstract?fromPage=online\&aid=6798448},
	author = {Nadia Busi and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {598,
	title = {Membrane computing},
	journal = {Handbook of Natural Computing},
	year = {2009},
	publisher = {Springer-Verlag},
	isbn = {978-3-540-92911-6},
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-92911-6},
	author = {Gheorghe Paun},
	editor = {Grzegorz Rozenberg and Thomas B{\"a}ck and Joost N. Kok}
}
@article {489,
	title = {Membrane Computing schema: A new approach to computation using string insertion},
	journal = {Algorithmic Bioprocesses},
	volume = {V},
	year = {2009},
	note = {A. Condon, D. Harel, J.N. Kon, A. Salomaa, E. Winfree (eds)},
	pages = {293-309},
	publisher = {Springer-Verlag},
	abstract = {In this paper, we introduce the notion of a membrane computing schema for string objects. We propose a computing schema for a membrane network (i.e., tissue-like membrane system) where each membrane performs unique type of operations at a time and sends the result to others connected through the channel. The distinguished features of the computing models obtained from the schema are:
1.  	only context-free insertion operations are used for string generation,
2.  	some membranes assume filtering functions for structured objects (molecules),
3.  	generating model and accepting model are obtained in the same schema, and both are computationally universal,
4.  	several known rewriting systems with universal computability can be reformulated by the membrane computing schema in a uniform manner.
The first feature provides the model with a simple uniform structure which facilitates a biological implementation of the model, while the second feature suggests further feasibility of the model in terms of DNA complementarity.
Through the third and fourth features, one may have a unified view of a variety of existing rewriting systems with Turing computability in the framework of membrane computing paradigm.
},
	isbn = {978-3-540-88868-0},
	issn = {1619-7127},
	doi = {10.1007/978-3-540-88869-7},
	url = {http://www.springerlink.com/content/p3205203u433797g/},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori},
	editor = {A. Condon and D. Harel and J. N. Kon and Arto Salomaa and Eric Winfree}
}
@article {554,
	title = {Membrane Computing. International Workshop WMC9},
	journal = {Lecture Notes in Computer Science},
	number = {5391},
	year = {2009},
	pages = {IX+402},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {This book constitutes the thoroughly refereed extended postproceedings of the 9th International Workshop on Membrane Computing, WMC 2008, held in Edinburgh, UK, in July 2008 under the auspices of the European Molecular Computing Consortium (EMCC) and the Molecular Computing Task Force of IEEE Computational Intelligence Society.

The 22 revised full papers presented together with 5 invited papers went through two rounds of reviewing and improvement. The papers in this volume cover all the main directions of research in membrane computing, ranging from theoretical topics in mathematics and computer science to application issues. A special attention was paid to the interaction of membrane computing with biology and computer science, focusing both on the biological roots of membrane computing, on applications of membrane computing in biology and medicine, and on possible electronically based implementations.},
	isbn = {978-3540958840},
	author = {David W. Corne and Pierluigi Frisco and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {600,
	title = {Membrane computing: History and brief introduction},
	journal = {Fundamental Concepts in Computer Science},
	number = {3},
	year = {2009},
	pages = {17-41},
	publisher = {Imperial College Press},
	chapter = {2},
	address = {London, UK},
	isbn = {978-1-84816-290-7},
	url = {http://www.icpress.co.uk/compsci/p596.html},
	author = {Gheorghe Paun},
	editor = {Erol Gelembe and Jean-Pierre Kahane}
}
@article {494,
	title = {M{\'e}todos formales en Computaci{\'o}n Bio-inspirada},
	journal = {L{\'o}gica e Filosof{\'\i}a da Ciencia},
	year = {2009},
	pages = {185-212},
	address = {Lisboa},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {O. Pombo and {\'A}ngel Nepomuceno}
}
@article {579,
	title = {New strategies of using the rules of a P system in a maximal way. Power and complexity},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {12},
	year = {2009},
	pages = {157-173},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {We examine the computing power and complexity of P systems
which use two strategies of applying the rules. One strategy is to maximize the
number of objects used in rules and the other is to maximize the number of rules
applied in each membrane. For P systems with cooperative multiset rewriting
rules, P systems with active membranes, and P systems with symport/antiport
rules we prove the computational universality for both these types of parallelism.
The computational complexity of the maximum consuming systems is studied for
systems with cooperative rules of two types, by using two known combinatorial
NP-complete problems, namely the knapsack problem and the integer linear
programming.},
	issn = {1453-8245 },
	url = {http://www.imt.ro/romjist/Volum12/Number12_2/pdf/03-Ciobanu.pdf},
	author = {Gabriel Ciobanu and Solomon Marcus and Gheorghe Paun}
}
@article {488,
	title = {Spiking neural P systems: Recent results, research topics},
	journal = {Algorithmic Bioprocesses},
	volume = {V},
	year = {2009},
	note = {A. Condon, D. Harel, J.N. Kon, A. Salomaa, E. Winfree (eds)},
	pages = {273-291},
	publisher = {Springer-Verlag},
	abstract = {After a quick introduction of spiking neural P systems (a class of P
systems inspired from the way neurons communicate by means of spikes, electrical
impulses of identical shape), and presentation of typical results (in general equiva-
lence with Turing machines as number computing devices, but also other issues, such
as the possibility of handling strings or infinite sequences), we present a long list of
open problems and research topics in this area, also mentioning recent attempts to
address some of them. The bibliography completes the information offered to the
reader interested in this research area.
},
	url = {http://www.gcn.us.es/6BWMC/leidenGR65.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {A. Condon and D. Harel and J. N. Kon and Arto Salomaa and Eric Winfree}
}
@article {366,
	title = {Modelling ecosystem using P systems: The bearded vulture, a case study},
	journal = {9th Workshop on Membrane Computing},
	year = {2008},
	month = {July 28-31, 2008},
	pages = {95-116},
	address = {Edinburgh, The U.K.},
	url = {http://www.cs.us.es/~marper/investigacion/PreProcWMC9.pdf},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy and Antoni Margalida}
}
@article {347,
	title = {A P-lingua programming environment for Membrane Computing},
	journal = {9th Workshop on Membrane Computing},
	year = {2008},
	month = {July 28-31, 2008},
	pages = {187-203},
	address = {Edinburgh, The U.K.},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez and Ignacio P{\'e}rez-Hurtado}
}
@article {367,
	title = {A spiking neural P system based model for Hebbian learning},
	journal = {9th Workshop on Membrane Computing},
	year = {2008},
	month = {July 28-31, 2008},
	pages = {189-207},
	address = {Edinburgh, The U.K.},
	url = {http://www.cs.us.es/~marper/investigacion/PreProcWMC9.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Pierluigi Frisco and David W. Corne and Gheorghe Paun}
}
@article {401,
	title = {On acceptance conditions for membrane systems: characterisations of L and NL},
	journal = {The Complexity of Simple Programs},
	year = {2008},
	month = {December},
	pages = {225-242},
	publisher = {Cork University Press},
	address = {Cork, Ireland},
	isbn = {978-1-906642-00-6},
	url = {http://www.cs.us.es/~dwoods/download/MurphyWoods-CSP08.pdf},
	author = {Niall Murphy and Damien Woods},
	editor = {Turlough Neary and Damien Woods and Anthony K. Seda and Niall Murphy}
}
@article {364,
	title = {Sorting omega networks simulated with P systems: Optimal data layout},
	journal = {International Workshop on Computing with Biomolecules},
	year = {2008},
	month = {August 27th},
	pages = {29-42},
	edition = {Osterreichische Computer Gesellschaft Komitee fur Offentlichkeitsarbeit},
	address = {Wien, Austria},
	url = {http://www.gcn.us.es/6BWMC/volume/dl-ps-4a.pdf},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez and Alexandru I. Tomescu}
}
@article {402,
	title = {A characterisation of NL using membrane systems without charges and dissolution},
	journal = {Unconventional Computation, UC{\textquoteright}08},
	volume = {5204},
	year = {2008},
	month = {August},
	pages = {164-176},
	publisher = {Springer},
	address = {Vienna (Austria)},
	url = {http://www.cs.us.es/~dwoods/download/MurphyWoods-UC08.pdf},
	author = {Niall Murphy and Damien Woods},
	editor = {Cristian Calude and Jos{\'e} F. Costa and Rudolf Freund and Marion Oswald and Grzegorz Rozenberg}
}
@article {,
	title = {A Fast Solution to the Partition Problem by Using Tissue-Like P Systems},
	journal = {Third International Conference on Bio-Inspired Computing},
	year = {2008},
	month = {9/28-10/1, 2008},
	pages = {43 - 47},
	edition = {University of South Australia IEEE Catalog Number CFP0801F-PRT},
	address = {Adelaide, Australia},
	isbn = {978-1-4244-2724-6},
	url = {http://www.bic-ta.org/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {D. Kearney and V. Nguyen and G. Gioiosa and T. Hendtlass}
}
@proceedings {555,
	title = {Proceedings of the Ninth Workshop on Membrane Computing},
	journal = {Ninth Workshop on Membrane Computing},
	year = {2008},
	month = {28/07/2008},
	pages = {V+449},
	publisher = {Heriot-Watt University},
	address = {Edinburgh, UK},
	url = {http://www.cs.us.es/~marper/investigacion/PreProcWMC9.pdf},
	author = {Pierluigi Frisco and David W. Corne and Gheorghe Paun}
}
@article {346,
	title = {A Software Tool for Generating Graphics by Means of P Systems},
	journal = {International Workshop on Computing with Biomolecules},
	year = {2008},
	month = {27/08/2008},
	pages = {87-100},
	publisher = {{\"O}sterreichische Computer Gesellschaft},
	address = {Vienna (Austria)},
	abstract = {The hand-made graphical representation of the configuration of a P system
becomes a hard task when the number of membranes and objects increases. In this paper
we present a new software tool, called JPLANT, for computing and representing the
evolution of a P system model with membrane creation. We also present some experiments
performed with JPLANT and point out new lines for the research in computer graphics
with membrane systems.},
	keywords = {Graphical representation, Membrane computing, P systems, Software},
	isbn = {978-3-85403-244-1},
	author = {Elena Rivero-Gil and Miguel A. Guti{\'e}rrez-Naranjo and {\'A}lvaro Romero-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Rudolf Freund and Marion Oswald and Kai Salomaa}
}
@article {360,
	title = {A software tool for verification of Spiking Neural P Systems},
	journal = {Natural Computing},
	volume = {7},
	year = {2008},
	note = {online version (http://dx.doi.org/10.1007/s11047-008-9083-y)},
	month = {12/2008},
	pages = {485-497},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {The formal verification of a Spiking Neural P System (SN P Systems, for short) designed for solving a given problem is usually a hard task. Basically, the verification process consists of the search of invariant formulae such that, once proved their validity, show the right answer to the problem. Even though there does not exist a general methodology for verifying SN P Systems, in (P{\u a}un et al., Int J Found Comput Sci 17(4):975{\textendash}1002, 2006) a new tool based on the transition diagram of the P system has been developed for helping the researcher in the search of invariant formulae. In this paper we show a software tool which allows to generate the transition diagram of an SN P System in an automatic way, so it can be considered as an assistant for the formal verification of such computational devices.},
	keywords = {Membrane computing; Spiking Neural P systems; Transition diagram},
	issn = {1567-7818},
	doi = {10.1007/s11047-008-9083-y},
	url = {http://dx.doi.org/10.1007/s11047-008-9083-y},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Daniel Ram{\'\i}rez-Mart{\'\i}nez}
}
@article {418,
	title = {Membrane computing and brane calculi. Old, new, and future bridges},
	journal = {Theoretical Computer Science},
	volume = {404},
	year = {2008},
	month = {09/2008},
	pages = {19-25},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {After a short discussion about similarities and dissimilarities of membrane computing and brane calculi, insisting mainly on some recent ideas of bridging the two areas of research, one recalls some details concerning certain classes of P systems based on brane calculi operations. Several open problems are formulated in this context.},
	issn = {0304-3975},
	doi = {http://dx.doi.org/10.1016/j.tcs.2008.04.001},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397508002466},
	author = {Gheorghe Paun}
}
@article {420,
	title = {Membrane systems with proteins embedded in membranes},
	journal = {Theoretical Computer Science},
	volume = {404},
	year = {2008},
	month = {09/2008},
	pages = {26-39},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes can evolve depending on the attached molecules. The evolution of membranes is performed by using rules that are motivated by the operation of pinocytosis (the pino rule) and the operation of cellular dripping (the drip rule) that take place in living cells. We show that such membrane systems are computationally universal. We also show that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking (which contains non-semilinear sets of vectors). If, moreover, the use of pino/drip rules is non-cooperative (i.e., not dependent on the proteins attached to membranes), then one generates a family of sets of vectors that is strictly included in the family of semilinear sets of vectors. We also consider a number of decision problems concerning reachability of configurations and boundness.},
	issn = {0304-3975 },
	author = {Robert Brijder and Matteo Cavaliere and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Dragos Sburlan}
}
@article {423,
	title = {On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution},
	journal = {Fundamenta Informaticae},
	volume = {87},
	year = {2008},
	month = {09/2008},
	pages = {79-91},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {Recognizer P systems with active membranes have proven to be very efficient computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we contribute to the study of the computational power of polarizationless recognizer P systems with active membranes. Precisely, we show that such systems are able to solve in polynomial time the NP-complete decision problem 3-SAT by using only dissolution rules and a form of strong division for non-elementary membranes, working in the maximallly parallel way.},
	issn = {0169-2968 },
	url = {http://portal.acm.org/citation.cfm?id=1487719\&dl=GUIDE,},
	author = {Claudio Zandron and Alberto Leporati and Claudio Ferretti and Giancarlo Mauri and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {425,
	title = {Solving subset sum by spiking neural P systems with pre-computed resources},
	journal = {Fundamenta Informaticae},
	volume = {87},
	year = {2008},
	month = {09/2008},
	pages = {61-77},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {Recently the possibility of using spiking neural P systems for solving computationally hard problems has been considered. Such solutions assume that some (possibly exponentially large) pre-computed resources are given in advance, provided that their structure is "regular" and they do not contain neither "hidden information" that simplify the solution of specific instances, nor an encoding of all possible solutions (that is, an exponential amount of information that allows to cheat while solving the instances of the problem). In this paper we continue this research line, and we investigate the possibility of solving numerical NP-complete problems such as SUBSET SUM. In particular, we first propose a semi-uniform family of spiking neural P systems in which every system solves a specific instance of SUBSET SUM. Then, we exploit a technique used to calculate ITERATED ADDITION with Boolean circuits to obtain a uniform family of spiking neural P systems in which every system is able to solve any instance of SUBSET SUM of a fixed size. All the systems here considered are deterministic, and their size generally grows exponentially with respect to the instance size.},
	issn = {0169-2968 },
	author = {Alberto Leporati and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {426,
	title = {Special issue on membrane computing fifth brainstorming week on membrane computing},
	journal = {Fundamenta Informaticae},
	volume = {87},
	year = {2008},
	month = {09/2008},
	pages = {1-2},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	url = {fi.mimuw.edu.pl/Preface871.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {355,
	title = {A uniform family of tissue P systems with cell division solving 3-COL in a linear time},
	journal = {Theoretical Computer Science},
	volume = {404},
	year = {2008},
	month = {09/2008},
	pages = {76-87},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models of tissue-like P systems have received much attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.},
	keywords = {Membrane computing; Tissue P systems; Cell division; 3-coloring problem},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2008.04.005 },
	url = {http://dx.doi.org/10.1016/j.tcs.2008.04.005},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {322,
	title = {Editing configurations of P systems},
	journal = {Fundamenta Informaticae},
	volume = {82},
	year = {2008},
	month = {08/2008},
	pages = {29-46},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {This paper proposes and investigates the possibility of transforming a configuration of a P system (the membrane structure and the multisets of symbol-objects present in the compartments) into another configuration by means of a given set of rules to be applied to the membranes and to the multisets of objects. Although this transformation is obtained during the computation in a P system, we consider it as a goal per se, as a pre-computation phase, when the system itself is built. In this framework, several important problems appear: the edit-distance between configurations (with respect to a given set of editing rules), normal forms, the reachability of configurations, or the existence of single configurations from which a given family of configurations can be constructed, only to mention a few. We investigate here some of these questions; the paper is mainly devoted to formulating problems in the new framework, to calling attention to the possible extensions and the usefulness of the present approach},
	issn = {0169-2968},
	url = {http://fi.mimuw.edu.pl/abs82.html},
	author = {Erzsebet Csuhaj-Varj{\'u} and Antonio di-Nola and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil}
}
@article {358,
	title = {Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems},
	journal = {International Journal of Foundations of Computer Science},
	volume = {19},
	year = {2008},
	month = {08/2008},
	pages = {859-871},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {	Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy were obtained in this framework.

In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Sch{\"u}tzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩ D), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systemsof weight (2,0) and star languages, as well as for context-free languages {\textendash} this time using insertion systems of weight (3, 0) and star languages.},
	keywords = {Insertion-deletion systems; Recursively enumerable languages; Context-free languages; Regular languages; 68Q42 (AMSC); 68Q45 (AMSC); 68Q50 (AMSC)},
	issn = {0129-0541},
	doi = {10.1142/S0129054108006005},
	url = {http://dx.doi.org/10.1142/S0129054108006005},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Takashi Yokomori}
}
@article {428,
	title = {Tissue-like P systems with dynamically emerging requests},
	journal = {International Journal of Foundations of Computer Science},
	volume = {19},
	year = {2008},
	month = {08/2008},
	pages = {729-745},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {We study tissue-like P systems which use string objects and communicate by introducing communication symbols in the strings. We prove that these systems are computationally complete and moreover, they are computationally efficient in the sense that NP-complete problems can be solved in this framework in polynomial time.},
	issn = {0129-0541},
	doi = {10.1142/S0129054108005917},
	url = {http://www.worldscinet.com/journals/ijfcs/19/preserved-docs/1903/S0129054108005917.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {354,
	title = {Spiking Neural P systems with extended rules: universality and languages},
	journal = {Natural Computing},
	volume = {7},
	year = {2008},
	month = {06/2008},
	pages = {147-166},
	publisher = {Springer Netherlands},
	abstract = {We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.},
	keywords = {chomsky hierarchy, Membrane computing, spiking neural P systems, Turing computability, Universality},
	issn = {1567-7818 (Print) 1572-9796 (Online)},
	doi = {10.1007/s11047-006-9024-6},
	url = {http://dx.doi.org/10.1007/s11047-006-9024-6},
	author = {Haiming Chen and Mihai Ionescu and Tseren-Onolt Ishdorj and Andrei Paun and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {323,
	title = { Modelling gene expression control using P systems: The Lac Operon, a case study},
	journal = {Biosystems},
	volume = {91},
	year = {2008},
	month = {03/2008},
	pages = {438-457},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {In this paper P systems are used as a formal framework for the specification and simulation of biological systems. In particular, we will deal with gene regulation systems consisting of protein{\textendash}protein and protein{\textendash}DNA interactions that take place in different compartments of the hierarchical structure of the living cell or in different individual cells from a colony. We will explicitly model transcription and translation as concurrent and discrete processes using rewriting rules on multisets of objects and strings. Our approach takes into account the discrete character of the components of the system, its random behaviour and the key role played by membranes in processes involving signalling at the cell surface and selective uptake of substances from the environment. Our systems will evolve according to an extension of Gillespie{\textquoteright}s algorithm, called Multicompartmental Gillespie{\textquoteright}s Algorithm. The well known gene regulation system in the Lac Operon in Escherichia coli will be modelled as a case study to benchmark our approach. 
},
	issn = {0303-2647},
	doi = {doi:10.1016/j.biosystems.2007.02.011 },
	url = {http://dx.doi.org/10.1016/j.biosystems.2007.02.011},
	author = {Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {321,
	title = { A model of the Quorum Sensing System in Vibrio Fischeri using P systems },
	journal = {Artificial Life},
	volume = {14},
	year = {2008},
	pages = {95-109},
	publisher = {MIT Press Journals },
	abstract = {Quorum sensing is a cell-density-dependent gene regulation system that allows an entire population of bacterial cells to communicate in order to regulate the expression of certain or specific genes in a coordinated way depending on the size of the population. We present a model of the quorum sensing system in Vibrio fischeri using a variant of membrane systems called P systems. In this framework each bacterium and the environment are represented by membranes, and the rules are applied according to an extension of Gillespie{\textquoteright}s algorithm called the multicompartmental Gillespie{\textquoteright}s algorithm. This algorithm runs on more than one compartment and takes into account the disturbance produced when chemical substances diffuse from one compartment or region to another one. Our approach allows us to examine the individual behavior of each bacterium as an agent as well as the emergent behavior of the colony as a whole and the processes of swarming and recruitment. Our simulations show that at low cell densities bacteria remain dark, while at high cell densities some bacteria start to produce light and a recruitment process takes place that makes the whole colony of bacteria do so. Our computational modeling of quorum sensing could provide insights leading to new applications where multiple agents need to robustly and efficiently coordinate their collective behavior based only on very limited information about the local environment.
},
	issn = {1064-5462},
	doi = {doi:10.1162/artl.2008.14.1.95},
	url = {http://www.mitpressjournals.org/doi/abs/10.1162/artl.2008.14.1.95?journalCode=artl},
	author = {Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {435,
	title = { Research topics arising from the (planned) P systems },
	journal = {6th Brainstorming Week on Membrane Computing},
	year = {2008},
	pages = {183-192},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {We formulate here a few technical (mathematical) open problems related to
the in vitro bio-chemical experiment planned in Technion for computing the Fibonacci
sequence in terms of P systems. So-called local-loop-free P systems are introduced and
their universality for various types of P systems as well as other issues are mentioned as
research questions.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/openPimplem.pdf},
	author = {Renana Gershoni and Ehud Keinan and Gheorghe Paun and Ron Piran and Tamar Ratner and Sivan Shoshani}
}
@article {357,
	title = {Computational Efficiency of Cellular Division in Tissue-like Membrane Systems},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {11},
	year = {2008},
	pages = {229-241},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	abstract = {Tissue-like P systems with cell division are computing models in the framework of membrane computing. They are inspired by the intercellular communication and neuronal synaptics, their structures being formalized by underlying graphs. As usual in membrane computing, division rules allow the construction of an exponential workspace (described by the number of cells) in a linear time. In this paper this ability is used for presenting a uniform linear{time solution for the (NP{\textendash}complete) Vertex Cover problem via a uniform family of such systems. This solution is compared to other ones obtained in the framework of cell-like membrane systems.},
	issn = {1453-8245},
	url = {http://www.imt.ro/romjist/Volum11/Number11_3/02-Diaz-Pernil.htm},
	author = {Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {441,
	title = {Computing by self-assembly: DNA molecules, polyominoes, cells},
	journal = {Systems Self-Assembly: Multidisciplinary Snapshots},
	year = {2008},
	pages = {49-78},
	publisher = {Elsevier},
	chapter = {3},
	address = {Amsterdam},
	abstract = {Self-assembly is a process that creates complex heirarchical structures through the statistical exploration of alternative configurations. These processes occur without external intervention. Self-Assembly processes are ubiquitous in nature. Understanding how nature produces self-assembled systems will represent an enormous leap forward in our technological capabilities. Robustness and versatility are some of the most important properties of self-assembling natural systems. Although systems where self-assembly occurs, or which are created by a self-assembling process, are remarkably vaired, some common principles are starting to be discerned. The unifying thread throughout the book is the "Computational Nature of Self-Assembling Systems.},
	isbn = {978-0-444-52865-0},
	author = {Marian Gheorghe and Gheorghe Paun},
	editor = {Natalio Krasnogor and Steven Gustafson and David A. Pelta and Jos{\'e} L. Verdegay}
}
@article {429,
	title = {A first model for hebbian learning with spiking neural P systems},
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {211-233},
	publisher = {Fenix Editora},
	address = {Sevilla, Spain},
	abstract = {Spiking neural P systems and artificial neural networks are computational
devices which share a biological inspiration based on the transmission of information
among neurons. In this paper we present a first model for Hebbian learning in the framework
of Spiking Neural P systems by using concepts borrowed from neuroscience and
artificial neural network theory.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/learning_br.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {440,
	title = {From cells to (silicon) computers, and back},
	journal = {New Computational Paradigms},
	year = {2008},
	pages = {343-371},
	publisher = {Springer},
	chapter = {3},
	address = {New York},
	abstract = {Although the whole history of computer science is marked by events related to and inspired from {\textquotedblleft}computations{\textquotedblright} taking place in living cells and organisms (human being included), in the last decades, this became a mainstream research direction, with important and well-established areas, such as evolutionary computing and neural computing, and with exciting new areas, such as DNA and membrane (cellular) computing. All these have both consequences on the efficiency of using standard computers, hopefully leading also to new types of hardware, and{\textemdash}maybe more importantly{\textemdash}on the very understanding of the notion of computing and, at the edge of science towards science fiction. Topics of this kind will be touched in the paper, mainly in relation with DNA and membrane computing.},
	isbn = {978-0-387-36033-1},
	doi = {10.1007/978-0-387-68546-5},
	url = {http://www.springerlink.com/content/x10k8u155683355u/},
	author = {Gheorghe Paun},
	editor = {S. Barry Cooper and Benedikt L{\"o}we and Andrea Sorbi}
}
@article {368,
	title = {Graphics and P systems: Experiments with JPLANT},
	journal = {Proceedings of the Sixth Brainstorming Week on Membrane Computing},
	year = {2008},
	pages = {241-254},
	publisher = {F{\'e}nix Editora},
	url = {http://www.gcn.us.es/6BWMC/volume/jplant.pdf},
	author = {Elena Rivero-Gil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Daniel D{\'\i}az-Pernil and Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {353,
	title = {Hierarchical clustering with Membrane Computing},
	journal = {Computing and Informatics},
	volume = {27},
	year = {2008},
	pages = {497-513},
	publisher = {Slovak Academy of Sciences},
	address = {Bratislava, Slovakia},
	issn = {1335-9150},
	url = {http://www.cs.us.es/~marper/investigacion/tesalonica.pdf},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {431,
	title = {An introduction to membrane computing, after 10 years, by means of a (partial) glossary},
	journal = {Second International Meeting on Membrane Computing and Biologically Inspired Process Calculi},
	year = {2008},
	address = {Iasi, Romania},
	author = {Gheorghe Paun}
}
@article {419,
	title = {Membrane computing as a modeling framework. Cellular systems case studies},
	journal = {Lecture Notes in Computer Science},
	volume = {5016},
	year = {2008},
	pages = {168-214},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of the living cell, and from the way cells cooperate in tissues, organs, or other populations of cells. This research area developed very fast, both at the theoretical level and in what concerns the applications. After a very short description of the domain, we mention here the main areas where membrane computing was used as a framework for devising models (biology and bio-medicine, linguistics, economics, computer science, etc.), then we discuss in a certain detail the possibility of using membrane computing as a high level computational modeling framework for addressing structural and dynamical aspects of cellular systems. We close with a comprehensive bibliography of membrane computing applications.},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-68894-5},
	author = {Gheorghe Paun and Francisco J. Romero-Campero}
}
@article {417,
	title = {Membrane computing: a general view},
	journal = {Annals of European Academy of Sciences},
	year = {2008},
	pages = {83-101},
	address = {Lieja, B{\'e}lgica},
	abstract = {We give an informal presentation of the basic ideas, results, and applications of membrane
computing, a branch of natural computing inspired by the structure and the functioning of
biological cells, cell tissues, or colonies of cells. Membrane computing has given rise to computing
models (called P systems) that are distributed and parallel, which process multisets of objects
in compartments defined by membranes.
After introducing the main classes of P systems, illustrated with some simple examples, we
recall some results, especially those that concern their computing power and computing effi-
ciency: the equivalence with Turing machines for many classes of P systems, and the possibility
of designing devices which are capable of solving computationally intractable problems in feasi-
ble time. We then briefly discuss some applications (to biology, bio-medicine, economics, etc.),
giving a typical example to illustrate this research direction. Finally, we report on some software
simulators and hardware implementations of P systems that have been developed.},
	url = {www.eurasc.org/annals/docs/Ibarra_TeamR_f(19).pdf},
	author = {Oscar Ibarra and Gheorghe Paun}
}
@article {422,
	title = {Natural computing. Between necessity and fashion },
	journal = {International Journal of Computers, Communications and Control},
	volume = {3},
	year = {2008},
	pages = {119-120},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {Many important steps in the history of computer science are related to and inspired from {\textquotedblleft}computations" taking
place in living cells and organisms. In the last decades this became a mainstream research direction {\textendash} not to say
a fashion, with important and well established areas, such as evolutionary computing and neural computing, and
with exciting new areas, such as DNA and membrane (cellular) computing. Bio-inspired computing (hence in the
benefit of computer science) has a counterpart in using computers (more general, computing theory) in biology,
and this gave rise to several research directions, such as bio-informatics, system biology, computational biology,
etc.},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=264},
	author = {Gheorghe Paun}
}
@article {432,
	title = {No cycles in compartments. Starting from Conformon-P systems},
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {157-169},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Starting from proofs of results about the computing power of conformon-
P systems, we infer several results about the power of certain classes of tissue-like P
systems with (cooperative) rewriting rules used in an asynchronous way, without cycles
in compartments. This last feature is related to an important restriction appearing when
dealing with lab implementations of P systems, that of avoiding local evolution loops of
objects.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/noLooopFin.pdf},
	author = {Pierluigi Frisco and Gheorghe Paun}
}
@article {433,
	title = {On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution},
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {261-274},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {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 features, such as electrical
charges (polarizations) associated to membranes, evolution rules, communication rules,
and strong or weak forms of division rules. In this paper we contribute to the study
of the computational power of polarizationless recognizer P systems with active membranes.
Precisely, we show that such systems are able to solve in polynomial time the
NP-complete decision problem 3-sat by using only dissolution rules and a form of strong
division for non{\textendash}elementary membranes, working in the maximal parallel way.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/strongdivision.pdf},
	author = {Claudio Zandron and Alberto Leporati and Claudio Ferretti and Giancarlo Mauri and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {430,
	title = {A P system modeling an ecosystem related to the bearded vulture},
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {51-66},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {The Bearded Vulture is one of the rarest raptors in Europe and it is an
endangered species. In this paper, we present a model of an ecosystem related with the
Bearded Vulture which is located in the Catalan Pyrenees, by using P systems. The
population dynamics constituted by the Bearded Vulture (that feeds almost exclusively
on bones) and other five subfamilies that provide the bones they feed on, is studied.
P systems provide a high level computational modeling framework which integrates
the structural and dynamical aspects of ecosystems in a comprehensive and relevant way.
P systems explicitly represent the discrete character of the components of an ecosystem by
using rewriting rules on multisets of objects which represent individuals of the population
and bones. The inherent stochasticity and uncertainty in ecosystems is captured by using
probabilistic strategies.
In order to give an experimental validation of the P system designed, we have constructed
a simulator that allows us to analyze the evolution of the ecosystem with different
initial conditions.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/vultures.pdf},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez and Delf{\'\i} Sanuy and Antoni Margalida}
}
@article {434,
	title = {P-Lingua: A programming language for membrane computing },
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {135-155},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Software development for cellular computing has already been addressed,
yielding a first generation of applications. In this paper, we develop a new programming
language: P-Lingua. Furthermore, we present a simulator for the class of recognizing P
systems with active membranes. We illustrate it by giving a solution to the SAT problem
as an example.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/plingua.pdf},
	author = {Daniel D{\'\i}az-Pernil and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@proceedings {436,
	title = {Sixth brainstorming week on membrane computing},
	journal = {6th Brainstorming Week on Membrane Computing},
	year = {2008},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/6BWMC_proceedings.htm},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Daniel D{\'\i}az-Pernil and Carmen Graciani-D{\'\i}az and Gheorghe Paun and Ignacio P{\'e}rez-Hurtado and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {437,
	title = {Solving numerical NP-complete problems by spiking neural P systems with pre-computed resources },
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {193-210},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Recently we have considered the possibility of using spiking neural P systems
for solving computationally hard problems, under the assumption that some (possibly exponentially
large) pre-computed resources are given in advance. In this paper we continue
this research line, and we investigate the possibility of solving numerical NP-complete
problems such as Subset Sum. In particular, we first propose a semi{\textendash}uniform family of
spiking neural P systems in which every system solves a specified instance of Subset
Sum. Then, we exploit a technique used to calculate Iterated Addition with boolean
circuits to obtain a uniform family of spiking neural P systems in which every system
is able to solve all the instances of Subset Sum of a fixed size. All the systems here
considered are deterministic, but their size generally grows exponentially with respect to
the instance size.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/subsetsum.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Alberto Leporati}
}
@article {438,
	title = {Solving the partition problem by using tissue-like P systems with cell division },
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {124-134},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Tissue-like P systems with cell division is a computing model in the framework
of Membrane Computing that shares with the spiking neural P system model a
similar biological inspiration. Namely, both models are based on the intercellular communication
and cooperation between neurons, respectively. Due to this fact, in both
models the devices have the same structure: a network of elementary units (cells in a
tissue and interconnected neurons, respectively). Nonetheless, the two models are quite
different. One of the differences is the ability of tissue-like P systems with cell division
for increasing the number of cells during the computation. In this paper we exploit this
ability and present a polynomial-time solution for the (NP-complete) Partition problem
via a uniform family of such P systems.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/agustin.pdf},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {527,
	title = {Special Issue on Membrane Computing. Preface},
	journal = {Fundamenta Informaticae},
	volume = {87},
	year = {2008},
	pages = {i-ii},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	issn = {0169-2968},
	url = {http://fi.mimuw.edu.pl/index.php/FI},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Spiking Neural P systems: An overview},
	journal = {Advancing Artificial Intelligence through Biological Process Applications },
	year = {2008},
	pages = {59-72},
	publisher = {IGI Global},
	chapter = {IV},
	abstract = {As science continues to advance, researchers are continually gaining new insights into the way living beings behave and function, and into the composition of the smallest molecules. Most of these biological processes have been imitated by many scientific disciplines with the purpose of trying to solve different problems, one of which is artificial intelligence.
Advancing Artificial Intelligence through Biological Process Applications presents recent advances in the study of certain biological processes related to information processing that are applied to artificial intelligence. Describing the benefits of recently discovered and existing techniques to adaptive artificial intelligence and biology, this book will be a highly valued addition to libraries in the neuroscience, molecular biology, and behavioral science spheres. },
	url = {http://www.igi-global.com/reference/details.asp?id=7991},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {A. Porto and A. Pazos and W. Buno}
}
@article {439,
	title = {Testing Einstein{\textquoteright}s formula on brownian motion using membrane computing },
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {171-182},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Brownian motion refers to erratic movements of small particles of solid matter
suspended in a fluid and it is the basis of the development of many fractals found
in Nature. In this paper we use the Membrane Computing model of P systems with
membrane creation and the software tool JPLANT [15] in order to check the Einstein{\textquoteright}s
theory on the Mean Square Displacement of Brownian motion.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/Brownian.pdf},
	author = {Manuel A. G{\'a}lvez-Santisteban and Miguel A. Guti{\'e}rrez-Naranjo and Daniel Ram{\'\i}rez-Mart{\'\i}nez and Elena Rivero-Gil}
}
@article {,
	title = {Tissue P systems with cell division},
	journal = {International Journal of Computers, Communications and Control},
	volume = {III},
	year = {2008},
	pages = {295-303},
	publisher = {Agora University Editing House - CCC Publications},
	address = {Oradea, Romania},
	abstract = {In tissue P systems several cells (elementary membranes) communicate through symport/antiport rules, thus carrying out a computation. We add to such systems the basic feature of (cell--like) P systems with active membranes -- the possibility to divide cells. As expected (as it is the case for P systems with active membranes), in this way we get the possibility to solve computationally hard problems in polynomial time; we illustrate this possibility with SAT problem.},
	keywords = {cell division rule, NP-complete problem, SAT problem, Tissue-like P systems},
	issn = {1841-9836},
	url = {http://www.journal.univagora.ro/?page=article_details\&id=139},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {582,
	title = {Tissue-like P systems communicating by request},
	journal = {Ramanujan Mathematical Society. Lecture Notes Series in Mathematics},
	year = {2008},
	pages = {143-154},
	publisher = {Ramanujan Mathematical Society},
	url = {http://www.ramanujanmathsociety.org/docs/lns/ln-issue3-contents.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {,
	title = {A logarithmic bound for solving Subset Sum with P systems},
	journal = {Lecture Notes in Computer Science},
	year = {2007},
	note = {In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)
Revised, Selected, and Invited Papers. Lecture Notes in Computer Science, Springer-Verlag, Berlin-Heidelberg, 4860 (2007), 257-270},
	month = {June 25-28, 2007},
	pages = {257-270},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The aim of our paper is twofold. On one hand we prove the ability of polarizationless P systems with dissolution and with division rules for non-elementary membranes to solve NP-complete problems in a polynomial number of steps, and we do this by presenting a solution to the Subset Sum problem. On the other hand, we improve some similar results obtained for different models of P systems by reducing the number of steps and the necessary resources to be of a logarithmic order with respect to k (recall that n and k are the two parameters used to indicate the size of an instance of the Subset Sum problem).
As the model we work with does not allow cooperative rules and does not consider the membranes to have an associated polarization, the strategy that we will follow consists on using objects to represent the weights of the subsets through their multiplicities, and comparing the number of objects against a fixed number of membranes. More precisely, we will generate k membranes in logk steps.},
	isbn = {978-3-540-77311-5},
	issn = {0302-9743 },
	doi = {10.1007/978-3-540-77312-2_16},
	url = {http://www.springerlink.com/content/tq37h93l8p454153/},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {403,
	title = {Active membrane systems without charges and using only symmetric elementary division characterise P},
	journal = {8th Workshop on Membrane Computing},
	volume = {4860},
	year = {2007},
	note = {Membrane Computing
8th International Workshop, WMC 2007
Thessaloniki, Greece, June 25-28, 2007
Revised Selected and Invited Papers},
	month = {June 25-28},
	pages = {367-384},
	publisher = {Springer},
	address = {Thessaloniki, Greece},
	url = {http://www.cs.us.es/~dwoods/download/MurphyWoods-WMC07.pdf},
	author = {Niall Murphy and Damien Woods},
	editor = {George Eleftherakis and Petros Kefalas and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {37,
	title = {Simulating the bitonic sort on a 2D-mesh with P systems},
	journal = {Eighth Workshop on Membrane Computing},
	year = {2007},
	month = {June 25-28},
	pages = {205-226},
	address = {Thessaloniki, Greece},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez and Alexandru I. Tomescu},
	editor = {George Eleftherakis and Petros Kefalas and Gheorghe Paun}
}
@article {374,
	title = {Simulating the bitonic sort using P systems},
	journal = {Membrane Computing, 8th International Workshop, WMC 2007},
	volume = {486},
	year = {2007},
	note = {In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)},
	month = {June 25-28},
	pages = {172-192},
	abstract = {This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log2  N). We apply it to the 2D mesh architecture, using the shuffled row-major indexing function. A correctness proof of the proposed algorithm is given. Two simulations with P systems are introduced and discussed. The first one uses dynamic communication graphs and follows the guidelines of the mesh version of the algorithm. The second simulation requires only symbol rewriting rules in one membrane.},
	isbn = {978-3-540-77311-5},
	doi = {10.1007/978-3-540-77312-2},
	url = {http://www.springerlink.com/content/x451465201253846/},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez and Alexandru I. Tomescu}
}
@article {,
	title = {Tissue simulator: A graphical tool for tissue P systems},
	journal = {16th International Symposium on Fundamentals of Computational Theory},
	year = {2007},
	month = {August 31, 2007},
	pages = {23-34},
	edition = {MTA SZTAKI},
	address = {Budapest, Hungary},
	abstract = {Recently, different new models of tissue-like P systems have received important attention from the scientific community. This paper is focused in a concrete model: recognizing tissue P system with cell division. A software application allowing to understand better this model is presented. A linear-time solution to an NP-complete problem from graph theory, the 3{\textendash}coloring problem is considered as a case study with this tool.},
	url = {http://www.sztaki.hu/tcs/acmc07/procpage.html},
	author = {Rafael Borrego-Ropero and Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {373,
	title = {Simulating apoptosis using discrete methods: A membrane system and a stochastic approach},
	journal = {Unconventional Computation, UC{\textquoteright}07},
	year = {2007},
	month = {August 15, 2007},
	pages = {50-63},
	address = {Kingston, Ontario, Canada},
	url = {http://www.cs.us.es/~marper/investigacion/uc-07.pdf},
	author = {John Jack and Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez and Andrei Paun and Oscar Ibarra}
}
@proceedings {38,
	title = {Fifth Brainstorming Week on Membrane Computing},
	journal = {Fifth Brainstorming Week on Membrane Computing},
	year = {2007},
	month = {29/01/2007},
	pages = {X+324},
	publisher = {F{\'e}nix Editora},
	address = {Seville (Spain)},
	isbn = {978-84-611-6776-0},
	url = {http://www.gcn.us.es/5BWMC/5BWMC_proceedings.htm},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@proceedings {560,
	title = {Proceedings of the Eighth Workshop on Membrane Computing WMC8},
	journal = {Eighth Workshop on Membrane Computing WMC8},
	volume = {4860},
	year = {2007},
	month = {25/06/2007},
	pages = {XI+453},
	publisher = {Springer},
	address = {Thessaloniki, Greece},
	isbn = {978-3-540-77311-5},
	doi = {10.1109/SYNASC.2008.44 },
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-77311-5?cm_mmc=Google-_-Book\%20Search-_-Springer-_-0},
	author = {George Eleftherakis and Petros Kefalas and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Computing morphisms by spiking neural P systems},
	journal = {International Journal of Foundations of Computer Science},
	volume = {18},
	year = {2007},
	month = {12/2007},
	pages = {1371-1382},
	abstract = {We continue the study of the spiking neural P systems considered as transducers of binary strings or binary infinite sequences, and we investigate their ability to compute morphisms. The class of computed morphisms is rather restricted: length preserving or erasing, and the so-called 2-block morphisms can be computed; however, non-erasing non-length-preserving morphisms cannot be computed.},
	keywords = {68Q10 (AMSC), 68Q42 (AMSC), 68Q45 (AMSC), Membrane computing, Morphism, Spiking neural P system},
	doi = {10.1142/S0129054107005418},
	url = {http://dx.doi.org/10.1142/S0129054107005418},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {572,
	title = {Spiking neural P systems with astrocyte-like control},
	journal = {Journal of Universal Computer Science},
	volume = {13},
	year = {2007},
	month = {11/2007},
	pages = {1707-1721},
	publisher = { Graz University of Technology and Universiti Malaysia Sarawak },
	abstract = {Spiking neural P systems are computing models inspired from the way the neurons communicate by means of spikes, electrical impulses of identical shapes. In this note we consider a further important ingredient related to brain functioning, the astrocyte cells which fed neurons with nutrients, implicitly controlling their functioning. Specifically, we introduce in our models only one feature of astrocytes, formulated as a control of spikes traffic along axons. A normal form is proved (for systems without forgetting rules) and decidability issues are discussed. },
	keywords = {Astrocyte, Membrane computing, Neural computing, Spiking neural P system},
	doi = {10.3217/jucs-013-11-1707},
	url = {http://www.jucs.org/jucs_13_11/spiking_neural_p_systems},
	author = {Gheorghe Paun}
}
@article {244,
	title = {A Linear Solution for Subset Sum Problem with Tissue P systems with Cell Division},
	journal = {Fifth Brainstorming Week on Membrane Computing},
	year = {2007},
	month = {1/29/07-2/2/07},
	pages = {113-130},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-611-6776-0},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {235,
	title = {A Membrane Computing Model for Ballistic Depositions},
	journal = {Fifth Brainstorming Week on Membrane Computing },
	year = {2007},
	month = {1/29/07-2/2/07},
	pages = {179-197},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-611-67},
	author = {Carmen Graciani-D{\'\i}az and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {234,
	title = {A software Tool for Dealing with Spiking Neural P Systems},
	journal = {Fifth Brainstorming Week on Membrane Computing },
	year = {2007},
	month = {1/29/07-2/2/07},
	pages = {299-313},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {978-84-611-67},
	author = {Daniel Ram{\'\i}rez-Mart{\'\i}nez and Miguel A. Guti{\'e}rrez-Naranjo},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {590,
	title = {Membrane Computing as a Framework for Bio-Modeling (an Informal Glimpse)},
	journal = {Lecture Notes in Computer Science},
	volume = {4545},
	year = {2007},
	month = {08/2007},
	pages = {23-35},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane computing is a well developed branch of natural computing, having as its goal to abstract computing models from the structure and the functioning of the living cell. A recent vivid direction of investigation in this area is devising models for and carrying out applications in biology/medicine and in other disciplines. We briefly present here the basic ideas of membrane computing, its interest for modeling in biology, as well as some applications. },
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73433-8},
	url = {http://www.springerlink.com/content/55446858373g5746/},
	author = {Gheorghe Paun}
}
@article {573,
	title = {Small universal spiking neural P systems},
	journal = {Biosystems},
	volume = {90},
	year = {2007},
	month = {08/2007},
	pages = {48-60},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {In search for small universal computing devices of various types, we consider here the case of spiking neural P systems (SN P systems), in two variants: as devices that compute functions and as devices that generate sets of numbers. We start with the first case and we produce a universal spiking neural P system with 84 neurons. If a slight generalization of the used rules is adopted, namely, we allow rules for producing simultaneously several spikes, then a considerable reduction, to 49 neurons, is obtained. For SN P systems used as generators of sets of numbers, we find a universal system with restricted rules having 76 neurons and one with extended rules having 50 neurons.},
	keywords = {Membrane computing; Spiking neural P system; Universality; Register machine},
	issn = {0303-2647},
	doi = {doi:10.1016/j.biosystems.2006.06.006 },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6T2K-4K96SC9-2\&_user=10\&_coverDate=08\%2F31\%2F2007\&_rdoc=1\&_fmt=high\&_orig=search\&_sort=d\&_docanchor=\&view=c\&_acct=C000050221\&_version=1\&_urlVersion=0\&_userid=10\&md5=9192819803734d88aaf8390ec3b817e1},
	author = {Andrei Paun and Gheorghe Paun}
}
@article {586,
	title = {Membrane systems with marked membranes},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {171},
	year = {2007},
	month = {07/2007},
	pages = {25-36},
	publisher = {Elsevier B.V.},
	address = {London, UK},
	abstract = {Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes can evolve depending on the attached molecules. The evolution of membranes is performed by using rules that are motivated by the operation of pinocytosis (the pino rule) and the operation of cellular dripping (the drip rule) that take place in living cells. We show that such membrane systems are computationally universal. We also show that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking (which contains non-semilinear sets of vectors). If, moreover, the use of pino/drip rules is non-cooperative (i.e., not dependent on the proteins attached to membranes), then one generates a family of sets of vectors that is strictly included in the family of semilinear sets of vectors. We also consider a number of decision problems concerning reachability of configurations and boundness.},
	keywords = {Brane calculi, Membrane computing},
	issn = {1571-0661},
	doi = {doi:10.1016/j.entcs.2007.05.005 },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B75H1-4P30GNX-4\&_user=10\&_coverDate=07\%2F05\%2F2007\&_rdoc=1\&_fmt=high\&_orig=search\&_sort=d\&_docanchor=\&view=c\&_searchStrId=1258705558\&_rerunOrigin=google\&_acct=C000050221\&_version=1\&_urlVersion=0\&_us},
	author = {Robert Brijder and Matteo Cavaliere and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Dragos Sburlan}
}
@article {589,
	title = {Spiking Neural P Systems. Power and Efficiency},
	journal = {Lecture Notes in Computer Science},
	volume = {4527},
	year = {2007},
	month = {06/2007},
	pages = {153-169},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {This is a brief survey of spiking neural P systems, a branch of membrane computing recently introduced with motivation from neural computing. Basic ideas, examples, some results, and several research topics are presented. },
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73053-8},
	url = {http://www.springerlink.com/content/8j062170878572pt/},
	author = {Gheorghe Paun}
}
@article {575,
	title = {Grammar systems versus membrane computing: the case of CD grammar systems},
	journal = {Fundamenta Informaticae},
	volume = {76},
	year = {2007},
	month = {03/2007},
	pages = {271-292},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {In this paper we discuss some relationships between grammar systems and P systems (membrane systems), two areas of computer science dealing with distributed computing models, but with different motivations and different types of basic ingredients. We extend one of the most important communication protocols of cooperating distributed (CD) grammar systems, the so-called t-derivation mode, to P systems with string-objects: if no rule can be applied to a string in a region of a P system, then the string is moved to a neighbouring region, depending on the communication mode either in exactly one direction (in or out) or in both directions. We describe the computational power of the obtained classes of P systems in comparison with families of languages generated by grammars in the Chomsky hierarchy or with CD grammar systems and formulate several problems for future research. },
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1232734},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {574,
	title = {Normal forms for spiking neural P systems},
	journal = {Theoretical Computer Science},
	volume = {372},
	year = {2007},
	month = {03/2007},
	pages = {196-217},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {The spiking neural P systems are a class of computing devices recently introduced as a bridge between spiking neural nets and membrane computing. In this paper we prove a series of normal forms for spiking neural P systems, concerning the regular expressions used in the firing rules, the delay between firing and spiking, the forgetting rules used, and the outdegree of the graph of synapses. In all cases, surprising simplifications are found, without losing the computational completeness {\textemdash} sometimes at the price of (slightly) increasing other parameters which describe the complexity of these systems.},
	keywords = {Membrane computing, normal form, Spiking neural P system, Universality},
	issn = {0304-3975},
	doi = {doi:10.1016/j.tcs.2006.11.025},
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6V1G-4MG065P-4\&_user=10\&_coverDate=03\%2F15\%2F2007\&_rdoc=1\&_fmt=high\&_orig=search\&_sort=d\&_docanchor=\&view=c\&_searchStrId=1258622819\&_rerunOrigin=google\&_acct=C000050221\&_version=1\&_urlVersion=0\&_us},
	author = {Oscar Ibarra and Andrei Paun and Gheorghe Paun and Alfonso Rodr{\'\i}guez-Pat{\'o}n and Petr Sosik and Sara Woodworth}
}
@article {583,
	title = {A quick overview of membrane computing with details about spiking neural P systems},
	journal = {Frontiers of Computer Science in China},
	volume = {1},
	year = {2007},
	month = {02/2007},
	pages = {37-49},
	publisher = {Higher Education Press, co-published with Springer-Verlag GmbH},
	abstract = {We briefly present the basic elements of membrane computing, a branch of natural computing inspired by the structure and functioning of living cells, then we give some details about spiking neural P systems, a class of membrane systems recently introduced, with motivations related to the way neurons communicate by means of spikes. In both cases, of general P systems and of spiking neural P systems, we introduce the fundamental concepts, give a few examples, then recall the types of results and of applications. A series of bibliographical references are provided. },
	keywords = {chomsky hierarchy, Computational biology, Membrane computing, Natural computing, P system, Spiking neural P system, Turing computability},
	issn = {1673-7350},
	doi = {10.1007/s11704-007-0005-4},
	url = {http://www.springerlink.com/content/t245j621t6k47g20/},
	author = {Gheorghe Paun}
}
@article {584,
	title = {Spiking neural P systems. A tutorial},
	journal = {Bulletin of the European Association for Theoretial Computer Science},
	volume = {91},
	year = {2007},
	month = {02/2007},
	pages = {145-159},
	publisher = {European Association for Theoretial Computer Science},
	abstract = {We briey present (basic ideas, some examples,
classes of spiking neural P systems, some results concerning their
power, research topics) a recently initiated branch of membrane
computing with motivation from neural computing. Further details
can be found at the web page of membrane computing, from
http://psystems.disco.unimib.it.},
	url = {http://cs.ioc.ee/yik/schools/win2007/paun/snppalmse.pdf},
	author = {Gheorghe Paun}
}
@article {,
	title = { A uniform solution to SAT using membrane creation},
	journal = {Theoretical Computer Science},
	volume = {371},
	year = {2007},
	pages = {54-61},
	address = {Amsterdam, Holanda},
	abstract = {In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first uniform, efficient solution to the SAT problem in the framework of recogniser P systems with membrane creation using dissolution rules. Recently the authors have proved that if the dissolution rules are not allowed to be used, then the polynomial complexity class associated with this variant of P systems is the standard complexity class P. This result, together with the main result of this paper, shows the surprising role of the apparently {\textquotedblleft}innocent{\textquotedblright} operation of membrane dissolution. The use of this type of rule establishes the difference between efficiency and non-efficiency for P systems with membrane creation, and provides a barrier between P and NP (assuming ). 

},
	keywords = {Cellular complexity classes, Membrane computing, Natural computing, SAT problem},
	doi = {10.1016/j.tcs.2006.10.013},
	url = {http://dx.doi.org/10.1016/j.tcs.2006.10.013},
	attachments = {http://www.gcn.us.es/biblio/themes/files/A Uniform Solution to SAT Using Membrane Creation.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {88,
	title = {Cellular modelling using P systems and process algebra},
	journal = {Progress in Natural Science},
	volume = {17},
	year = {2007},
	pages = {375-383},
	address = {Reino Unido},
	abstract = {In this paper various molecular chemical interactions are modelled under different computational paradigms. P systems and π-calculus are used to describe intra-cellular reactions like protein-protein interactions and gene regulation control.},
	keywords = {cellular modelling, P systems, process algebra.},
	issn = {1002-0071},
	url = {http://pub.nsfc.gov.cn/pinsen/ch/currentissue.aspx},
	author = {Francisco J. Romero-Campero and Marian Gheorghe and Gabriel Ciobanu and John M. Auld and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Computing along the axon},
	journal = {Progress in Natural Science},
	volume = {17},
	year = {2007},
	pages = {417-423},
	address = {Reino Unido},
	abstract = {A special form of spiking neural P systems, called axon P systems, corresponding to the activity of Ranvier nodes of neuron axon, is considered and a class of SN-like P systems where the computation is done along the axon is introduced and their language generative power is investigated.},
	keywords = {chomsky hierarchy, Membrane computing, spiking neural P systems},
	issn = {1002-0071},
	url = {http://pub.nsfc.gov.cn/pinsen/ch/reader/view_abstract.aspx?file_no=417\&flag=1},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Computing along the axon.pdf},
	author = {Haiming Chen and Tseren-Onolt Ishdorj and Gheorghe Paun}
}
@article {,
	title = {Editorial. Fourth Brainstorming Week on Membrane Computing},
	journal = {Theoretical Computer Science},
	volume = {372},
	year = {2007},
	pages = {123-124},
	address = {Amsterdam, Holanda},
	doi = {10.1016/j.tcs.2006.11.020 },
	url = {http://dx.doi.org/10.1016/j.tcs.2006.11.020},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Editorial Fourth Brainstorming Week on Membrane computing.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {How to express tumours using membrane systems},
	journal = {Progress in Natural Science},
	volume = {17},
	year = {2007},
	pages = {449-457},
	address = {Reino Unido},
	abstract = { In this paper we discuss the potential usefulness of membrane systems as tools for modelling tumours. The approach is followed both from a macroscopic and a microscopic point of view. In the first case, one considers the tumour as a growing mass of cells, focusing on its external shape. In the second case, one descends to the microscopic level, studying molecular signalling pathways that are crucial to determine if a cell is cancerous or not. In each of these approaches we work with appropriate variants of membrane systems.},
	keywords = {membrane system, modeling, tumour},
	issn = {1002-0071},
	url = {http://pub.nsfc.gov.cn/pinsen/ch/reader/view_abstract.aspx?file_no=449\&flag=1},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {,
	title = {A linear-time tissue P system based solution for the 3-coloring problem},
	journal = {Electronic Notes in Theoretical Computer Science },
	volume = {171},
	year = {2007},
	pages = {81-93},
	publisher = {Elsevier B.V.},
	abstract = {In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems. },
	keywords = {3-coloring problem, cell division, Membrane computing, Tissue P Systems},
	doi = {10.1016/j.entcs.2007.05.009 },
	url = {http://dx.doi.org/10.1016/j.entcs.2007.05.009},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {558,
	title = {Membrane Computing. International Workshop WMC8},
	journal = {International Workshop WMC8},
	number = {4860},
	year = {2007},
	pages = {XI+452},
	publisher = {Springer-Verlag},
	abstract = {This book constitutes the thoroughly refereed extended postproceedings of the 8th International Workshop on Membrane Computing, WMC 2007, held in Thessaloniki, Greece, in June 2007 under the auspices of the European Molecular Computing Consortium (EMCC). The 22 revised full papers presented together with 5 invited papers went through two rounds of reviewing and improvement. The papers in this volume cover all the main directions of research in membrane computing, ranging from theoretical topics in mathematics and computer science to application issues. A special attention was paid to the interaction of membrane computing with biology and computer science, focusing both on the biological roots of membrane computing, on applications of membrane computing in biology and medicine, and on possible electronically based implementations.},
	isbn = {978-3-540-77311-5},
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-77311-5?cm_mmc=Google-_-Book\%20Search-_-Springer-_-0},
	author = {George Eleftherakis and Petros Kefalas and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Multidimensional descriptional complexity of P systems},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {12},
	year = {2007},
	pages = {167-179},
	issn = {1430-189X},
	url = {http://jalc.de/search/j00_a.html},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {On a Paun{\textquoteright}s conjecture in membrane systems},
	journal = {Lecture Notes in Computer Science},
	volume = {4527},
	year = {2007},
	pages = {180-192},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We study a P{\u a}un{\textquoteright}s conjecture concerning the unsolvability of NP{\textendash}complete problems by polarizationless P systems with active membranes in the usual framework, without cooperation, without priorities, without changing labels, using evolution, communication, dissolution and division rules, and working in maximal parallel manner. We also analyse a version of this conjecture where we consider polarizationless P systems working in the minimally parallel manner. 
},
	isbn = {978-3-540-73052-1},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73053-8_18},
	url = {http://dx.doi.org/10.1007/978-3-540-73053-8_18},
	author = {Giancarlo Mauri and Mario J. P{\'e}rez-Jim{\'e}nez and Claudio Zandron}
}
@article {,
	title = {On string languages generated by Spiking Neural P systems },
	journal = {Fundamenta Informaticae},
	volume = {75},
	year = {2007},
	pages = {141-162},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems. 

},
	keywords = {chomsky hierarchy, Membrane computing, spiking neural P systems},
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1232299.1232308\&coll=\&dl=acm\&CFID=15151515\&CFTOKEN=6184618},
	author = {Haiming Chen and Rudolf Freund and Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {On the degree of parallelism in membrane systems},
	journal = {Theoretical Computer Science},
	volume = {372},
	year = {2007},
	pages = {183-195},
	address = {Amsterdam, Holanda},
	abstract = {In the literature, several designs of P systems might be found for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this paper, we introduce a new criterion for such a comparison: the degree of parallelism of a P system. With this aim, we define the labelled dependency graph associated with a P system, and we use this new concept for proving some results concerning the maximum number of applications of rules in a single step through the computation of a P system. 

},
	keywords = {Degree of parallelism, Dependency graph, Membrane computing, P systems},
	doi = {10.1016/j.tcs.2006.11.024 },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6V1G-4MG065P-3\&_user=603129\&_coverDate=03\%2F15\%2F2007\&_rdoc=1\&_fmt=\&_orig=search\&_sort=d\&view=c\&_acct=C000031118\&_version=1\&_urlVersion=0\&_userid=603129\&md5=112790e9b4c3a1d8e8dfc9b3ad0870cd},
	attachments = {http://www.gcn.us.es/biblio/themes/files/On the Degree of Parallelism in Membrane Systems.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {P systems with minimal parallelism},
	journal = {Theoretical Computer Science},
	volume = {378},
	year = {2007},
	pages = {117-130},
	address = {Amsterdam, Holanda},
	abstract = {A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. We contribute in this paper to this issue by considering the minimal parallelism of using the rules: if at least a rule from a set of rules associated with a membrane or a region can be used, then at least one rule from that membrane or region must be used, without any other restriction (e.g., more rules can be used, but we do not care how many). Weak as it might look, this minimal parallelism still leads to universality. We first prove this for the case of symport/antiport rules. The result is obtained both for generating and accepting P systems, in the latter case also for systems working deterministically. Then, we consider P systems with active membranes, and again the usual results are obtained: universality and the possibility to solve NP-complete problems in polynomial time (by trading space for time). },
	doi = {10.1016/j.tcs.2007.03.044 },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6V1G-4NCJCYC-6\&_user=603129\&_coverDate=06\%2F03\%2F2007\&_rdoc=1\&_fmt=\&_orig=search\&_sort=d\&view=c\&_acct=C000031118\&_version=1\&_urlVersion=0\&_userid=603129\&md5=792f253678ed31e6655e77c634dd8287},
	attachments = {http://www.gcn.us.es/biblio/themes/files/P systems with minimal parallelism.pdf},
	author = {Gabriel Ciobanu and Linqiang Pan and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Polarizationless P systems with active membranes working in the minimally parallel mode},
	journal = {Lecture Notes in Computer Science},
	volume = {4618},
	year = {2007},
	pages = {62-76},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. Such systems are shown to be computationally complete even when using only rules handling single objects in the membranes and avoiding the division of non-elementary membranes. Moreover, we elaborate an algorithm for solving NP-complete problems, yet in this case we need evolution rules generating at least two objects as well as rules for non-elementary membrane division. 
},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73554-0_8},
	url = {http://www.springerlink.com/content/y2844ttvjj3g18g5/},
	author = {Rudolf Freund and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {85,
	title = {Simulating FAS-induced apoptosis by using P systems},
	journal = {Progress in Natural Science},
	volume = {17},
	year = {2007},
	pages = {424-431},
	address = {Reino Unido},
	abstract = {In contrast to differential equations, P systems are an unconventional model of computation which takes into consideration the discrete character of the quantity of components and the inherent randomness that exists in biological phenomena. The key feature of P systems is their compartmentalised structure which represents the heterogeneity of the structural organisation of the cells, and where one can take into account the role played by membranes in the functioning of the system, for example signalling at the cell surface, selective uptake of substances from the media, diffusion across different compartments, etc. We show here that P systems can be a reliable tool for Systems Biology and could even outperform in some cases the current simulation techniques based on differential equations. We will also use a strategy based on the well known Gillespie algorithm but running on more than one compartment called Multi-compartmental Gillespie Algorithm.},
	keywords = {deterministic waiting times algorithm, FAS-induced apoptosis, multi-compartmental Gillespie algorithm., P systems},
	issn = {1002-0071},
	url = {http://pub.nsfc.gov.cn/pinsen/ch/reader/view_abstract.aspx?file_no=424\&flag=1},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Simulating FAS induced.pdf},
	author = {Smitha Cheruku and Andrei Paun and Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez and Oscar Ibarra}
}
@article {,
	title = {Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division},
	journal = {Lecture Notes in Computer Science},
	volume = {4527},
	year = {2007},
	pages = {170-179},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Tissue P systems with cell division is a computing model in the framework of Membrane Computing based on intercellular communication and cooperation between neurons. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to NP-complete problems in polynomial time. In this paper we present a solution to the Subset Sum problem via a family of such devices. This is the first solution to a numerical NP-complete problem by using tissue P systems with cell division. 
},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73053-8},
	url = {http://www.springerlink.com/index/q64n502j641026nu.pdf},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Special Issue on Membrane Computing},
	journal = {Theoretical Computer Science},
	volume = {372},
	number = {2-3},
	year = {2007},
	pages = {123-266},
	issn = {0304-3975},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {585,
	title = {Spiking neural P systems with an exhaustive use of rules},
	journal = {International Journal of Unconventional Computing},
	volume = {3},
	year = {2007},
	pages = {135-153},
	publisher = {Old City Publishing Inc.},
	address = {Philadelphia, USA},
	abstract = {We consider spiking neural P systems with a new type of rule application: whenever a rule is enabled in a neuron, it is used in an exhaustive manner, i.e., as many times as possible for the number of spikes from that neuron. Thus, also the number of spikes produced at a time in that neuron can be arbitrarily large; all produced spikes are transmitted to neighboring neurons through synapses. A result is associated with a computation as usual, in the form of the number of time units elapsed between the first two steps when the output neuron
spikes. In this framework, we prove the computational completeness of our systems, both as number generating devices and as number accepting devices. Several research topics are also pointed out.},
	issn = {1548-7199},
	url = {http://direct.bl.uk/bld/PlaceOrder.do?UIN=210412711\&ETOC=RN\&from=searchengine},
	author = {Mihai Ionescu and Gheorghe Paun and Takashi Yokomori}
}
@article {48,
	title = {Spiking neural P systems: An early survey},
	journal = {International Journal of Foundations of Computer Science},
	volume = {18},
	year = {2007},
	pages = {435-455},
	publisher = {World Scientific},
	address = {London, U.K.},
	keywords = {68Q10 (AMSC), 68Q42 (AMSC), 68Q45 (AMSC), chomsky hierarchy, Membrane computing, normal form, P system, register machine, semilinear set, spiking neuron},
	issn = {0129-0541},
	doi = {10.1142/S0129054107004772},
	url = {http://www.worldscinet.com/cgi-bin/details.cgi?id=voliss:ijfcs_1803\&type=toc},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Arto Salomaa}
}
@article {36,
	title = {Un marco formal para modelos de computaci{\'o}n bio-inspirados},
	journal = {L{\'o}gica, Filosof{\'\i}a del Lenguaje y de la L{\'o}gica},
	year = {2007},
	pages = {241-260},
	publisher = {Mergablum, Edici{\'o}n y Comunicaci{\'o}n S.L.},
	chapter = {XVII},
	attachments = {http://www.gcn.us.es/biblio/themes/files/esteve.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {{\'A}ngel Nepomuceno and Francisco J. Salguero and Fernando Soler-Toscano}
}
@article {,
	title = {Uniform Solution of QSAT using polarizationless active membranes},
	journal = {Lecture Notes in Computer Science},
	volume = {4664},
	year = {2007},
	pages = {122-133},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {It is known that the satisfiability problem (SAT) can be solved with a semi-uniform family of deterministic polarizationless P systems with active membranes with non{\textendash}elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a quantified Boolean formula (QSAT) can be solved by a uniform family of P systems of the same kind. 
The first author gratefully acknowledges the support by Academy of Finland, project 203667, and by the Supreme Council for Science and Technological Development of the Academy of Sciences of Moldova, project 06.411.03.04P. The second author wishes to acknowledge the support of the project TIN2005-09345-C04-01 of the Ministerio de Educaci{\'o}n y Ciencia of Spain, cofinanced by FEDER funds.
},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-74593-8},
	url = {http://www.springerlink.com/index/567256806100784t.pdf},
	author = {Artiom Alhazov and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {250,
	title = {Cell-like and tissue-like membrane systems as recognizer devices},
	journal = {NICSO 2006},
	year = {2006},
	month = {June 29-30},
	pages = {173-186},
	address = {Granada, Spain},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Cell-like and Tissue-like Membrane Systems as Recognizer Devices.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero},
	editor = {David A. Pelta and Natalio Krasnogor}
}
@article {,
	title = {An efficient solution to 3-COL with tissue P systems},
	journal = {Workshop on Membrane Computing and Biologically Inspired Process Calculi},
	year = {2006},
	month = {July 9},
	pages = {1-12},
	address = {Venecia, Italia},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Membrane Computing and Brane Calculi (Some Personal Notes)},
	journal = {Workshop on Membrane Computing and Biologically Inspired Process Calculi},
	year = {2006},
	month = {July 9},
	address = {Venecia, Italia},
	author = {Gheorghe Paun}
}
@article {,
	title = {Membrane Systems with Marked Membranes},
	journal = {Workshop on Membrane Computing and Biologically Inspired Process Calculi},
	year = {2006},
	month = {July 9},
	address = {Venecia, Italia},
	author = {Robert Brijder and Matteo Cavaliere and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Dragos Sburlan},
	editor = {Nadia Busi and Claudio Zandron}
}
@article {241,
	title = {P systems-based modelling of cellular signalling pathways},
	journal = {Workshop on Membrane Computing, WMC7},
	year = {2006},
	month = {July 17-21, 2006},
	pages = {54-73},
	address = {Leiden, Holanda},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Hendrik J. Hoogeboom and Gheorghe Paun and Grzegorz Rozenberg}
}
@proceedings {225,
	title = {Fourth Brainstorming Week on Membrane Computing},
	journal = {Fourth Brainstorming Week on Membrane Computing},
	volume = {II},
	year = {2006},
	month = {30/01/2006},
	pages = {XII+278},
	publisher = {F{\'e}nix Editora},
	address = {Seville (Spain)},
	isbn = {84-611-0519-2},
	url = {http://www.gcn.us.es/4BWMC/4BWMC_proceedings.htm},
	author = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {238,
	title = {The Growth of Branching Structures with P Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	month = {30/01-3/02/2006},
	pages = {253-265},
	publisher = {F{\'e}nix Editora},
	address = {Seville (Spain)},
	isbn = {84-611-0519-2},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@proceedings {562,
	title = {Pre-proceedings of the 7th Workshop on Membrane Computing},
	journal = {7th Workshop on Membrane Computing},
	volume = {4361},
	year = {2006},
	month = {17/07/2006},
	pages = {IX+537},
	publisher = {Springer},
	address = {Leiden, The Netherlands},
	abstract = {This book constitutes the thoroughly refereed extended postproceedings of the 7th International Workshop on Membrane Computing, WMC 2006, held in Leiden, Netherlands in July 2006.

The 27 revised full papers presented together with 7 invited papers went through two rounds of reviewing and improvement. The papers in this volume cover all the main directions of research in membrane computing, ranging from theoretical topics in mathematics and computer science, and to application issues. Special attention was paid to the interaction of membrane computing with biology, focusing both on the biological roots of membrane computing and on applications of membrane computing in biology and medicine.},
	keywords = {bioinformatics, Biological membrane systems, Biologically inspired computing, Brane calculi, complexity theory, Computational power, formal languages, information processing in cells, Membrane computing, molecular computing, Natural computing, P systems},
	isbn = {9783540690887},
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-69088-7?cm_mmc=Google-_-Book\%20Search-_-Springer-_-0},
	author = {Hendrik J. Hoogeboom and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {848,
	title = {Graphical Modelling of Higher Plants Using P Systems},
	journal = {7th Workshop on Membrane Computing WMC7},
	year = {2006},
	month = {17-21/07/2006},
	pages = {474-484},
	address = {Leiden (The Netherlands)},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Hendrik J. Hoogeboom and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {534,
	title = {Tratamiento computacional de la incertidumbre mediante sistemas celulares con membranas},
	journal = {V Congreso de la Sociedad de L{\'o}gica, Metodolog{\'\i}a y Filosof{\'\i}a de la Ciencia en Espa{\~n}a},
	year = {2006},
	month = {11/29/06-1/12/06},
	pages = {607-609},
	address = {Granada, Spain},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {236,
	title = {2006 Reseacrh Topics in Membrane Computing},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {235-251},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0519-2},
	author = {Gheorghe Paun},
	editor = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {A Case Study in (Mem)brane Computation: Generating {N^2 / N>=1}},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {I},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {81-97},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6 },
	author = {Nadia Busi and Miguel A. Guti{\'e}rrez-Naranjo},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {,
	title = {Fractals and P Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {65-86},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0519-2},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {240,
	title = {Solving 3-COL with Tissue P Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {17-29},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0519-2},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Spiking Neural P Systems with Extended Rules},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {I},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {241-265},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6},
	author = {Haiming Chen and Tseren-Onolt Ishdorj and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {237,
	title = {Two Universality Results for (Mem)brane Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {I},
	year = {2006},
	month = {1/30/06-2/3/06},
	pages = {49-62},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6},
	author = {Daniela Besozzi and Nadia Busi and Giuditta Franco and Rudolf Freund and Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {577,
	title = {Characterizations of context-sensitive languages and other language classes in terms of Symport/Antiport P systems},
	journal = {Theoretical Computer Science},
	volume = {358},
	year = {2006},
	month = {07/2006},
	pages = {88-103},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We give "syntactic" characterizations of context-sensitive languages (CSLs) in terms of some restricted models of symport/antiport P systems. These are the first such characterizations of CSLs in terms of P systems. In particular, we show the following for any language L over a binary alphabet: (1) Let m be any integer >= 1. Then L  is a CSL if and only if it can be accepted by a restricted symport/antiport P system with m membranes and multiple number of symbols (objects). Moreover, holding the number of membranes at m, there is an infinite hierarchy in computational power (within the class of binary CSLs) with respect to the number of symbols. (2) Let s  be any integer >= 14. Then L is a CSL if and only if it can be accepted by a restricted symport/antiport P system with s symbols and multiple number of membranes. Moreover, holding the number of symbols at s, there is an infinite hierarchy in computational power with respect to the number of membranes. (Similar results hold for languages over an alphabet of k >= 2 symbols.) Thus (1) and (2) say that in order for the restricted symport/antiport P systems to accept all binary CSLs, at least one parameter (either the number of symbols or the number of membranes) must grow. These are the first results of their kind in the P systems area. They contrast a known result that (unrestricted) symport/antiport P systems with s >= 2 symbols and m >= 1 membranes accept (or generate) exactly the recursively enumerable sets of numbers even for s + m = 6. We also note that previous characterizations of formal languages in the membrane computing literature are mostly for the Parikh images of languages.Variations of our model yield characterizations of regular languages, languages accepted by one-way log n space-bounded Turing machines, and recursively enumerable languages. },
	issn = {0304-3975},
	url = {http://portal.acm.org/citation.cfm?id=1163732},
	author = {Oscar Ibarra and Gheorghe Paun}
}
@article {576,
	title = {P Transducers},
	journal = {New Generation Computing},
	volume = {24},
	year = {2006},
	month = {03/2006},
	pages = {1-28},
	publisher = {Ohmsha, Ltd.},
	abstract = {We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The {\textquotedblleft}Sevilla carpet{\textquotedblright} of a computation is defined for P transducers, giving a representation of the control part for these P transducers. },
	keywords = {chomsky hierarchy, Membrane computing, transducer, turing machine},
	issn = {0288-3635},
	doi = {10.1007/BF03037291},
	url = {http://www.springerlink.com/content/5640181578u716hl/},
	author = {Gabriel Ciobanu and Gheorghe Paun and Gheorghe Stefanescu}
}
@article {,
	title = {On String Languages Generated by Spiking Neural P systems },
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {I},
	year = {2006},
	month = {01/30/07-2/3/07},
	pages = {169-193},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6},
	author = {Haiming Chen and Rudolf Freund and Mihai Ionescu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {245,
	title = {Normal Forms for Spiking Neural P Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	month = {01/30/06-02/3/06},
	pages = {105-135},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0519-2},
	author = {Oscar Ibarra and Gheorghe Paun and Alfonso Rodr{\'\i}guez-Pat{\'o}n and Petr Sosik and Sara Woodworth}
}
@article {,
	title = { On simulating a class of parallel architectures},
	journal = {International Journal of Foundations of Computer Science},
	volume = {17},
	year = {2006},
	pages = {91-110},
	address = {Singapur},
	abstract = {The purpose of this paper is twofold. On one hand, we introduce the concept of P system with dynamic communication graphs in its full generality, independent of applications. On the other hand, we illustrate one application of it to the simulation of a class of parallel architectures. In this last direction we extend previous work concerned with the simulation of particular architectures},
	keywords = {68M10 (AMSC), 68Q10 (AMSC), 68W10 (AMSC), dynamic communication graphs, Membrane computing, parallel architectures},
	doi = { 10.1142/S0129054106003711},
	url = {http://dx.doi.org/10.1142/S0129054106003711},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = { Preface. Special Issue Membrane Computing},
	journal = {International Journal of Foundations of Computer Science},
	volume = {17},
	year = {2006},
	pages = {1-2},
	address = {Singapur},
	url = {http://www.cs.us.es/~marper/investigacion/ijfcs.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/journal p. special issue MC.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = { Towards probabilistic model checking on P systems using PRISM},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = { 477-495},
	address = {Berl{\'\i}n},
	author = {Francisco J. Romero-Campero and Marian Gheorghe and Luca Bianco and Dario Pescini and Mario J. P{\'e}rez-Jim{\'e}nez and Rodica Ceterchi}
}
@article {,
	title = {Applications of Membrane Computing},
	journal = {Natural Computing Series },
	year = {2006},
	pages = {X+ 441p},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n},
	abstract = {Membrane computing is a branch of natural computing which investigates computing models abstracted from the structure and functioning of living cells and from their interactions in tissues or higher-order biological structures. The models considered, called membrane systems (P systems), are parallel, distributed computing models, processing multisets of symbols in cell-like compartmental architectures. In many applications membrane systems have considerable advantages {\textendash} among these are their inherently discrete nature, parallelism, transparency, scalability and nondeterminism.

In dedicated chapters, leading experts explain most of the applications of membrane computing reported so far, in biology, computer science, computer graphics and linguistics. The book also contains detailed reviews of the software tools used to simulate P systems.

},
	keywords = {Biocomputing, Bioinspired computing, Biologically inspired computing, Biologically motivated computing, Cell biology, DNA computing, Membrane computing, Natural computing, New computing paradigms, P systems},
	isbn = {978-3-540-25017-3},
	url = {http://www.springer.com/east/home/computer/foundations?SGWID=5-156-22-60398121-0},
	author = {Gabriel Ciobanu and Mario J. P{\'e}rez-Jim{\'e}nez and Gheorghe Paun}
}
@article {252,
	title = {An Approach to the degree of parallelism in P systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {II},
	year = {2006},
	pages = {87-104},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0519-2},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero},
	editor = {Carmen Graciani-D{\'\i}az and Gheorghe Paun and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {532,
	title = {Available membrane computing software},
	journal = {Applications of Membrane Computing},
	year = {2006},
	pages = {411-436},
	publisher = {Springer-Verlag},
	chapter = {15},
	abstract = {The simulation of a P system with current computers is a quite complex task. P systems are intrinsically non deterministic computational devices and therefore their computation trees are difficult to store and handle with one-processor (or bounded number of processors) computers. Nevertheless, there exists a first generation of simulators which can be successfully used for pedagogical purposes and also as assistant tools for researchers. This paper summarizes one of these simulators, presenting the state-of-the-art of the available software for simulating (different variants of) cell-like P systems.},
	isbn = {978-3-540-25017-3},
	url = {http://www.cs.us.es/~marper/investigacion/vaps-2.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/vaps-2.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Gabriel Ciobanu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Bounding the indegree of Spiking Neural P systems},
	journal = {Turku Center for Computer Science - TUCS},
	volume = {773},
	year = {2006},
	pages = {1-8},
	address = {Turku, Finlandia},
	abstract = {We continue the search of normal forms for spiking neural p systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.},
	keywords = {indegree of graph, Membrane computing, recursively enumerable, spike train, spiking neuron, synapses},
	url = {http://www.tucs.fi/publications/attachment.php?fname=TR773.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Arto Salomaa}
}
@article {,
	title = {A Case Study in (Mem)Brane Computation: Generating Squares of Natural Numbers },
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {233-249},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms with respect to their ability to act as generator devices. In particular, we show different ways of generating the set  in P systems and in Brane Calculi. 
},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516},
	url = {http://www.springerlink.com/index/n6030wrj402t4531.pdf},
	author = {Nadia Busi and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {529,
	title = {Characterizing Tractability by Cell-Like Membrane Systems},
	journal = {Formal models, languages and applications},
	volume = {66},
	year = {2006},
	pages = {137-154},
	publisher = {World Scientific Publishing Company},
	chapter = {9},
	address = {Singapore},
	abstract = {In this paper we present a polynomial complexity class in the framework
of membrane computing. In this context, and using accepting transition
P systems, we provide a characterization of the standard computational
class P of problems solvable in polynomial time by deterministic Turing
machines.},
	isbn = {978-981-256-889-2},
	url = {http://www.worldscibooks.com/compsci/6180.html},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and {\'A}lvaro Romero-Jim{\'e}nez},
	editor = {K. G. Subramanian and K. Rangarajan and M. Mukund}
}
@article {,
	title = {Classifying states of a finite Markov chains with Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {266-278},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present a method to classify the states of a finite Markov chain through membrane computing. A specific P system with external output is designed for each boolean matrix associated with a finite Markov chain. The computation of the system allows us to decide the convergence of the process because it determines in the environment the classification of the states (recurrent, absorbent, and transient) as well as the periods of states. The amount of resources required in the construction is polynomial in the number of states of the Markov chain. 
},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516},
	url = {http://www.springerlink.com/content/fnm78581p53366g8/?p=7483d1633ed448c2a8a9414d09ea1502\&pi=16},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez and Alba Zaragoza}
}
@article {587,
	title = {Communication membrane systems with active symports},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {11},
	year = {2006},
	pages = {241-262},
	address = {Germany},
	issn = {1430-189X},
	url = {http://theo.cs.uni-magdeburg.de/cgi-bin/theo/j_sbibtex/jalc/search/j00.bib?bibtex=jalc110301},
	author = {Robert Brijder and Matteo Cavaliere and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Dragos Sburlan}
}
@article {,
	title = {Complexity Classes Addressed Via Membrane Computing},
	journal = {Irish Conference on the Mathematical Foundations of Computer Science and Information Technology},
	year = {2006},
	address = {Cork, Ireland},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Computational efficiency of dissolution rules in membrane systems},
	journal = {International Journal of Computer Mathematics},
	volume = {83},
	year = {2006},
	pages = {593-611},
	address = {Londres},
	abstract = {Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in polynomial time is not sufficient to solve NP-complete problems in polynomial time. On the other hand, when an exponential number of membranes is created and used as workspace, the situation is very different. Two operations in P systems (membrane division and membrane creation) capable of constructing an exponential number of membranes in linear time are studied in this paper. NP-complete problems can be solved in polynomial time using P systems with active membranes and with polarizations, but when electrical charges are not used, then dissolution rules turn out to be very important. We show that in the framework of P systems with active membranes but without polarizations and in the framework of P systems with membrane creation, dissolution rules play a crucial role from the computational efficiency point of view.},
	keywords = {Computational efficiency; Dissolution rules; Membrane systems},
	doi = {10.1080/00207160601065413},
	url = {http://www.informaworld.com/smpp/content~content=a769606660~db=all~order=page},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Computational Efficiency.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {533,
	title = {Computationally Hard Problems Addressed Through P Systems},
	journal = {Applications of Membrane Computing},
	year = {2006},
	pages = {315-346},
	publisher = {Springer-Verlag Berlin Heidelberg},
	chapter = {12},
	address = {Germany},
	isbn = {978-3-540-25017-3},
	doi = {10.1007/3-540-29937-8_12},
	url = {http://dx.doi.org/10.1007/3-540-29937-8_12},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Gabriel Ciobanu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Computing with spiking neural P systems: Traces and small universal systems},
	journal = {Lecture Notes in Computer Science},
	volume = {4287},
	year = {2006},
	pages = {1-16},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Recently, the idea of spiking neurons and thus of computing by spiking was incorporated into membrane computing, and so-called spiking neural P systems (abbreviated SN P systems) were introduced. Very shortly, in these systems neurons linked by synapses communicate by exchanging identical signals (spikes), with the information encoded in the distance between consecutive spikes. Several ways of using such devices for computing were considered in a series of papers, with universality results obtained in the case of computing numbers, both in the generating and the accepting mode; generating, accepting, or processing strings or infinite sequences was also proved to be of interest. 
In the present paper, after a short survey of central notions and results related to spiking neural P systems (including the case when SN P systems are used as string generators), we contribute to this area with two (types of) results: (i) we produce small universal spiking neural P systems (84 neurons are sufficient in the basic definition, but this number is decreased to 49 neurons if a slight generalization of spiking rules is adopted), and (ii) we investigate the possibility of generating a language by following the trace of a designated spike in its way through the neurons. 
},
	isbn = {978-3-540-49024-1},
	issn = {0302-9743},
	doi = {10.1007/11925903_1},
	url = {http://www.springerlink.com/content/b468k3xr45741t57/},
	author = {Mihai Ionescu and Andrei Paun and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {588,
	title = {Event-related outputs of computations in P systems},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {11},
	year = {2006},
	pages = {263-278},
	address = {Germany },
	abstract = {We briefly investigate the idea to consider as the result of a computation in a P system the number of steps elapsed between two events produced during the computation. Specifically, we first consider the case when the result of a computation is defined in terms of events related to using rules, introducing objects, or meeting objects. Universality is easily obtained in each case for symport/antiport P systems. Then, we address the case when the number computed by a system is the length of a computation itself.
We obtain a few results both for catalytic multiset-rewriting and for symport/antiport systems (in each case, also with using membrane dissolution) showing that non-semilinear sets of vectors can be computed in this way. A general non-universality result is proved for this case - no system, of any type, can have as the length of its halting computations all sets of numbers computable by Turing machines. The general problem, of characterizing the sets of numbers computed in this way, remains open.},
	issn = {1430-189X},
	url = {http://www.gcn.us.es/3BWMC/bravolpdf/bravol107.pdf},
	author = {Matteo Cavaliere and Rudolf Freund and Alexander Leistch and Gheorghe Paun}
}
@proceedings {,
	title = {Fourth Brainstorming Week on Membrane Computing. Volumen I},
	volume = {I},
	year = {2006},
	note = {Miguel A. Guti{\'e}rrez-Naranjo; Gheorghe Paun; Agust{\'\i}n Riscos-N{\'u}{\~n}ez; Francisco J. Romero-Campero (eds.)},
	pages = {XII+284},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {148,
	title = {Graphical Modeling of Higher Plants Using P Systems },
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {496-506},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {L systems have been widely used to model and graphically represent the growth of higher plants [20]. In this paper we continue developing the framework introduced in [21], which make use of the topology of membrane structures to model the morphology of branching structures.},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516_31},
	url = {http://dx.doi.org/10.1007/11963516_31},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Handling languages with spiking neural P systems with extended rules},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {9},
	year = {2006},
	pages = {151-162},
	address = {Bucarest},
	url = {http://www.cs.us.es/~marper/investigacion/res-romjist.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/handling lgs with spiking....pdf},
	author = {Haiming Chen and Tseren-Onolt Ishdorj and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Handling Markov chains with Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {4135},
	year = {2006},
	pages = {72-85},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we approach the problem of computing the n{\textendash}th power of the transition matrix of an arbitrary Markov chain through membrane computing. The proposed solution is described in a semi{\textendash}uniform way in the framework of P systems with external output. The amount of resources required in the construction is polynomial in the number of states of the Markov chain and in the power. The time of execution is linear in the power and is independent of the number of states involved in the Markov chain.},
	isbn = {978-3-540-38593-6},
	issn = {0302-9743},
	doi = {10.1007/11839132_7},
	url = {http://www.springerlink.com/content/52t0n456t4176113/},
	author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez and Alba Zaragoza}
}
@article {,
	title = {Languages in Membrane Computing: Some Details for Spiking Neural P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {4036},
	year = {2006},
	pages = {20-35},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {After a brief introduction to membrane computing, pointing out the more important intersections with formal language theory, we survey a series of recent results related to spiking neural P systems used as devices for handling languages. Several open problems are formulated. 
},
	isbn = {978-3-540-35428-4},
	issn = {0302-9743},
	doi = {10.1007/11779148},
	url = {http://www.springerlink.com/index/q2247426g5jr6510.pdf},
	author = {Gheorghe Paun}
}
@article {,
	title = {A linear time solution for QSAT with membrane creation},
	journal = {Lecture Notes in Computer Science},
	volume = {3850},
	year = {2006},
	pages = {241-252},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The usefulness of P systems with membrane creation for solving NP problems has been previously proved (see [2, 3]), but, up to now, it was an open problem whether such P systems were able to solve PSPACE-complete problems in polynomial time. In this paper we give an answer to this question by presenting a uniform family of P system with membrane creation which solves the QSAT-problem in linear time. 
},
	isbn = {978-3-540-30948-2},
	issn = {0302-9743},
	doi = {10.1007/11603047},
	url = {http://www.springerlink.com/content/f581751081374261/?p=b39de80f23a244a2b3abbcfb36e1340a\&pi=16},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {205,
	title = {Membrane Computing (6th International Workshop, WMC 2005, Revised Selected and Invited Papers)},
	journal = {Lecture Notes in Computer Science},
	volume = {3850 },
	year = {2006},
	note = {Rudolf Freund; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (eds.)},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-30948-9},
	issn = {03029743},
	author = {Rudolf Freund and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {206,
	title = {Membrane Computing (7th International Workshop, WMC 2006 Leiden, The Netherlands, July 2006)},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa; Hendrik Jan Hoogeboom (Eds.)},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-69088-3},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa and Hendrik J. Hoogeboom}
}
@article {,
	title = {Membrane Computing and Economics: Numerical P Systems},
	journal = {Fundamenta Informaticae},
	volume = {73},
	year = {2006},
	pages = {213-227},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve, starting from initial values, by means of production functions and repartition protocols. We prove that non-deterministic systems of this type, using polynomial production functions, characterize the Turing computable sets of natural numbers, while deterministic systems, with polynomial production functions having non-negative coefficients, compute strictly more than semilinear sets of natural numbers. A series of research topics to be addressed in this framework are mentioned.

},
	keywords = {economics, Membrane computing, Turing computability, Universality},
	issn = {0169-2968 },
	url = {http://portal.acm.org/citation.cfm?id=1231159.1231179\&coll=GUIDE\&dl=GUIDE\&CFID=1691426\&CFTOKEN=24108515},
	author = {Gheorghe Paun and Radu  Paun}
}
@article {,
	title = {A Membrane Computing View on Tumours},
	journal = {International Conference Bio-Inspired Computing-Theory and Applications},
	year = {2006},
	address = {Wuhan, China},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {561,
	title = {Membrane Computing. International workshop WMC7},
	journal = {Lecture Notes in Computer Science},
	number = {4361},
	year = {2006},
	pages = {IX+553},
	publisher = {Springer-Verlag},
	abstract = {This book constitutes the thoroughly refereed extended postproceedings of the 7th International Workshop on Membrane Computing, WMC 2006, held in Leiden, Netherlands in July 2006.

The 27 revised full papers presented together with 7 invited papers went through two rounds of reviewing and improvement. The papers in this volume cover all the main directions of research in membrane computing, ranging from theoretical topics in mathematics and computer science, and to application issues. Special attention was paid to the interaction of membrane computing with biology, focusing both on the biological roots of membrane computing and on applications of membrane computing in biology and medicine.},
	keywords = {bioinformatics, Biological membrane systems, Biologically inspired computing, Brane calculi, complexity theory, Computational power, formal languages, information processing in cells, Membrane algorithms, Membrane computing, membrane systems, P systems},
	isbn = {978-3-540-69088-7},
	url = {http://www.springer.com/computer/theoretical+computer+science/foundations+of+computations/book/978-3-540-69088-7?cm_mmc=Google-_-Book\%20Search-_-Springer-_-0},
	author = {Hendrik J. Hoogeboom and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Membrane Computing: Brief introduction, recent results and applications.},
	journal = {BioSystems},
	volume = {85},
	year = {2006},
	pages = {11-22},
	address = {The Netherlands},
	abstract = {The internal organization and functioning of living cells, as well as their cooperation in tissues and higher order structures, can be a rich source of inspiration for computer science, not fully exploited at the present date. Membrane computing is an answer to this challenge, well developed at the theoretical (mathematical and computability theory) level, already having several applications (via usual computers), but without having yet a bio-lab implementation. After briefly discussing some general issues related to natural computing, this paper provides an informal introduction to membrane computing, focused on the main ideas, the main classes of results and of applications. Then, three recent achievements, of three different types, are briefly presented, with emphasis on the usefulness of membrane computing as a framework for devising models of interest for biological and medical research. 
},
	keywords = {EGFR signalling network, Membrane computing, Multiset processing, Natural computing, Universality},
	doi = {10.1016/j.biosystems.2006.02.001},
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6T2K-4JVSWWG-1\&_user=603129\&_coverDate=07\%2F31\%2F2006\&_rdoc=1\&_fmt=\&_orig=search\&_sort=d\&view=c\&_acct=C000031118\&_version=1\&_urlVersion=0\&_userid=603129\&md5=0debc4b4b403eae0151f31da581114e7},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Biosystems.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Membrane division, Restricted Membrane Creation and Object Complexity in  P Systems},
	journal = {International Journal of Computer Mathematics},
	volume = {83},
	year = {2006},
	pages = {529-547},
	address = {Londres},
	author = {Artiom Alhazov and Rudolf Freund and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Membrane Systems with External Control},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {215-232},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We consider the idea of controlling the evolution of a membrane system. In particular, we investigate a model of membrane systems using promoted rules, where a string of promoters (called the control string) {\textquotedblleft}travels{\textquotedblright} through the regions, activating the rules of the system. This control string is present in the skin region at the beginning of the computation {\textendash} one can interpret that it has been inserted in the system before starting the computation {\textendash} and it is {\textquotedblleft}consumed{\textquotedblright}, symbol by symbol, while traveling through the system. In this way, the inserted string drives the computation of the membrane system by controlling the activation of evolution rules. When the control string is entirely consumed and no rule can be applied anymore, then the system halts {\textendash} this corresponds to a successful computation. The number of objects present in the output region is the result of such a computation. In this way, using a set of control strings (a control program), one generates a set of numbers. We also consider a more restrictive definition of a successful computation, and then study the corresponding model. 
In this paper we investigate the influence of the structure of control programs on the generative power. We demonstrate that different structures yield generative powers ranging from finite to recursively enumerable number sets. 
In determining the way that the control string moves through the regions, we consider two possible {\textquotedblleft}strategies of traveling{\textquotedblright}, and prove that they are similar as far as the generative power is concerned. 
},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516_14},
	url = {http://www.springerlink.com/index/x08wp04818887m64.pdf},
	author = {Robert Brijder and Matteo Cavaliere and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Dragos Sburlan}
}
@article {,
	title = {A Modeling Approach Based on P Systems with Bounded Parallelism},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {49-65},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {This paper presents a general framework for modelling with membrane systems that is based on a computational paradigm where rules have associated a finite set of attributes and a corresponding function. Attributes and functions are meant to provide those extra features that allow to define different strategies to run a P system. Such a strategy relying on a bounded parallelism is presented using an operational approach and applying it for a case study presenting the basic model of quorum sensing for Vibrio fischeri bacteria. 
},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516_4},
	url = {http://www.springerlink.com/content/c2v235837xr60311/?p=a06790e49a95448c924437204fd27ee1\&pi=3},
	author = {Francesco Bernardini and Francisco J. Romero-Campero and Marian Gheorghe and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Modeling signal transduction using P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {100-122},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Cellular signalling pathways are fundamental to the control and regulation of cell behavior. Understanding of biosignalling network functions is crucial to the study of different diseases and to the design of effective therapies. In this paper we present P systems as a feasible computational modeling tool for cellular signalling pathways that takes into consideration the discrete character of the components of the system and the key role played by membranes in their functioning. We illustrate these cellular models simulating the epidermal growth factor receptor (EGFR) signalling cascade and the FAS{\textendash}induced apoptosis using a deterministic strategy for the evolution of P systems},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516},
	url = {http://www.springerlink.com/content/m6ph327080303314/?p=c81736444ac8428db132b636d28f2713\&pi=6},
	author = {Andrei Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {On P systems as a modelling tool for biological systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3850},
	year = {2006},
	pages = {114-133},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We introduce a variant of P systems where rules have associated a real number providing a measure for the {\textquotedblleft}intrinsic reactivity{\textquotedblright}of the rule and roughly corresponding to the kinetic coefficient which, in bio-chemistry, is usually associated to each molecular reaction. The behaviour of these P systems is then defined according to a strategy which, in each step, randomly selects the next rule to be applied depending upon a certain distribution of probabilities. As an application, we present a P system model of the quorum sensing regulatory networks of the bacterium Vibrio Fischeri. In this respect, a formalisation of the network in terms of P systems is provided and some simulation results concerning the behaviour of a colony of such bacteria are reported. We also briefly describe the implementation techniques adopted by pointing out the generality of our approach which appears to be fairly independent from the particular choice of P system variant and the language used to implement it. 
},
	isbn = {978-3-540-30948-2},
	issn = {0302-9743},
	doi = {10.1007/11603047_8},
	url = {http://www.springerlink.com/content/771gu80k20420613/?p=a52732696a5847ceb704e5670be3a9c3\&pi=7},
	author = {Francesco Bernardini and Marian Gheorghe and Natalio Krasnogor and Ravie Muniyandi and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {On the branching complexity of P systems},
	journal = {Fundamenta Informaticae},
	volume = {73},
	year = {2006},
	pages = {27-36},
	publisher = {IOS Press},
	address = {Amsterdam, Holanda},
	abstract = {We consider two complexity parameters related to the graph of reachable configurations of a given P system, namely the outdegree as a measure of the degree of non-determinism, and the indegree as a measure of the degree of confluence. These parameters can be defined for both the generative and the accepting mode of using a P system. We investigate here these parameters in what concerns hierarchies and decidability issues. We prove that all hierarchies have only two levels and that all considered decidability problems have a negative answer. 

},
	keywords = {decidability, descriptional complexity, Membrane computing, non-determinism},
	url = {http://portal.acm.org/citation.cfm?id=1231163},
	author = {Gabriel Ciobanu and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {On the power of dissolution in P systems with active membranes},
	journal = {Lecture Notes in Computer Science},
	volume = {3850},
	year = {2006},
	pages = {224-240},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we study membrane dissolution rules in the framework of P systems with active membranes but without using electrical charges. More precisely, we prove that the polynomial computational complexity class associated with the class of recognizer P systems with active membranes, without polarizations and without dissolution coincides with the standard complexity class P. Furthermore, we demonstrate that if we consider dissolution rules, then the resulting complexity class contains the class NP. 
},
	isbn = {978-3-540-30948-2},
	issn = {0302-9743},
	doi = {10.1007/11603047},
	url = {http://www.springerlink.com/content/y0j6444h11087763/?p=b39de80f23a244a2b3abbcfb36e1340a\&pi=15},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {242,
	title = {On Trace Languages Generated by Spiking Neural P Systems},
	journal = {Fourth Brainstorming Week on Membrane Computing },
	volume = {I},
	year = {2006},
	pages = {207-224},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-611-0520-6},
	author = {Haiming Chen and Mihai Ionescu and Andrei Paun and Gheorghe Paun and Bianca Popa},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {,
	title = {One More Universality Result for P Systems with Objects on Membranes},
	journal = {International Journal of Computers, Communications and Control},
	volume = {1},
	year = {2006},
	pages = {25-32},
	address = {Oradea, Ruman{\'\i}a},
	abstract = {We continue here the attempt to bridge brane calculi with membrane computing, following the investigation started in [2]. Specifically, we consider P systems with objects placed on membranes, and processed by membrane operations. The operations used in this paper are membrane creation (cre), and membrane dissolution (dis), defined in a way which reminds the operations pino, exo from a brane calculus from [1]. For P systems based on these operations we prove the universality, for one of the two possible variants of the operations; for the other variant the problem remains open.},
	keywords = {Brane calculi, matrix grammar, Membrane computing},
	issn = {1841 - 9836 },
	url = {http://www.journal.univagora.ro/?page=article_details\&id=21},
	attachments = {http://www.gcn.us.es/biblio/themes/files/One more universality.pdf},
	author = {Gheorghe Paun}
}
@article {92,
	title = {P systems with input in binary form},
	journal = {International Journal of Foundations of Computer Science},
	volume = {17},
	year = {2006},
	pages = {127 - 146},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {Current P systems which solve NP{\textendash}complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances generally corresponds to simplify the problem. In this paper we show that, when working with P systems, we can assume without loss of generality that instances are expressed in binary notation. More precisely, we propose a simple method to encode binary numbers using multisets, and a family of P systems which transforms such multisets into the usual unary notation. Such a family could thus be composed with the unary P systems currently proposed in the literature to obtain (uniform) families of P systems which solve NP{\textendash}complete numerical problems with instances encoded in binary notation.

We introduce also a framework which can be used to design uniform families of P systems which solve NP{\textendash}complete problems (both numerical and non-numerical) working directly on binary encoded instances, i.e., without first transforming them to unary notation. We illustrate our framework by designing a family of P systems which solves the 3-SAT problem. Next, we discuss the modifications needed to obtain a family of P systems which solves the PARTITION numerical problem.
},
	keywords = {3-SAT, 68Q10 (AMSC), 68Q17 (AMSC), Membrane computing, P systems; PARTITION},
	issn = {0129-0541},
	doi = {10.1142/S0129054106003735},
	author = {Alberto Leporati and Claudio Zandron and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {,
	title = {P systems, a new computational modelling tool for Systems Biology},
	journal = {Lecture Notes in Computer Science},
	volume = {4220},
	year = {2006},
	pages = {176-197},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present P systems as a reliable computational modelling tool for Systems Biology that takes into account the discrete character of the quantity of components of biological systems, the inherently randomness in biological phenomena and the key role played by membranes in the functioning of living cells. We will introduce two different strategies for the evolution of P systems, namely, Multi-compartmental Gillespie{\textquoteright}s Algorithm based on the well known Gillespie{\textquoteright}s Algorithm but running on more than one compartment; and Deterministic Waiting Times Algorithm, an exact deterministic method. In order to illustrate these two strategies we have modelled two biological systems: the EGFR Signalling Cascade and the Quorum Sensing System in the bacterium Vibrio Fischeri. Our simulations results show that for the former system a deterministic approach is valid whereas for the latter a stochastic approach like Multi-compartmental Gillespie{\textquoteright}s Algorithm is necessary. 
},
	isbn = {978-3-540-45779-4},
	issn = {0302-9743},
	doi = {10.1007/11880646},
	url = {http://www.springerlink.com/content/rr06k8520467m377/},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {P Transducers},
	journal = {New Generation Computing},
	volume = {24},
	year = {2006},
	pages = {1-28},
	address = {Tokyo, Jap{\'o}n},
	abstract = {We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The "Sevilla carpet" of a computation is defined for P transducers, giving a representation of the control part for these P transducers. 


},
	keywords = {chomsky hierarchy, Membrane computing, transducer, turing machine},
	issn = {0288-3635 },
	url = {http://portal.acm.org/citation.cfm?id=1163790},
	author = {Gabriel Ciobanu and Gheorghe Paun and Gheorghe Stefanescu}
}
@article {530,
	title = {A Polynomial Complexity Class in P Systems Using Membrane Division},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {11},
	year = {2006},
	pages = {423-434},
	publisher = {Fakult{\"a}t f{\"u}r Informatik, Otto.von-Guericke-Universit{\"a}t},
	address = {Magdeburg (Germany)},
	issn = {1430-189X},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@proceedings {565,
	title = {Pre-proceedings of the Internacional Conference Bio-Inspired Computing {\textendash} Theory and Applications},
	year = {2006},
	author = {Linqiang Pan and Gheorghe Paun}
}
@article {531,
	title = {Selected papers devoted to Membrane Computing. Editorial.},
	journal = {Journal of Automata, Languages and Combinatorics},
	volume = {11},
	year = {2006},
	pages = {239},
	edition = {3},
	issn = {1430-189X },
	url = {http://www.jalc.de/search/j11_i.html},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Small Universal Spiking Neural P Systems},
	journal = {Biosystems},
	volume = {90},
	year = {2006},
	pages = {49-60},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {In search for small universal computing devices of various types, we consider here the case of spiking neural P systems (SN P systems), in two variants: as devices that compute functions and as devices that generate sets of numbers. We start with the first case and we produce a universal spiking neural P system with 84 neurons. If a slight generalization of the used rules is adopted, namely, we allow rules for producing simultaneously several spikes, then a considerable reduction, to 49 neurons, is obtained. For SN P systems used as generators of sets of numbers, we find a universal system with restricted rules having 76 neurons and one with extended rules having 50 neurons.

},
	issn = {0303-2647 },
	url = {http://www.gcn.us.es/4BWMC/vol2/smalluniv.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/small universal.pdf},
	author = {Gheorghe Paun and Andrei Paun}
}
@article {,
	title = {Some Notes on (Mem)Brane Computation},
	journal = {Lecture Notes in Computer Science},
	volume = {4193},
	year = {2006},
	pages = {262-271},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane Computing and Brane Calculi are two recent computational paradigms in the framework of Natural Computing. They are based on the study of the structure and functioning of living cells as living organisms able to process and generate information. In this paper we give a short introduction to both areas and point out some open research lines. 
},
	isbn = {10.1007/11844297},
	issn = {0302-9743},
	doi = {10.1007/11844297_27},
	url = {http://www.springerlink.com/index/u082j74h51012654.pdf},
	author = {Nadia Busi and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {58,
	title = {Spike trains in spiking neural P systems.},
	journal = {International Journal of Foundations of Computer Science},
	volume = {17},
	year = {2006},
	pages = {975-1002},
	address = {Singapur},
	abstract = {We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, identical in shape (voltage), but emitted at precise moments of time. The sequence of moments when a neuron emits a spike is called the spike train (of this neuron); by designating one neuron as the output neuron of a spiking neural P system II, one obtains a spike train of II. Given a specific way of assigning sets of numbers to spike trains of II, we obtain sets of numbers computed by II. In this way, spiking neural P systems become number computing devices. We consider a number of ways to assign (code) sets of numbers to (by) spike trains, and prove then computational completeness: the computed sets of numbers are exactly Turing computable sets. When the number of spikes present in the system is bounded, a characterization of semilinear sets of numbers is obtained. A number of research problems is also formulated.
},
	keywords = {68Q10 (AMSC), 68Q42 (AMSC), 68Q45 (AMSC), Membrane computing, P system, register machine, semilinear set, spiking neuron},
	doi = {10.1142/S0129054106004212},
	url = {http://www.worldscinet.com/ijfcs/17/1704/S0129054106004212.html},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {,
	title = {Spiking Neural P Systems},
	journal = {Fundamenta Informaticae},
	volume = {71},
	year = {2006},
	pages = {279-308},
	address = {Amsterdam, Holanda},
	url = {http://psystems.disco.unimib.it/download/spikingf.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Spiking neural p systems.pdf},
	author = {Mihai Ionescu and Gheorghe Paun and Takashi Yokomori}
}
@article {,
	title = {Towards a P Systems Pseudomonas Quorum Sensing Model },
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {197-214},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Pseudomonas aeruginosa is an opportunistic bacterium that exploits quorum sensing communication to synchronize individuals in a colony and this leads to an increase in the effectiveness of its virulence. In this paper we derived a mechanistic P systems model to describe the behavior of a single bacterium and we discuss a possible approach, based on an evolutionary algorithm, to tune its parameters that will allow a quantitative simulation of the system.},
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516},
	url = {http://www.springerlink.com/index/e2067418146143k2.pdf},
	author = {Luca Bianco and Dario Pescini and Peter Siepmann and Natalio Krasnogor and Francisco J. Romero-Campero and Marian Gheorghe}
}
@article {138,
	title = {Towards probabilistic model checking on P systems using PRISM},
	journal = {Lecture Notes in Computer Science},
	volume = {4361},
	year = {2006},
	pages = {477-495},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {This paper presents the use of P systems and π-calculus to model interacting molecular entities and how they are translated into a probabilistic and symbolic model checker called PRISM. },
	isbn = {978-3-540-69088-7},
	issn = {0302-9743},
	doi = {10.1007/11963516_30},
	url = {http://www.springerlink.com/content/326656pw543574g6/?p=c664762c3b9f4d6798380d9fb3509b9d\&pi=29},
	author = {Francisco J. Romero-Campero and Marian Gheorghe and Luca Bianco and Dario Pescini and Mario J. P{\'e}rez-Jim{\'e}nez and Rodica Ceterchi}
}
@article {,
	title = {Unconventional Computation. 5th International Conference, UC 2006 York, September 2006.},
	volume = {4135},
	year = {2006},
	note = {Gheorghe Paun; Cristian Calude; Michael J. Dinneen; Grzegorz Rozenberg; Susan Stepney (eds.)},
	pages = {267},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-38593-2},
	author = {Gheorghe Paun and Cristian Calude and Michael J. Dinneen and Grzegorz Rozenberg and Susan Stepney}
}
@article {,
	title = {An universality result for a (mem)brane calculus based on mate/drip operations},
	journal = {International Journal of Foundations of Computer Science},
	volume = {17},
	year = {2006},
	pages = {49-68},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	url = {http://www.gcn.us.es/ESF/fenixpdf/fenix-75.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/an universality result for a (mem)brane....pdf},
	author = {Luca Cardelli and Gheorghe Paun}
}
@article {,
	title = {Modelling EGFR signalling network using continuous membrane systems},
	journal = {Third International Workshop on Computational Methods in Systems Biology, CMSB 2005 },
	year = {2005},
	month = {April 3-5},
	pages = {118-129},
	address = {Edinburgh, The U.K.},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Modelling EGFR.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero},
	editor = {G. Plotkin}
}
@article {259,
	title = {Multidimensional descriptional complexity of P systems},
	journal = {7th International Workshop on Descriptional Complexity of Formal Systems},
	year = {2005},
	month = {6/30/05-7/2/05},
	pages = {134-145},
	address = {Como, Italia},
	attachments = {http://www.gcn.us.es/biblio/themes/files/como.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {C. Mereghetti and B. Palano and G. Pighizzini and D. Wotschke}
}
@proceedings {314,
	title = {Pre-proceedings of the Sixth International Workshop on Membrane Computing, WMC6 },
	journal = {Workshop on Membrane Computing, WMC6},
	year = {2005},
	month = {18/07/2005},
	pages = {VII+539},
	publisher = {Springer Distribution Center GmbH},
	address = {Viena, Austria},
	isbn = {978-3-540-30948-2},
	url = {http://www.emcc.at/WMC6/WMC6PreProcFull.pdf},
	author = {Rudolf Freund and Georg Lojka and Marion Oswald and Gheorghe Paun}
}
@article {264,
	title = {Further Twenty Six Open Problems in Membrane Computing},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05/-2/4/05},
	pages = {249-262},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Further twenty six open problems in Membrane Computing.pdf},
	author = {Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {257,
	title = {One More Universality Result for P Systems with Objects on Membranes},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05/-2/4/05},
	pages = {263-273},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {266,
	title = {Editing configurations of P systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {131-154},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	attachments = {http://www.gcn.us.es/biblio/themes/files/editing configurations of P systems.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Antonio di-Nola and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {265,
	title = {Event-related outputs of computations in P systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {107-122},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Matteo Cavaliere and Rudolf Freund and Alexander Leistch and Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {256,
	title = {Simulating Avascular Tumors with Membrane Systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {185-195},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {269,
	title = {A simulator for confluent P systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {169-184},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	attachments = {http://www.gcn.us.es/biblio/themes/files/A simulator for confluent P systems.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {,
	title = {A tool for using the SBML format to represent P systems which model biological reaction networks},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {219-228},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Isabel Nepomuceno and Juan A. Nepomuceno-Chamorro and Francisco J. Romero-Campero},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {263,
	title = {Matrix Languages, Register Machines, Vector Addition Systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31//05-2/4/05},
	pages = {155-167},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Rudolf Freund and Oscar Ibarra and Gheorghe Paun and H. C. Yen},
	editor = {M. A. Guti{\'e}rrez Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {76,
	title = {A fast P system for finding a balanced 2-partition},
	journal = {Soft Computing},
	volume = {9},
	year = {2005},
	month = {09/2005},
	pages = {673-678},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	abstract = {Numerical problems are not very frequently addressed in the P systems literature. In this paper we present an effective solution to the 2-Partition problem via a family of deterministic P systems with active membranes using 2-division. The design of this solution is a sequel of several previous works on other problems, mainly on the Subset-Sum and the Knapsack problems. Several improvements are introduced and explained.
},
	keywords = {Complexity class - Membrane computing - Active membranes - NP-Complete problem},
	issn = {1432-7643 },
	doi = {10.1007/s00500-004-0397-0},
	url = {http://www.springerlink.com/content/787ktn157xv6ub32/?p=78b9bdeb5b6b4971a06d7ca7467298fa\&pi=6},
	attachments = {http://www.gcn.us.es/biblio/themes/files/A fast P system.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {75,
	title = {Foreword. Second Brainstorming Week on Membrane Computing in Seville 2004},
	journal = {Soft Computing},
	volume = {9},
	year = {2005},
	month = {09/2005},
	pages = {629-630},
	publisher = {Springer Verlag},
	address = {Berlin, Germany},
	issn = {1432-7643},
	doi = {10.1007/s00500-004-391-6},
	url = {http://www.springerlink.com/content/mjxhb0ecqypk8729/?p=78b9bdeb5b6b4971a06d7ca7467298fa\&pi=0},
	attachments = {http://www.gcn.us.es/biblio/themes/files/fulltext.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Accepting hybrid networks of evolutionary processors},
	journal = {Lecture Notes in Computer Science},
	volume = {3384},
	year = {2005},
	pages = {235-246},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We consider time complexity classes defined on accepting hybrid networks of evolutionary processors (AHNEP) similarly to the classical time complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the set of languages accepted by AHNEPs in polynomial time.
},
	isbn = {978-3-540-26174-2},
	issn = {0302-9743},
	doi = {10.1007/b136914},
	url = {http://www.springerlink.com/content/tg05uxqqa4umahyj/?p=a17a498a4f064cb7b8e69859eb9721b1\&pi=20},
	author = {Maurice Margenstern and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {An Approach to Computational Complexity in Membrane Computing},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {85-109},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present a theory of computational complexity in the framework of membrane computing. Polynomial complexity classes in recognizer membrane systems and capturing the classical deterministic and non-deterministic modes of computation, are introduced. In this context, a characterization of the relation  is described},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/2q16m1gmj3d1cc5v/?p=1b55597611584eac9c7c03342b480893\&pi=4},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {164,
	title = {Approximating Non-discrete P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {287-295},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The main goal of this paper is to propose some geometric approaches to the computations of non-discrete P systems. The behavior of this kind of P systems is similar to that of classic systems, with the difference that the contents of the membranes are represented by non-discrete multisets (the multiplicities can be non-integers) and, consequently, also the number of applications of a rule in a transition step can be non-integer.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/index/73M2EXYEGKDFRLWF.pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Fernando Sancho-Caparrini}
}
@article {163,
	title = {Attacking the Common Algorithmic Problem by recognizer P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3354},
	year = {2005},
	pages = {304-315},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). In a precise sense, which will be defined in the paper, one may say that CAP has a property of local universality. In this paper we present an effective solution to the decision version of the CAP using a family of recognizer P systems with active membranes. The analysis of the solution presented here will be done from the point of view of complexity classes in P systems.
},
	isbn = {978-3-540-25261-0},
	issn = {0302-9743},
	doi = {10.1007/b106980},
	url = {http://www.springerlink.com/content/ej5qbb069jtdun0m/?p=7d7b28198e4e471f8cc386df2df8c035\&pi=24},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {535,
	title = {Automated reasoning systems and molecular computing},
	journal = {Recent Results in Natural Computing},
	year = {2005},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {This work was intended as an attempt to show the possible advantages provided by bringing together two areas, automated reasoning systems and DNA computing. The former as theoretical and formal devices to study the correctness of a program. The latter as practical devices to handle DNA strands to solve classical hard problems using laboratory techniques. To illustrate this approximation we present how we have obtained in the PVS proof checker the correctness of a program in a sticker based model for DNA computation. This result required a previous work: the formalization of the elected model within the PVS language. Also, in order to deal with imperative programs, we have studied a formalization of the Floyd-Hoare logic in the same system, PVS.},
	url = {http://www.cs.us.es/~marper/investigacion/carmen-rsme.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/carmen-rsme.pdf},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Cellular Computing. Complexity Aspects},
	year = {2005},
	note = {Miguel A. Guti{\'e}rrez-Naranjo; Gheorghe Paun; Mario J. P{\'e}rez-Jim{\'e}nez (eds.)},
	pages = {VIII+ 297},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla,Espa{\~n}a},
	isbn = {84-609-5338-6},
	url = {http://www.cs.us.es/~marper/investigacion/complejidad.html},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {cellular programming: efficient resolution of NP-complte numerical problems (abstract de tesis)},
	journal = {Bulletin of the European Association for Theoretical Computer Science},
	volume = {85},
	year = {2005},
	pages = {221-222},
	address = {Los Pa{\'\i}ses Bajos},
	issn = {0252-9742},
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {542,
	title = {Cellular solutions to some numerical NP-complete problems: A Prolog implementation},
	journal = {Molecular Computational Models: Unconventional Approaches},
	year = {2005},
	pages = {115-149},
	publisher = {Idea Group Publishing},
	chapter = {V},
	abstract = {This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (P{\u a}un, 1998). We present efficient solutions to the Subset-Sum and the Knapsack problems. These solutions are obtained via families of P systems with the capability of generating an exponential amount of working space in polynomial time.
Besides, a simulation tool for P systems, written in Prolog, is described. As an illustrative example, a session in the Prolog simulator implementing one of the presented cellular solutions is included.},
	isbn = {978-1591403340},
	doi = {10.4018/978-1-59140-333-3},
	url = {http://www.cs.us.es/~marper/investigacion/Cellularsolutions.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Cellularsolutions.pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Marian Gheorghe}
}
@article {,
	title = {Characterizing Tractability with Membrane Creation},
	journal = {TAPS{\textquoteright}05 Workshop on Theory and Application of Systems},
	year = {2005},
	pages = {61-68},
	address = {Timisoara, Ruman{\'\i}a},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero},
	editor = {Gabriel Ciobanu and Gheorghe Paun}
}
@article {,
	title = {Computational Completeness of P Systems with Active Membranes and Two Polarizations},
	journal = {Lecture Notes in Computer Science},
	volume = {3354},
	year = {2005},
	pages = {82-92},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {P systems with active membranes using only two electrical charges and only rules of type  i.e., evolution rules used in parallel in the regions of the membrane system, and of type  i.e., communication rules sending out an object of a membrane thereby possibly changing the polarization of this membrane, assigned to at most two membranes are shown to be computationally complete, which improves the previous result of this type with respect to the number of polarizations as well as to the number of membranes. Allowing a special variant  of rules of type  to delete symbols by sending them out, even only one membrane is enough.
},
	isbn = {978-3-540-25261-0},
	issn = {0302-9743},
	doi = {10.1007/b106980},
	url = {http://www.springerlink.com/index/7mllx684jbabqtk2.pdf},
	author = {Artiom Alhazov and Rudolf Freund and Gheorghe Paun}
}
@article {541,
	title = {Computational complexity aspects of membrane computing: Ideas, results, open problems},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {277-292},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {In this paper, a brief survey of a theory of computational complexity within the model of cell-like membrane systems is presented. Relevant results concerning complexity classes in membrane computing are described, and fifteen open problems in this framework are proposed.},
	isbn = {84-609-5338-6 },
	url = {http://www.cs.us.es/~marper/investigacion/esf-1.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/esf-1.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Context-free insertion-deletion systems},
	journal = {Theoretical Computer Science},
	volume = {330},
	year = {2005},
	pages = {339 - 348},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We consider a class of insertion-deletion systems which have not been investigated so far, those without any context controlling the insertion-deletion operations. Rather unexpectedly, we found that context-free insertion-deletion systems characterize the recursively enumerable languages. Moreover, this assertion is valid for systems with only one axiom, and also using inserted and deleted strings of a small length. As direct consequences of the main result we found that set-conditional insertion-deletion systems with two axioms generate any recursively enumerable language (this solves an open problem), as well as that membrane systems with one membrane having context-free insertion-deleletion rules without conditional use of them generate all recursively enumerable languages (this improves an earlier result). Some open problems are also formulated. 


},
	keywords = {formal grammars, insertion-deletion systems, Membrane computing},
	issn = {0304-3975 },
	doi = {10.1016/j.tcs.2004.06.031 },
	url = {http://portal.acm.org/citation.cfm?id=1065074},
	author = {Maurice Margenstern and Gheorghe Paun and Yurii Rogozhin and Sergey Verlan}
}
@article {,
	title = {Dnk Kompjuter. Novaja Paradigms Vytsislenii},
	year = {2005},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (coautores)},
	pages = {527},
	publisher = {Izdatelstvo Mir},
	address = {Rusia},
	isbn = {5-03-003480-3 },
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Exploring computation trees associated with P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {278-286},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present{\textendash}day computers; moreover, different branches in this tree may differ significantly from a computational complexity point of view, that is, for the amount of time and storage necessary to reach a result. In this paper we propose a first approach to outline a strategy for selecting a suitable branch, in some sense, of the computation tree associated with a P system. To this end, we introduce the key notion of the dependency graph of a P system.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/tv941vghkntuv8rb/?p=aec382c195614ca0a11739e4c1e790d8\&pi=15},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {537,
	title = {Formal verification of programs in molecular models with random access memory},
	journal = {Recent results in Natural Computing},
	year = {2005},
	pages = {205-229},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	url = {http://www.cs.us.es/~marper/investigacion/recent-2.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/recent-2.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {538,
	title = {Generating pairwise disjoint families through DNA computations},
	journal = {Recent Results in Natural Computing},
	year = {2005},
	pages = {231-246},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	url = {http://www.cs.us.es/~marper/investigacion/recent-1.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/recent-1.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {A linear solution of Subset Sum problem by using membrane creation},
	journal = {Lecture Notes in Computer Science},
	volume = {3561},
	year = {2005},
	pages = {258-267},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. In this framework, the solution of NP problems is obtained by generating an exponential amount on workspace in polynomial time and using parallelism to check simultaneously all the candidates to solution. We present a solution to the Subset Sum problem for P systems where new membranes are generated from objects.},
	keywords = {Cellular complexity classes, Membrane computing, Natural computing, Subset Sum Problem.},
	isbn = {978-3-540-26298-5},
	issn = {0302-9743},
	doi = {10.1007/b137289},
	url = {http://www.springerlink.com/content/hhk559wmhg0qw87l/?p=16f5fea3cb444987a8c6641261510c68\&pi=26},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems },
	journal = {Lecture Notes in Computer Science},
	volume = {3699},
	year = {2005},
	pages = {94-104},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Earlier solutions to decision problems by means of P systems used many counter objects to control the synchronization of different stages in a computation (usually as many counters as the stage must last in the worst case). In this paper we propose a way to replace those counters with some spacial objects for each stage. Furthermore, following the ideas presented in [1], in order to have a common scheme to attack numerical problems, all instances of a problem with the same size are solved by the same P system (which depends on the size) given an input which describes the corresponding instance of the problem. We illustrate these ideas with a cellular solution to the Subset-Sum problem. 
},
	isbn = {978-3-540-29100-8},
	issn = {0302-9743},
	doi = {10.1007/11560319},
	url = {http://www.springerlink.com/index/2b5lh8xcefwqkp4w.pdf},
	author = {Carmen Graciani-D{\'\i}az and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Membrane Computing (5th International Workshop, WMC 2004, Revised, Selected and Invited Papers).},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	note = {Giancarlo Mauri; Gheorghe Paun; Mario J. P{\'e}rez-Jim{\'e}nez; Grzegorz Rozenberg; Arto Salomaa (eds.) },
	pages = {IX+415},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	keywords = {bioinformatics, Biologically inspired computing, cell communication, complexity theory, formal languages, information processing in cells, Membrane computing, membrane systems, molecular computing, Natural computing, P systems},
	isbn = {3-540-25080-8},
	url = {http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-156-22-44223445-0,00.html},
	author = {Giancarlo Mauri and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg and Arto Salomaa}
}
@article {536,
	title = {Membrane computing as production systems},
	journal = {Recent Results in Natural Computing},
	year = {2005},
	pages = {167-204},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	url = {http://www.cs.us.es/~marper/investigacion/recent-3.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/recent-3.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero},
	editor = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Membrane Computing. Basic Ideas, Results, Applications },
	journal = {TAPS{\textquoteright}05 Workshop on Theory and Application of Systems},
	year = {2005},
	address = {Timisoara, Ruman{\'\i}a},
	author = {Gheorghe Paun}
}
@article {604,
	title = {Membrane Computing. Main ideas, basic results, applications},
	journal = {Molecular Computation Models: Unconventional Approaches},
	year = {2005},
	pages = {1-31},
	publisher = {Idea Group Inc.},
	author = {Gheorghe Paun}
}
@article {603,
	title = {Membrane Computing. Some recent results and current research topics},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {135-166},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	isbn = {84-609-5338-6 },
	url = {http://www.cs.us.es/~marper/investigacion/complejidad.html},
	author = {Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Membrane Computing: Power, Efficiency, Applications},
	journal = {Lecture Notes in Computer Science},
	volume = {3526},
	year = {2005},
	pages = {396-407},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Membrane computing is an young but already well developed branch of natural computing, having as its goal to abstract computing models from the structure and the functioning of the living cell.
The present paper is an informal introduction to membrane computing, presenting the basic ideas, some central (mathematical) results, and the main areas of application.
},
	isbn = {978-3-540-26179-},
	issn = {0302-9743},
	doi = {10.1007/b136981},
	url = {http://www.springerlink.com/index/vg7fb675d8xtn6xf.pdf},
	author = {Gheorghe Paun}
}
@article {,
	title = {Modelling vibrio fischeri{\textquoteright}s behaviour using P systems},
	journal = {ECAI 2004 (16th European Conference on Artificial Intelligence)},
	year = {2005},
	address = {Valencia, ESpa{\~n}a},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {540,
	title = {Multidimensional Sevilla Carpets associated with P systems},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {225-235},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {In this paper we address the problem of describing the complexity of the evolution of a P system. This is especially difficult in the case of P systems where the number of membranes increases along the computation, via division or creation of membranes. In these cases the number of steps of a computation is not sufficient to evaluate the complexity. Sevilla Carpets were introduced in [1], and they describe the space-time complexity of P systems. Based on them, we define a four-dimensional manifold which can be used to compare evolutions of P systems.},
	isbn = {84-609-5338-6 },
	url = {http://www.cs.us.es/~marper/investigacion/esf-2.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/esf-2.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {158,
	title = {On descriptive complexity in P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {320-330},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we address the problem of describing the complexity of the evolution of a P system. This issue is is specially hard in the case of P systems with active membranes, where the number of steps of a computation is not sufficient to evaluate the complexity. Sevilla carpets were introduced in [1], and they describe the space-time complexity of P systems. Based on them, we define some new parameters which can be used to compare evolutions of P systems. To illustrate this, we also include two different cellular solutions to the Subset Sum problem and compare them via these new parameters.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/gvux7wbg16y3m6jg/?p=aec382c195614ca0a11739e4c1e790d8\&pi=19},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {315,
	title = {On P Systems with Bounded Parallelism},
	journal = {TAPS{\textquoteright}05 Workshop on Theory and Application of Systems},
	year = {2005},
	address = {Timisoara, Ruman{\'\i}a},
	author = {Francesco Bernardini and Francisco J. Romero-Campero and Marian Gheorghe and Mario J. P{\'e}rez-Jim{\'e}nez and Maurice Margenstern and Sergey Verlan and Natalio Krasnogor}
}
@article {,
	title = {On two-dimensional mesh networks and their simulation with P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {259-277},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We analize in this paper the possibility of simulating the parallel architecture SIMD-MC2, also known as the two-dimensional mesh, with P systems with dynamic communication graphs. We illustrate this simulation for an algorithm which computes the sum of given integers. Next, we show how to extend the formalism to the reduction problem.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/5adkt5w65haetvuq/?p=aec382c195614ca0a11739e4c1e790d8\&pi=14},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems},
	journal = {TAPS{\textquoteright}05 Workshop on Theory and Application of Systems},
	year = {2005},
	pages = {9-18 },
	address = {Timisoara, Ruman{\'\i}a},
	author = {Artiom Alhazov and Rudolf Freund and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {P systems with active membranes, without polarizations and without dissolution: A characterization of P},
	journal = {Lecture Notes in Computer Science},
	volume = {3699},
	year = {2005},
	pages = {105-116},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We study the computational efficiency of recognizer P systems with active membranes without polarizations and without dissolution. The main result of the paper is the following: the polynomial computational complexity class associated with the class of recognizer P systems is equal to the standard complexity class P.},
	isbn = {978-3-540-29100-8},
	issn = {0302-9743},
	doi = {10.1007/11560319},
	url = {http://www.springerlink.com/content/d8133yrhbnhwgf40/?p=04e911661585426488476f9d64170e0f\&pi=10},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero}
}
@article {539,
	title = {P systems with membrane creation and rule input},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {209-224},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {When a uniform family of recognizer P systems is designed to solve a problem, the data of a concrete instance of the problem is usually provided via a multiset which is placed in the so-called input membrane. In this paper we present a new definition for recognizer P systems with rule input, where the data of the instance is provided via a new set of rules. We also discuss a new semantic for P systems with membrane creation and as example, a uniform family for recognizer P systems with rule input which solves the Subset Sum problem is provided.},
	isbn = {84-609-5338-6 },
	url = {http://www.cs.us.es/~marper/investigacion/esf-5.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/esf-5.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {P Systems with Mobile Membranes},
	journal = {Natural Computing},
	volume = {4},
	year = {2005},
	pages = {255-274},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {P systems with active membranes are among the central ones in membrane computing, and they were shown to be both computationally universal (able to simulate Turing machines) and computationally efficient (able to solve hard problems in polynomial time). However, in all cases, these results were obtained by making use of several powerful features, such as membrane polarization, label changing, division of non-elementary membranes, priorities, or cooperative rules. This paper contributes to the research effort of introducing a class of P systems with active membranes having none of the features mentioned above, but still preserving the power and the efficiency. The additional feature we consider instead are the operations of endocytosis and exocytosis: moving a membrane inside a neighboring membrane, or outside the membrane where it is placed. We investigate the power and the efficiency of these systems (also using membrane division) by first proving that they can simulate (with a linear slowdown and without introducing non-determinism) rewriting P systems with 2-replication, for which the universality and the possibility of solving NP-complete problems in polynomial time are known. In this way, the universality and efficiency are also obtained for our systems. We also give a direct and simple proof for the universality result --- without using division rules (the proof uses nine membranes, but we do not know whether this number can be decreased).



},
	keywords = {matrix grammar, Membrane computing, Turing computability},
	issn = {1567-7818},
	url = {http://portal.acm.org/citation.cfm?id=1089128.1089159},
	author = {Shankara N. Krishna and Gheorghe Paun}
}
@article {202,
	title = {Recent Results in Natural Computing},
	year = {2005},
	note = {Mario J. P{\'e}rez-Jim{\'e}nez; {\'A}lvaro Romero-Jim{\'e}nez; Fernando Sancho-Caparrini (eds.)},
	pages = {311},
	publisher = {F{\'e}nix Editora},
	address = {Seville (Spain)},
	abstract = {In the second part of the 20th century, a great deal of effort was devoted to understanding how computations take place in nature, and to benefit from this understanding by getting more efficient algorithms or even new types of computers. 
Within the First Joint Meeting between the RSME and the AMS, held in Sevilla, from June 18 to June 21, 2004, a Special Session entitled Biomolecular Mathematics was organized by Fernando Guzm{\'a}n and Tom Head, from Binghamton University (USA), Carlos Mart{\'\i}n-Vide, from University Rovira i Virgili of Tarragona (Spain), and Mario J. P{\'e}rez Jim{\'e}nez, from University of Sevilla (Spain). 
To that Session were invited, as speakers, Alessandra Carbone (Institut des Hautes Etudes Scientifiques), Rudolf Freund (Technische Universitaet Wien), Tero Harju (University of Turku), Mike Holcombe (University of Sheffield), Gheorghe Paun (Institute of Mathematics of the Romanian Academy), and Rani Siromoney (Madra Christian College). Following the conference presentations by the invited researchers, four talks were given, with the session being closed by a discussion of Recent results in Natural Computing. The title of this volume is intended to reflect the spirit of the last act that took place in the Special Session of Biomolecular Mathematics. The main goal of the volume is to present recent results in such research areas as evolutionary computing, molecular computing, and membrane computing, all of which belong to the emerging area of of Natural Computing, which is concerned with both the computing taking place in Nature and the new methods of computing inspired by Nature. 
All participants in the above mentioned Session of the Joint Meeting were invited to collaborate in this volume, as well as other prominent researchers belonging to the field of Natural Computing that could not attend the Special Session. 
We have collected 13 papers by 20 authors in the present volume. We hope that the papers collected here contribute to deepen the study of several topics in Natural Computing, and to strengthen some of the emerging lines in this field. 
We would like to thank all the authors for their good attitude towards participating in the elaboration of this book, as well as for the quality of the papers presented. They are the responsible and true editors of this publication. We also thank all who have had to decline our invitation because of their busy research agendas. 

},
	isbn = {84-609-5864-2},
	url = {http://books.google.com/books/about/Recent_results_in_natural_computing.html?id=eKcaPQAACAAJ},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {255,
	title = {Solving SAT with membrane creation},
	journal = {Computability in Europe 2005 (CiE 2005): New Computational Paradigms },
	year = {2005},
	pages = {82-91. },
	address = {Amsterdam, Holanda},
	attachments = {http://www.gcn.us.es/biblio/themes/files/creation.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero},
	editor = {S. Barry-Cooper and B. Lowe and L. Torenvliet}
}
@article {,
	title = {Solving the Subset-Sum problem by P systems with active membranes},
	journal = {New Generation Computing},
	volume = {23},
	year = {2005},
	pages = {367-384},
	address = {Tokyo, Jap{\'o}n},
	abstract = {We present the first membrane computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it suffices to control the electrical charges of the membranes and to introduce some counters. The number of steps of any computation is of the linear order (but it is necessary a polynomial-time of precomputed resources).

},
	keywords = {Active Membranes, Complexity Classes, Membrane computing, Subset-Sum Problem},
	issn = {0288-3635},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {A study of the robustness of the EGFR signalling cascade using continuous membrane systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3561},
	year = {2005},
	pages = {268-278},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Many approaches to anticancer treatment have had a limited success. A fundamental hurdle to cancer therapy is the robustness of the signalling networks involved in tumourgenesis. The complexity of networks of biological signalling pathways is such that the development of simplifying models is essential in trying to understand the wide-ranging cellular responses they can generate. In this paper a model of the epidermal growth factor receptor signalling cascade is developed using continuous membrane systems. This model is used to study the robustness of this signalling cascade which is known to play a key role in tumour cell proliferation, angiogenesis and metastasis},
	keywords = {EGFR signalling network, Membrane computing, robustness., signal transduction},
	isbn = {978-3-540-26298-5},
	issn = {0302-9743},
	doi = {10.1007/b137289},
	url = {http://www.springerlink.com/content/v4huv310xm92vm10/?p=16f5fea3cb444987a8c6641261510c68\&pi=27},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {Symport/Antiport P systems with three objects are universal},
	journal = {Fundamenta Informaticae},
	volume = {64},
	year = {2005},
	pages = {353-367},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {The operations of symport and antiport, directly inspired from biology, are already known to be rather powerful when used in the framework of P systems. In this paper we confirm this observation with a quite surprising result: P systems with symport/antiport rules using only three objects can simulate any counter machine, while systems with only two objects can simulate any blind counter machine. In the first case, the universality (of generating sets of numbers) is obtained also for a small number of membranes, four. 

},
	keywords = {Membrane computing, register machine, symport/antiport, Turing computability},
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1227085.1227115\&coll=GUIDE\&dl=GUIDE\&CFID=2475207\&CFTOKEN=63580860},
	author = {Gheorghe Paun and Juan Pazos-Sierra and Mario J. P{\'e}rez-Jim{\'e}nez and Alfonso Rodr{\'\i}guez-Pat{\'o}n}
}
@proceedings {,
	title = {TAPS{\textquoteright}05 Workshop on Theory and Applications of Systems},
	journal = {TAP{\textquoteright}S 05 Workshop on Theory  and Applications of Systems},
	year = {2005},
	note = {Gheorghe Paun; Gabriel Ciobanu (eds.)},
	address = {Timisoara, Ruman{\'\i}a},
	author = {Gheorghe Paun and Gabriel Ciobanu}
}
@proceedings {208,
	title = {Third Brainstorming Week on Membrane Computing},
	journal = {Third Brainstorming Week on Membrane Computing},
	volume = {I},
	year = {2005},
	note = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez; Francisco J. Romero-Campero; Dragos Sburlan (eds.)},
	pages = {358},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9 },
	author = {Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@proceedings {,
	title = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	note = {Miguel A. Guti{\'e}rrez-Naranjo; Agust{\'\i}n Riscos-N{\'u}{\~n}ez; Francisco J. Romero-Campero; Dragos Sburlan (eds.)},
	pages = {X+325 },
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {,
	title = {Tissue-like P systems with channel-states},
	journal = {Theoretical Computer Science},
	volume = {330},
	year = {2005},
	pages = {101-116},
	address = {Amsterdam, Holanda},
	abstract = {We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for the case of using{\textemdash}in a sequential manner{\textemdash}antiport rules of small weights. Systems with two cells are proved to be universal when having arbitrarily many states and minimal antiport rules, or one state and antiport rules of weight two. Also the systems with arbitrarily many cells, three states, and minimal antiport rules are universal. In contrast, the systems with one cell and any number of states and rules of any weight only compute Parikh sets of matrix languages (generated by matrix grammars without appearance checking); characterizations of Parikh images of matrix languages are obtained for such one-cell systems with antiport rules of a reduced weight. 
},
	keywords = {Matrix grammars; Membrane computing; P systems; States; Turing computability},
	doi = {10.1016/j.tcs.2004.09.013  },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B6V1G-4DGD3X8-3\&_user=603129\&_coverDate=01\%2F31\%2F2005\&_rdoc=9\&_fmt=full\&_orig=browse\&_srch=doc-info(\%23toc\%235674\%232005\%23996699998\%23556281\%23FLP\%23display\%23Volume)\&_cdi=5674\&_sort=d\&_docanchor=},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Tissue P systems with channel states.pdf},
	author = {Rudolf Freund and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Towards a programming language in cellular computing},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {123},
	year = {2005},
	pages = {93-110},
	address = {Holanda},
	abstract = {Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been noticed. In this paper we present a new solution, to the Partition problem, via a family of deterministic P systems with active membranes using 2-division. Then, we intend to show that the idea of a cellular programming language is possible (at least for some relevant family of NP-complete problems), indicating some {\textquotedblleft}subroutines{\textquotedblright} that can be used in a variety of situations and therefore could be useful for designing solutions for new problems in the future. 
},
	keywords = {Membrane Computing; Complexity Class; Cellular Subroutine; NP-complete problem},
	doi = {10.1016/j.entcs.2004.04.044   },
	url = {http://www.sciencedirect.com/science?_ob=ArticleURL\&_udi=B75H1-4FJT8PX-J\&_user=603129\&_coverDate=03\%2F01\%2F2005\&_rdoc=6\&_fmt=full\&_orig=browse\&_srch=doc-info(\%23toc\%2313109\%232005\%23998769999\%23574761\%23FLP\%23display\%23Volume)\&_cdi=13109\&_sort=d\&_docancho},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Towards a programming language in cellular computing.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {44,
	title = {Towards P systems as a Computational Modelling Tool for Systems Biology},
	journal = {Research Group on Natural Computing},
	number = {2},
	year = {2005},
	pages = {53},
	publisher = {Universidad de Sevilla},
	address = {Sevilla},
	author = {Francisco J. Romero-Campero}
}
@article {,
	title = {Trading polarizations for bi-stable catalysts in P systems with active membranes},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {373-388},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In the last time, several efforts have been made in order to remove polarizations of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of power represented by avoiding polarizations, we use bi-stable catalysts. Polarizationless systems with active membranes which use bi-stable catalysts are proven to be computationally complete and able to solve efficiently NP-complete problems. In this paper we present a solution to SAT in linear time. In order to illustrate the presented solution, we also provide a simulation with CLIPS.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/dc6hae6hbe6541vq/?p=742d49e299334301a36583e895d4c151\&pi=23},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {601,
	title = {Turing machines with cells on the tape},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {61-73},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	isbn = {84-609-5338-6},
	url = {http://www.cs.us.es/~marper/investigacion/complejidad.html},
	author = {Francesco Bernardini and Marian Gheorghe and Natalio Krasnogor and Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {543,
	title = {Una visi{\'o}n computacional de la c{\'e}lula},
	journal = {Estudios de L{\'o}gica y Lenguaje (I)},
	year = {2005},
	pages = {197-228},
	publisher = {Mergablum, Edici{\'o}n y Comunicaci{\'o}n S.L.},
	chapter = {XI},
	address = {Sevilla, Spain},
	abstract = {El an{\'a}lisis detallado de la estructura y el funcionamiento de las c{\'e}lulas vivas sugiere la posibilidad de crear nuevos modelos en los que el paralelismo masivo y el no determinismo se implementan de manera natural. En este cap{\'\i}tulo se presentan algunos aspectos de las c{\'e}lulas que son relevantes desde el punto de vista computacional, y se estudian la potencia y eficiencia de los dispositivos no convencionales que se introducen inspirados en las c{\'e}lulas.},
	isbn = {84-96378-26-8},
	url = {http://www.cs.us.es/~marper/investigacion/vision.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/vision.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {{\'A}ngel Nepomuceno and Francisco J. Salguero and Fernando Soler-Toscano}
}
@article {,
	title = {Unconventional Computation},
	journal = {Lecture Notes in Computer Science},
	volume = {3699},
	year = {2005},
	note = {Cristian Calude; Michael J. Dinneen; Gheorghe Paun; Mario J. P{\'e}rez-Jim{\'e}nez; Grzegorz Rozenberg (eds.)},
	pages = {XI+267},
	publisher = {Springer},
	address = {Berl{\'\i}n, Alemania},
	isbn = {978-3-540-29100-8},
	author = {Cristian Calude and Michael J. Dinneen and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@proceedings {,
	title = {Unconventional Computation: 4th International Conference, UC 2005 },
	journal = {International Conference on Unconventional Computation},
	year = {2005},
	address = {Sevilla, Espa{\~n}a},
	isbn = {3-540-29100-8},
	author = {Cristian Calude and Michael J. Dinneen and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg}
}
@article {602,
	title = {An universality result for a membrane calculus based on mate/drips operations},
	journal = {Cellular Computing (Complexity Aspects)},
	year = {2005},
	pages = {75-94},
	publisher = {F{\'e}nix Editora},
	address = {Seville, Spain},
	isbn = {84-609-5338-6},
	url = {http://www.cs.us.es/~marper/investigacion/complejidad.html},
	author = {Luca Cardelli and Gheorghe Paun},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Using automated reasoning systems on molecular computing},
	journal = {Lecture Notes in Computer Science},
	volume = {3384},
	year = {2005},
	pages = {128-137},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study the correctness of a program) and DNA computing (as practical devices to handle DNA strands to solve classical hard problems with laboratory techniques). To illustrate this work we have proven in the PVS proof checker, the correctness of a program, in a sticker based model for DNA computation, solving the pairwise disjoint families problem. Also we introduce the formalization of the Floyd{\textendash}Hoare logic for imperative programs.
},
	isbn = {978-3-540-26174-2},
	issn = {0302-9743},
	doi = {10.1007/b136914},
	url = {http://www.springerlink.com/content/hbgc18tyv7nap649/?p=421537edb83041aa94fcae99f6225d79\&pi=10},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {280,
	title = {(Imprecise topics about) Handling imprecision in P systems},
	journal = {Brainstorming Workshop on Uncertainty in Membrane Computing},
	year = {2004},
	month = {November 8-10},
	pages = {1-10},
	address = {Palma de Mallorca, Espa{\~n}a},
	isbn = {84-7632-897-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/(Imprecise topics about) Handling imprecision in P systems.pdf},
	author = {Antonio di-Nola and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Francesc Rossell{\'o}-Llompart}
}
@article {,
	title = {An approach to computational complexity in Membrane Computing},
	journal = {Brainstorming Workshop on Uncertainty in Membrane Computing},
	year = {2004},
	month = {November 8-10},
	pages = {67-94},
	publisher = {Department de Matem{\`a}tiques i Inform{\`a}tica de la Universitat de les Illes Balears},
	address = {Palma de Mallorca},
	isbn = {84-7632-897-4},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {279,
	title = {Introduction to Membrane Computing},
	journal = {Brainstorming Workshop on Uncertainty in Membrane Computing},
	year = {2004},
	month = {November 8-10},
	address = {Palma de Mallorca, Espa{\~n}a},
	isbn = {84-7632-897-4},
	author = {Gheorghe Paun}
}
@article {,
	title = {Simulating parallel architectures with P systems},
	journal = {Workshop on Membrane Computing, WMC5},
	year = {2004},
	month = {June 14-16, 2004},
	pages = {184-185},
	address = {Mil{\'a}n, Italia},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}
}
@article {,
	title = {Computational Complexity in P Systems},
	journal = {Workshop on Membrane Computing, WMC5},
	year = {2004},
	month = {June 14-16},
	pages = {63},
	address = {Mil{\'a}n, Italia},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Computational Complexity in P Systems.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}
}
@article {278,
	title = {Learning New Computing Models from Biology: Membrane Computing},
	journal = {International Conference on Computers and Communications},
	year = {2004},
	month = {June 1-3},
	address = {Oradea, Ruman{\'\i}a},
	isbn = {973-613-542-X},
	author = {Gheorghe Paun}
}
@article {284,
	title = {A perfect shuffle algorithm for reduction processes and its simulation with P systems},
	journal = {International Conference on Computers and Communications},
	year = {2004},
	month = {June 1-3},
	pages = {92-97},
	publisher = {Universitatii din Oradea, Ruman{\'\i}a},
	address = {Oradea, Ruman{\'\i}a},
	isbn = {973-613-542-X},
	url = {http://www.cs.us.es/~marper/investigacion/oradea.pdf},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {I. Dzitac and T. Maghiar and C. Popescu}
}
@article {286,
	title = {A CLIPS simulator for recognizer P systems with active membranes},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {387-413},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/A CLIPS Simulator for Recognizer P Systems with Active Membrane.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {281,
	title = {Deductive Data Bases and P Systems},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Vladimir Rogozhin}
}
@article {283,
	title = {An efficient cellular solution for the Partition problem},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {237-246},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/An efficient cellular solution for the partiton problem.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {277,
	title = {Looking for P truth},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {134-138},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Looking for P Truth.pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {274,
	title = {Simulating Shuffle-Exchange Networks with P Systems},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {117-129},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/shuffle.pdf},
	author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {273,
	title = {Solving the Bin Packing problem by recognizer P systems with active membranes},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {272,
	title = {Tissue P systems with cell division},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {380-386},
	isbn = {84-688-6101-4},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Tissue P systems with cell division.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {270,
	title = {Weak metrics on configurations of a P system},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	month = {February 2-7},
	pages = {139-151},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-688-6101-4},
	url = {http://www.cs.us.es/~marper/investigacion/metricas.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/weak metrics on configurations of a P system.pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Recognizer membrane systems},
	journal = {ECAI 2004 (16th European Conference on Artificial Intelligence)},
	year = {2004},
	month = {August 22-27},
	pages = {13},
	address = {Valencia, Espa{\~n}a},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Recognizer Membrane Systems.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {271,
	title = {Towards an efficient strategy for searching in P systems},
	journal = {ECAI 2004 (16th European Conference on Artificial Intelligence)},
	year = {2004},
	month = {August 22-27},
	pages = {15-25},
	address = {Valencia, Espa{\~n}a},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Towards an efficient strategy for searching in P systems.pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {80,
	title = {A Prolog simulator for deterministic P systems with active membranes},
	journal = {New Generation Computing},
	volume = {22},
	year = {2004},
	month = {08/2004},
	pages = {349-363   },
	address = {Tokyo, Jap{\'o}n},
	abstract = {In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. This representation allows us to express the set of rules and the configuration of the P system in eaeh step of the evolution as literals of an appropriate, language of first order logic. We provide a Prolog program to simulate the evolution of these P systems and present some auxiliary tools to simulate the evolution of a P system with active membranes using 2-division which solves the SAT problem following the techniques presented in Reference. 


},
	keywords = {logic programming, Membrane computing, prolog, SAT-problem, simulation},
	issn = {0288-3635 },
	url = {http://portal.acm.org/citation.cfm?id=1044475},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@proceedings {226,
	title = {Second Brainstorming Week on Membrane Computing},
	journal = {Second Brainstorming Week on Membrane Computing},
	year = {2004},
	note = {Gheorghe Paun; Agust{\'\i}n Riscos-N{\'u}{\~n}ez; {\'A}lvaro Romero-Jim{\'e}nez; Fernando Sancho-Caparrini (eds.)},
	month = {02/02/2004},
	pages = {456},
	address = {Seville (Spain)},
	isbn = {84-688-6101-4},
	url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
	author = {Gheorghe Paun and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Aspects of Molecular Computing},
	year = {2004},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Natasha Jonoska (eds.)},
	pages = {XI+ 391},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-20781-3},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Natasha Jonoska}
}
@article {,
	title = {Bio-Steps Beyond Turing},
	journal = {BioSystems},
	volume = {77},
	year = {2004},
	pages = {175-194},
	address = {Los Paises Bajos},
	abstract = {Are there {\textquoteleft}biologically computing agents{\textquoteright} capable to compute Turing uncomputable functions? It is perhaps tempting to dismiss this question with a negative answer. Quite the opposite, for the first time in the literature on molecular computing we contend that the answer is not theoretically negative. Our results will be formulated in the language of membrane computing (P systems). Some mathematical results presented here are interesting in themselves. In contrast with most speed-up...},
	keywords = {Turing; Bio-steps; P systems},
	doi = {10.1016/j.biosystems.2004.05.032  },
	url = {http://linkinghub.elsevier.com/retrieve/pii/S0303264704000954},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Bio-steps.pdf},
	author = {Cristian Calude and Gheorghe Paun}
}
@article {176,
	title = {Computing Partial Recursive Functions by Transition P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {2933},
	year = {2004},
	pages = {320-340},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper a variant of transition P systems with external output designed to compute partial functions on natural numbers is presented. These P systems are stable under composition, iteration and unbounded minimization (μ{\textendash}recursion) of functions. We prove that every partial recursive function can be computed by such P systems, from which the computational completeness of this model can be deduced.},
	isbn = {978-3-540-20895-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-24619-0_23},
	url = {http://dx.doi.org/10.1007/978-3-540-24619-0_23},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {,
	title = {Current Trends in Theoretical Computer Science. The Challenge of the New Century },
	year = {2004},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (eds.)},
	publisher = {World Scientific},
	address = {New Jersey, Estados Unidos},
	isbn = {981-238-965-2},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Current Trends in Theoretical Computer Science. The Challenge of the New Century. Vol 1: Algorithms and Complexity},
	year = {2004},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (eds.)},
	pages = {676},
	publisher = {World Scientific Publishing Company},
	address = {Singapur, Singapur},
	isbn = {981-238-966-0},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Deductive databases and P systems},
	journal = {Computer Science Journal of Moldova},
	volume = {12},
	year = {2004},
	pages = {80-88},
	publisher = {Institute of Mathematics and Computer Science},
	address = {Chisinau, Moldova},
	abstract = {In computational processes based on backwards chaining, a rule of the type is seen as a procedure which points that the problem can be split into the problems . In classical devices, the subproblems are solved sequentially. In this paper we present some questions that circulated during the Second Brainstorming Week related to the application of the parallelism of P systems to computation based on backwards chaining on the example of inferential deductive process.

},
	keywords = {artificial intelligence, backwards chaining, Deductive databases, inferential deductive process, membrane systems, P systems},
	issn = {1561-4042},
	url = {http://www.math.md/imi-site/journals/csjm/cont12_1.shtml},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Vladimir Rogozhin}
}
@article {,
	title = {DNA Computing. New Computing Paradigms (Translation in the Simplified Version of the English Version)},
	year = {2004},
	pages = {354},
	publisher = {Springer-Verlag},
	address = {Wuhan},
	isbn = {7-302-08658-3 },
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {An efficient family of P systems for packing items into bins},
	journal = {Journal of Universal Computer Science},
	volume = {10},
	year = {2004},
	pages = {650-670},
	address = {Granz Austria},
	abstract = {In this paper we present an effective solution to the Bin Paching problem using a family of recognizer P systems with active membranes. The analysis of the solution presented here will be done from the point of view of complexity classes. A CLIPS simulator for recognizer P systems is used to describe a session for an instance of Bin Packing, using a P system from the designed family. 
},
	keywords = {Bin Packing problem, CLIPS, Complexity Classes, Membrane computing, Recognizer P systems},
	attachments = {http://www.gcn.us.es/biblio/themes/files/An efficient family of P systems....pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
@article {,
	title = {Formal languages and Applications},
	year = {2004},
	pages = {620},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-20907-7},
	author = {Gheorghe Paun and Victor Mitrana and Carlos Mart{\'\i}n-Vide}
}
@article {,
	title = {From regulated rewriting to computing with membranes: collapsing hierarchies},
	journal = {Theoretical Computer Science},
	volume = {312},
	year = {2004},
	pages = {143 - 188   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {In addressing certain problems about membrane computing, a recent and active branch of natural computing, it first was necessary to address certain problems from the area of regulated rewriting. Thus, the present paper is a contribution to both these domains.A central problem in membrane computing is that of the hierarchy with respect to the number of membranes: Are systems with n + 1 membranes more powerful than systems with n membranes? Does the number of membranes induce an infinite hierarchy of the computed functions? Usually, when proving the universality of membrane systems (also called P systems), one starts from a matrix grammar and the number of membranes depends on the number of non-terminal symbols used by this grammar in the so-called appearance checking mode. We first prove that recursively enumerable languages can be generated by matrix grammars with only two non-terminal symbols being used in the appearance checking mode. The proofs of this fact and of several related results are based on a simulation of register machines by means of graph-controlled grammars.Then, we consider three classes of membrane systems, and in all the three cases the hierarchies with respect to the number of membranes are shown to collapse at level four: systems with four membranes are computationally universal (but we do not know whether or not this result is optimal). 


},
	keywords = {graph-controlled grammar, matrix grammar, Membrane computing, non-terminal complexity, P system, programmed grammar, recursively enumerable language, register machine, regulated rewriting},
	issn = {0304-3975 },
	doi = {10.1016/j.tcs.2003.08.006 },
	url = {http://portal.acm.org/citation.cfm?id=980017.980018\&dl=GUIDE\&dl=GUIDE\&CFID=15151515\&CFTOKEN=6184618},
	author = {Rudolf Freund and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {,
	title = {Implementing in Prolog an effective cellular solution for the knapsack problem},
	journal = {Lecture Notes in Computer Science},
	volume = {2933},
	year = {2004},
	pages = {140-152},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.},
	isbn = {978-3-540-20895-2},
	issn = {0302-9743},
	doi = {10.1007/b95207},
	url = {http://www.springerlink.com/content/dr7fphkr7l0vcy2e/?p=1c67f331bf084a449d112eb8de331656\&pi=9},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Fernando Sancho-Caparrini}
}
@article {178,
	title = {A linear-time solution for the knapsack problem with active membranes},
	journal = {Lecture Notes in Computer Science},
	volume = {2933},
	year = {2004},
	pages = {250-268},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Up to now, P systems dealing with numerical problems have been rarely considered in the literature. In this paper we present an effective solution to the Knapsack problem using a family of deterministic P systems with active membranes using 2-division. We show that the number of steps of any computation is of linear order, but polynomial time is required for pre-computing resources.},
	isbn = {978-3-540-20895-2},
	issn = {0302-9743},
	doi = {10.1007/b95207},
	url = {http://www.springerlink.com/content/w9022lqp0llrp59r/?p=66cbdb919de942eaa08b51f476e22861\&pi=18},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {,
	title = {Membrane Computing (After the Second Brainstorming Week on Membrane Computing)},
	journal = {Bulletin of the European Association for Theoretical Computer Science},
	volume = {73},
	year = {2004},
	pages = {159-170},
	address = {Pa{\'\i}ses Bajos},
	issn = {0252-9742},
	author = {Gheorghe Paun}
}
@article {,
	title = {Membrane Computing (International Workshop, WMC 2003, Revised Papers)},
	year = {2004},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa; Giancarlo Mauri; Carlos Mart{\'\i}n-Vide (eds.)},
	pages = {383},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n Alemania},
	isbn = {3-540-20895-X},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa and Giancarlo Mauri and Carlos Mart{\'\i}n-Vide}
}
@article {,
	title = {Membrane Computing: Some Non-standard Ideas},
	journal = {Lecture Notes in Computer Science},
	volume = { 2950},
	year = {2004},
	pages = {322-337},
	publisher = {Springer Berlin / Heidelberg},
	address = {Berl{\'\i}n},
	abstract = {We introduce four new variants of P systems, which we call non-standard because they look rather exotic in comparison with systems investigated so far in the membrane computing area: (1) systems where the rules are moved across membranes rather than the objects processed by these rules, (2) systems with reversed division rules (hence entailing the elimination of a membrane when a membrane with an identical contents is present nearby), (3) systems with accelerated rules (or components), where any step except the first one takes half of the time needed by the previous step, and (4) reliable systems, where, roughly speaking, all possible events actually happen, providing that enough resources exist. We only briefly investigate these types of P systems, the main goal of this note being to formulate several related open problems and research topics.},
	isbn = {978-3-540-20781-8},
	issn = {0302-9743},
	doi = {10.1007/b94864},
	url = {http://www.springerlink.com/index/CV6U5TC6T97M3G15.pdf},
	author = {Gheorghe Paun}
}
@article {99,
	title = {Modelos de computaci{\'o}n celular con membranas},
	journal = {Bolet{\'\i}n de la Sociedad Espa{\~n}ola de Matem{\'a}tica Aplicada},
	volume = {29},
	year = {2004},
	pages = {57-88 },
	address = {Salamanca (Spain)},
	issn = {1575-9822},
	url = {http://www.sema.org.es/ojs/index.php?journal=sema\&page=issue\&op=view\&path\%5B\%5D=18},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Modelos de Computaci{\'o}n Molecular, Celular y Cu{\'a}ntica },
	year = {2004},
	note = {Mario J. P{\'e}rez-Jim{\'e}nez; Agust{\'\i}n Riscos-N{\'u}{\~n}ez (eds.) },
	pages = {262},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	abstract = {El presente libro consta de tres cap{\'\i}tulos, cada uno de los cuales desarrolla un tema espec{\'\i}fico relativo a un modelo de computaci{\'o}n no convencional. Sus autores son Daniel D{\'\i}az Pernil, Juan Antonio Nepomuceno Chamorro y Antonio Jes{\'u}s Ramos Espina, y los contenidos de cada uno de los cap{\'\i}tulos se corresponden con el trabajo de investigaci{\'o}n que cada uno de ellos ha presentado para la obtenci{\'o}n de los 12 cr{\'e}ditos de la fase de investigaci{\'o}n del Programa de Doctorado L{\'o}gica, Computaci{\'o}n e Inteligencia Artificial, adscrito al Departamento de Ciencias de la Computaci{\'o}n e Inteligencia Artificial de la Universidad de Sevilla 

El primer cap{\'\i}tulo se titula Combinatoria en modelos moleculares sin memoria basados en ADN. Aplicaciones, y el objetivo fundamental es el desarrollo de una teor{\'\i}a de la combinatoria en modelos moleculares sin memoria basados en ADN, y su aplicaci{\'o}n a la resoluci{\'o}n eficiente de problemas NP-completos en dicho marco computacional. 

En el segundo cap{\'\i}tulo se presenta una introducci{\'o}n bastante completa a la Computaci{\'o}n Cu{\'a}ntica, desde el an{\'a}lisis de las ideas que subyacen en el modelo, hasta la exposici{\'o}n de ejemplos que ilustren su funcionamiento, pasando por una exhaustiva exposici{\'o}n de los elementos b{\'a}sicos de la mec{\'a}nica cu{\'a}ntica que son necesarios para comprender el nuevo modelo. 

En el tercer cap{\'\i}tulo se aborda un tema especialmente interesante de los modelos celulares con membranas; concretamente el uso de recursos precomputados a la hora de obtener buenas soluciones de problemas presuntamente intratables desde el punto de vista de la Complejidad Computacional cl{\'a}sica. En este cap{\'\i}tulo se presenta un primer sistema celular que usa recursos precomputados, siguiendo las ideas de E. Czeiler, se estudia dicho modelo como un dispositivo reconocedor de lenguajes, y se describen soluciones de dos problemas de decisi{\'o}n (el test de primalidad y el problema de la satisfactibilidad de la l{\'o}gica proposicional) en este nuevo marco. 

Este libro debe ser considerado como una nueva aportaci{\'o}n al estudio de los modelos de computaci{\'o}n no convencionales. A menos que se pruebe la igualdad de las clases de complejidad P y NP, estos modelos constituyen hoy d{\'\i}a una alternativa indispensable a los modelos convencionales cuya implementaci{\'o}n ordinaria est{\'a} basada en la manipulaci{\'o}n electr{\'o}nica del silicio, debido a las limitaciones f{\'\i}sicas que tienen estos dispositivos. 

},
	isbn = {84-609-3200-1 },
	url = {http://www.cs.us.es/~marper/investigacion/cuantica.html},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {544,
	title = {Modelos de Computaci{\'o}n Natural},
	journal = {Bases biol{\'o}gicas, ling{\"u}{\'\i}sticas, l{\'o}gicas y computacionales para la conceptualizaci{\'o}n de la mente},
	year = {2004},
	pages = {199-245},
	publisher = {Mergablum, Edici{\'o}n y Comunicaci{\'o}n S.L.},
	edition = {1},
	chapter = {8},
	address = {Sevilla, Spain},
	isbn = {84-96378-04-7},
	url = {http://www.cs.us.es/~marper/investigacion/mcn.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/mcn.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {{\'A}ngel Nepomuceno and Francisco J. Salguero and Fernando Soler-Toscano}
}
@article {,
	title = {A Note on Complexity Measures for Probabilistic P Systems},
	journal = {Journal of Universal Computer Science},
	volume = {10},
	year = {2004},
	pages = {559-566},
	address = {Granz Austria},
	abstract = {In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in order to obtain some quantitative parameters showing how complex the evolution of a P system is. To this end, we define two possible measures, the first one to reflect the entropy of the P system considered as the state space of possible computations, and the second one to reflect the change of the P system as it evolves. 
},
	keywords = {Entropy, Natural computing, P systems},
	url = {http://www.jucs.org/jucs_10_5/a_note_on_complexity},
	attachments = {http://www.gcn.us.es/biblio/themes/files/A note on Complexity Measures....pdf},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Fernando Sancho-Caparrini}
}
@article {,
	title = {On the power of membrane division in P systems},
	journal = {Theoretical Computer Science},
	volume = {324},
	year = {2004},
	pages = {61 - 85},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {First, we consider P systems with active membranes, hence with the possibility that the membranes can be divided, with non-cooperating evolution rules (the objects always evolve separately). These systems are known to be able to solve NP-complete problems in linear time. Here we give a normal form theorem for such systems: their computational universality is preserved even if only the elementary membranes are divided. The possibility of solving SAT in linear time is preserved only when non-elementary membranes may also be divided under the influence of objects in their region.Second, we consider a slight generalization, namely, we allow that a membrane can produce by division both a copy of itself and a copy of a membrane with a different label; again, only elementary membranes may be divided. In this case, we prove that the hierarchy on the maximal number of membranes present in the system collapses: three membranes at a time are sufficient in order to characterize the recursively enumerable sets of vectors of natural numbers. This result is optimal, two membranes are shown not to be sufficient.Third, we consider P systems with cooperating rules (several objects may evolve together). Making use of this powerful feature, we show that many NP-complete problems can be solved in linear time in a quite uniform way (by systems which are very similar to each other), using only elementary membranes division (and not further ingredients, such as electrical charges). The degree of cooperation is minimal: two objects at a time. 


},
	keywords = {Membrane computing, recursively enumerable language, SAT problem, Universality},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2004.03.053},
	url = {http://portal.acm.org/citation.cfm?id=1041011},
	author = {Gheorghe Paun and Yasuhiro Suzuki and Hiroshi Tanaka and Takashi Yokomori}
}
@article {,
	title = {On the Reachability Problem for P Systems With Symport/Antiport},
	journal = {Publicationes Mathematicae Debrecen},
	volume = {65},
	year = {2004},
	pages = {603-627},
	address = {Debrecen, Hungr{\'\i}a},
	issn = {0033-3883},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {40,
	title = {P systems with tables of rules},
	journal = {Lecture Notes in Computer Science},
	volume = {3113},
	year = {2004},
	pages = {235-249},
	publisher = {Springer Berlin / Heidelberg},
	isbn = {978-3-540-22393-1},
	issn = {0302-9743 },
	doi = {10.1007/b98751},
	url = {http://www.springerlink.com/content/9mgxjrruc2l6hbfu/?p=241a08f8d4ac468989ce79278c81f6c3\&pi=20},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
	editor = {Juhani Karhumaki and Hermann Maurer and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {,
	title = {P systems with tables of rules},
	journal = {Lecture Notes in Computer Science},
	volume = {3113},
	year = {2004},
	pages = {235-249},
	publisher = {Springer Berlin / Heidelberg},
	address = {Berl{\'\i}n},
	abstract = {In the last time, several efforts were made in order to remove the polarization of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of power represented by avoiding polarizations, we introduce tables of rules: each membrane has associated several sets of rules, one of which is non-deterministically chosen in each computation step. Three universality results for tabled P systems are given, trying to use rules of as few as possible types. Then, we consider tables with obligatory rules {\textendash} rules which must be applied at least once when the table is applied. Systems which use tables with at most one obligatory rule are proven to be able to solve SAT problem in linear time. Several open problems are also formulated.},
	isbn = {978-3-540-22393-1},
	issn = {0302-9743},
	doi = {10.1007/b98751},
	url = {http://www.springerlink.com/content/9mgxjrruc2l6hbfu/?p=241a08f8d4ac468989ce79278c81f6c3\&pi=20},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {195,
	title = {The P Versus NP Problem Through Cellular Computing with Membranes},
	journal = {Lecture Notes in Computer Science},
	volume = {2950},
	year = {2004},
	pages = {338-352},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the relation by the polynomial time unsolvability of an NP{\textendash}complete problem by means of a P system.},
	isbn = {978-3-540-20781-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-24635-0_26},
	url = {http://dx.doi.org/10.1007/978-3-540-24635-0_26},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@proceedings {,
	title = {Pre-proceedings of the Fifth Workshop on Membrane Computing, WMC5},
	journal = {Workshop on Membrane Computing, WMC5},
	year = {2004},
	address = {Mil{\'a}n, Italia},
	author = {Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}
}
@article {,
	title = {Second Brainstorming Week on Membrane Computing},
	journal = {Journal of Universal Computer Science},
	volume = {10},
	year = {2004},
	pages = {499-501},
	address = {Granz Austria},
	url = {http://www.jucs.org/jucs_10_5},
	attachments = {http://www.gcn.us.es/biblio/themes/files/2nd Brainstorming Week.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Theory is Forever},
	journal = {Lecture Notes in Computer Science},
	volume = {3113},
	year = {2004},
	note = {Gheorghe Paun; Grzegorz Rozenberg; Hermann Maurer; Juhani Karhumaki (eds.)},
	pages = {X+283},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-22393-2},
	url = {http://www.sigmod.org/dblp/db/conf/birthday/salomaa2004.html},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Hermann Maurer and Juhani Karhumaki}
}
@article {,
	title = {Trading polarizations for labels in P systems with active membranes },
	journal = {Acta Informatica},
	volume = {41},
	year = {2004},
	pages = {111-144},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {This paper addresses the problem of removing the polarization of membranes from P systems with active membranes - and this is achieved by allowing the change of membrane labels by means of communication rules or by membrane dividing rules. As consequences of these results, we obtain the universality of P systems with active membranes which are allowed to change the labels of membranes, but do not use polarizations. Universality results are easily obtained also by direct proofs. By direct constructions, we also prove that <Emphasis FontCategory="NonProportional">SAT</Emphasis> can be solved in linear time by systems without polarizations and with label changing possibilities. If non-elementary membranes can be divided, then <Emphasis FontCategory="NonProportional">SAT</Emphasis> can be solved in linear time without using polarizations and label changing. Several open problems are also formulated. 
},
	issn = {0001-5903},
	doi = {10.1007/s00236-004-0153-z},
	url = {http://www.springerlink.com/index/A7HGMKPDA0W7F0W2.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Trading polarizations for Labels....pdf},
	author = {Artiom Alhazov and Linqiang Pan and Gheorghe Paun}
}
@article {292,
	title = {News in Membrane Computing: A View from Tarragona},
	journal = {Second Annual Meeting of Project Molconet},
	year = {2003},
	month = {November 27-29},
	address = {Viena, Austria},
	author = {Gheorghe Paun}
}
@article {,
	title = {Solving numerical NP-complete problems using P systems with active membranes: the Partition problem and beyond},
	journal = {Second Annual Meeting of Project Molconet},
	year = {2003},
	month = {November 27-29},
	pages = {1-6},
	address = {Viena, Austria},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Solving Numerical NP- Complete problems.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
@article {297,
	title = {Context-Free Insertion-Deletion Systems},
	journal = {First Annual Meeting of the European Molecular Computing Consortium},
	year = {2003},
	month = {May 15-17},
	address = {Turku, Finlandia},
	author = {Maurice Margenstern and Gheorghe Paun and Yurii Rogozhin and Sergey Verlan}
}
@article {294,
	title = {Membrane Computing - Power and Efficiency: Recent Results},
	journal = {First Joint Meeting between the RSME and the AMS},
	year = {2003},
	month = {June 18-21},
	address = {Sevilla, Espa{\~n}a},
	author = {Gheorghe Paun}
}
@article {288,
	title = {Using automated reasoning systems in Natural Computing},
	journal = {First Joint Meeting between the RSME and the AMS},
	year = {2003},
	month = {June 18-21},
	pages = {4},
	address = {Sevilla, Espa{\~n}a},
	abstract = {The simple intuitive verification or even the use of formal notation does not ensure us that a designed program or a set of specifications are correct. The availability of general purpose theorem proving tools as PVS opens the way for elaboration and development of techniques that will allow us to attack the processes of verification in the scope of Natural Computing. Also, those formalizations are done in a generic framework in which the concrete implementation of each operation is not important, but only their properties. This is a suitable way of working before implementing them in a real mode that brings us the possibility of simulating real experiments or developing new ones.},
	url = {http://www.cs.us.es/~marper/investigacion/rsme-ams.pdf},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {298,
	title = {Computing a Partial Mapping by a P System: Design and Verification},
	journal = {First Brainstorming Week on Membrane Computing },
	year = {2003},
	month = {February 5-11},
	pages = {247-260},
	address = {Tarragona, Spain},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Computing a Partial Mapping by a P system  Design and Verification.pdf},
	author = {Antonio J. P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {296,
	title = {Formal verification of a transition P system generating the set {2^n+n^2+n:n>=1}},
	journal = {First Brainstorming Week on Membrane Computing},
	year = {2003},
	month = {February 5-11},
	pages = {261-269},
	address = {Tarragona, Espa{\~n}a},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Formal Verification of a Transition P System Generating the Set ....pdf},
	author = {Antonio J. P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {295,
	title = {Generalizing Logic Programs Via Subsumption},
	journal = {International Conference on Computer Aided Systems Theory},
	year = {2003},
	month = {February 5-11},
	pages = {185-188},
	address = {Las Palmas de Gran Canaria},
	isbn = {84-688-0820-2},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az},
	editor = {R. Moreno-D{\'\i}az jr. and A. Quesada-Arencibia and J. C. Rodr{\'\i}guez-Rodr{\'\i}guez}
}
@proceedings {,
	title = {Proceedings of the Brainstorming Week on Membrane Computing},
	journal = {First Brainstorming Week on Membrane Computing},
	year = {2003},
	month = {February 5-11},
	address = {Tarragona, Espa{\~n}a},
	author = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {287,
	title = {Verification of non deterministic transition P systems solving SAT problem },
	journal = {First Brainstorming Week on Membrane Computing},
	year = {2003},
	month = {February 5-11},
	pages = {291-304},
	address = {Tarragona, Spain},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Verification of Non Detrministic Transition P systems solving SAT problems.pdf},
	author = {Fernando Sancho-Caparrini and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {,
	title = {Molecular programs as formal systems},
	journal = {12th International Congress of Logic, Methodology and Philosophy of Science},
	year = {2003},
	month = {August 7-13},
	pages = {160-161},
	address = {Oviedo, Espa{\~n}a},
	isbn = {84-600-9913-X},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Molecular Programs as Formal Systems.pdf},
	author = {Daniel D{\'\i}az-Pernil and Mario J. P{\'e}rez-Jim{\'e}nez and Antonio J. Ramos-Espina},
	editor = {E. Alvarez and R. Bosch and L. Villamil}
}
@article {301,
	title = {Complexity Classes in Cellular  Computing with Membranes},
	journal = {Brainstorming Week on Membrane Computing},
	year = {2003},
	month = {5-11/02/2003},
	pages = {270-278},
	address = {Tarragona (Spain)},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {290,
	title = {Solving VALIDITY Problem by Active Membranes with Input},
	journal = {Brainstorming Week on Membrane Computing},
	year = {2003},
	month = {5-11/02/2003},
	pages = {279-290},
	address = {Tarragona (Spain)},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Matteo Cavaliere and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {300,
	title = {Complexity Classes in Cellular Computing with Membranes},
	journal = {First Joint Meeting between the RSME and the AMS},
	year = {2003},
	month = {18-21/06/2003},
	pages = {4},
	address = {Seville (Spain)},
	abstract = {Given a class of recognizer membrane systems F, the complexity class PMC_F of all prob-
lems solvable in polynomial time by a family of P systems of type F is presented. This
complexity class is stable by polynomial time reduction, and offer a new way to attack the
P = NP conjecture, now inside the framework of the cellular computing with membranes.},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {299,
	title = {Complexity Classes in Cellular Computing with Membranes},
	journal = {First Annual Meeting of the European Molecular Computing Consortium},
	year = {2003},
	month = {15-17/05/2003},
	pages = {18},
	address = {Turku (Finland)},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {302,
	title = {A Polynomial Complexity Class in P Systems Using Membrane Division},
	journal = {Fifth International Workshop on Descriptional Complexity of Formal Systems},
	year = {2003},
	month = {12-14/07/2003},
	pages = {284-294},
	address = {Budapest (Hungary)},
	isbn = {963-311-356-3},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Erzsebet Csuhaj-Varj{\'u} and C. Kintala and D. Wotschke and Gy{\"o}rgy Vaszil}
}
@article {,
	title = {(In search of) probabilistic P systems },
	journal = {Biosystems},
	volume = {70},
	year = {2003},
	pages = {107-121},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {The aim of this paper is to (preliminarily) discuss various ways of introducing probabilities in membrane systems. We briefly present both ideas already circulated in the literature and new proposals, trying to have a systematic overview of possibilities of associating probabilities with the ingredients of a membrane system: with (localization of) single objects, with multiplicities of objects (hence with the multisets), with the rules (depending or not on the previous applied rule), with the communication targets. For a certain mode of using the probabilities associated with the evolution rules (in string-object P systems) we obtain the computational universality.

},
	keywords = {Biochemistry, Membrane computing, Probability, Turing computability, Universality},
	issn = {0303-2647},
	doi = {10.1016/S0303-2647(03)00034-0 },
	url = {http://www.ingentaconnect.com/content/els/03032647/2003/00000070/00000002/art00034},
	author = {Adam Obtulowicz and Gheorghe Paun}
}
@article {184,
	title = {An agent based approach of collective foraging},
	journal = {Lecture Notes in Computer Science},
	volume = {2686},
	year = {2003},
	pages = {638-645},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper the behaviour of a bee colony is modeled as a society of communicating agents acting in parallel and synchronizing their behaviour. Two computational models for defining the agents behaviour are introduced and compared and tools developed for these models are briefly illustrated.
},
	isbn = {978-3-540-40210-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/e933h29uk36tfdgq/?p=c86f3cd949ae4952834f60486689c242\&pi=80},
	author = {Marian Gheorghe and Carlos Mart{\'\i}n-Vide and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Array-rewriting P systems },
	journal = {Natural Computing},
	volume = {2},
	year = {2003},
	pages = {229-249},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {We consider array languages (sets of picturesconsisting of symbols placed in the lattice points of the 2D grid) and thepossibility to handle them with P systems. After proving binary normal formsfor array matrix grammars (which, even in the case when no appearance checking isused, are known to generate the array languages of arbitrary array grammars), weprove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able togenerate all computable array languages. Some open problems },
	keywords = {array languages, matrix grammar, Membrane computing, P system, Turing computability},
	issn = {1567-7818 },
	doi = {10.1023/A:1025497107681},
	url = {http://www.springerlink.com/index/L4214H6262727881.pdf},
	author = {Rodica Ceterchi and Madhu Mutyam and Gheorghe Paun and K. G. Subramanian}
}
@article {114,
	title = {Complexity classes in models of cellular computing with membranes},
	journal = {Natural Computing},
	volume = {2},
	year = {2003},
	pages = {265 - 285   },
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {In this paper we introduce four complexity classes for cellular computing systems with membranes: the first and the second ones contain all decision problems solvable in polynomial time by a family of deterministic P systems, without and with an input membrane, respectively; the third and fourth classes contain all decision problems solvable in polynomial time by a family of non-deterministic P systems, without and with an input membrane, respectively. We illustrate the usefulness of these classes by solving two NP{\textendash}complete problems, namely HPP and SAT, in both variants of P systems.



},
	keywords = {Complexity Classes, Membrane computing, P systems},
	issn = {1567-7818 },
	doi = {10.1023/A:1025449224520},
	url = {http://dx.doi.org/10.1023/A:1025449224520},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {547,
	title = {Decision P systems and the P/=NP conjecture},
	journal = {Lecture Notes in Computer Science},
	volume = {2597},
	year = {2003},
	pages = {388-399},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {We introduce decision P systems,which are a class of P systems with symbol-objects and external output. The main result of the paper is the following:if there exists an NP-complete problem that cannot be solved in polynomial time,with respect to the input length,by a deterministic decision P system constructed in polynomial time,then P/=NP. From Zandron-Ferreti-Mauri{\textquoteright}s theorem it follows that if P/= NP,then no NP-complete problem can be solved in polynomial time, with respect to the input length,by a deterministic P system with active membranes but without membrane division,constructed in polynomial time from the input. Together,these results give a characterization of P/=NP in terms of deterministic P systems. },
	isbn = {978-3-540-00611-4},
	issn = {0302-9743},
	doi = {10.1007/3-540-36490-0_27},
	url = {http://dx.doi.org/10.1007/3-540-36490-0_27},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {From Watson-Crick L systems to Darwinian P systems },
	journal = {Natural Computing},
	volume = {2},
	year = {2003},
	pages = {299-318},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {Watson-Crick L systems are language generating devices making use of Watson-Crick complementarity, a fundamental concept of DNA computing. These devices are Lindenmayer systems enriched with a trigger for complementarity transition: if a {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} string is obtained, then the derivation continues with its complement which is always a {\textquoteleft}{\textquoteleft}good{\textquoteright}{\textquoteright} string. Membrane systems or P systems are distributed parallel computing models which were abstracted from the structure and the way of functioning of living cells. In this paper, we first interpret the results known about the computational completeness of Watson-Crick E0L systems in terms of membrane systems, then we introduce a related way of controlling the evolution in P systems, by using the triggers not in the operational manner (i.e., turning to the complement in a {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} configuration), but in a {\textquoteleft}{\textquoteleft}Darwinian{\textquoteright}{\textquoteright} sense: if a {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} configuration is reached, then the system {\textquoteleft}{\textquoteleft}dies{\textquoteright}{\textquoteright}, that is, no result is obtained. The triggers (actually, the checkers) are given as finite state multiset automata. We investigate the computational power of these P systems. Their computational completeness is proved, even for systems with non-cooperative rules, working in the non-synchronized way, and controlled by only two finite state checkers; if the systems work in the synchronized mode, then one checker for each system suffices to obtain the computational completeness.

},
	keywords = {L system, Membrane computing, P system, recursively enumerable language, Watson-Crick complementarity},
	issn = {1567-7818},
	doi = {10.1023/A:1025415914487},
	url = {http://www.springerlink.com/index/WV5LT5870636N784.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Carlos Mart{\'\i}n-Vide and Gheorghe Paun and Arto Salomaa}
}
@article {,
	title = {Gemmating P systems: collapsing hierarchies },
	journal = {Theoretical Computer Science},
	volume = {296},
	year = {2003},
	pages = {253-267 },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We continue the analysis of P systems with gemmation of mobile membranes. We solve an open problem from Besozzi et al. (Proc. Italian Conf. on Theoretical Computer Science 2001, Lecture Notes in Computer Science, Vol. 2202, Springer, Berlin, 2001, pp. 136{\textendash}153), showing that the hierarchy on the number of membranes collapses: systems with eight membranes characterize the recursively enumerable languages (seven membranes are enough in the case of extended systems). We also prove that P systems, which use only gemmation, but neither classical rewriting rules nor in/out communications, can generate the same family of languages. In this case, the hierarchy on the number of membranes collapses to level nine. 

},
	keywords = {matrix grammar, Membrane computing, recursively enumerable languages, Universality},
	issn = {0304-3975},
	doi = {10.1016/S0304-3975(02)00657-6 },
	url = {http://linkinghub.elsevier.com/retrieve/pii/S0304397502006576},
	author = {Daniela Besozzi and Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}
}
@article {,
	title = {Generalizing Programs via Subsumption},
	journal = {Lecture Notes in Computer Science},
	volume = {2809},
	year = {2003},
	pages = {115-126},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C1 subsumes the clause C2 iff C1 can be reached from C2 by applying these operators. We give a formalization of the closeness among clauses based on these operators and an algorithm to compute it as well as a bound for a quick estimation. We extend the operator to programs and we also get a characterization of the subsumption between programs. Finally, a weak metric is presented to compute the closeness among programs based on subsumption.},
	isbn = {978-3-540-20221-9},
	issn = {0302-9743},
	url = {http://www.springerlink.com/index/e2n91gjuq95a5v1l.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az}
}
@article {,
	title = {Hybrid Networks of Evolutionary Processors},
	journal = {Lecture Notes in Computer Science},
	volume = {2723},
	year = {2003},
	pages = {401-412},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with some strategies. Then the words which can pass the output filter of each node navigate simultaneously through the network and enter those nodes whose input filter was passed. We prove that these networks with filters defined by simple random-context conditions, used as language generating devices, are able to generate all linear languages in a very efficient way, as well as non-context-free languages. Then, when using them as computing devices, we present two linear solutions of the Common Algorithmic Problem.
},
	isbn = {978-3-540-40602-0},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/3yt2w7kgp6h5ctkm/?p=2bf594953627437eb4eed4e04713f308\&pi=48},
	author = {Carlos Mart{\'\i}n-Vide and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {ILP Operators for Propositional Connectionist Networks },
	journal = {Technische Berichte Technical Reports},
	volume = {-},
	year = {2003},
	pages = {103-106},
	address = {Dresden, Alemania},
	issn = {1430-211X},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Pascal Hitzler}
}
@article {,
	title = {M{\'a}quinas moleculares basadas en ADN},
	journal = {Colecci{\'o}n de Divulgaci{\'o}n Cient{\'\i}fica},
	volume = {2},
	year = {2003},
	pages = {255},
	publisher = {Secretariado de Publicaciones. Universidad de Sevilla },
	address = {Seville},
	abstract = {La Computaci{\'o}n Natural o Biocomputaci{\'o}n es una disciplina inspirada en el funcionamiento de los organismos vivos y tiene como objetivo fundamental la simulaci{\'o}n e implementaci{\'o}n de los procesos din{\'a}micos que se dan en la Naturaleza y que son susceptibles de ser considerados como procedimientos de c{\'a}lculo. 

La Computaci{\'o}n Biomolecular es la rama de la Computaci{\'o}n Natural que trata del procesamiento de la informaci{\'o}n codificada a trav{\'e}s de macromol{\'e}culas (como el ADN, el ARN o las prote{\'\i}nas). En 1994 esta computaci{\'o}n pasa de un plano te{\'o}rico (in info) a un plano experimental ( in vitro). Es el nacimiento de la computaci{\'o}n molecular basada en ADN. 

Este libro tiene como objetivo principal el estudio de ciertas m{\'a}quinas moleculares dise{\~n}adas en modelos no convencionales dentro del marco de la Computaci{\'o}n Natural, desde el punto de vista de la potencia computacional y de la capacidad para atacar la resolubilidad de problemas matem{\'a}ticos especialmente dif{\'\i}ciles. 

Para ello, se han elegido tres modelos de computaci{\'o}n molecular que poseen caracter{\'\i}sticas dispares y usan como sustrato f{\'\i}sico el ADN. Los dos primeros, el modelo no restringido de Adleman y el modelo d{\'e}bil de Amos, son modelos sin memoria ya que sus operaciones primitivas no alteran la estructura interna de las mol{\'e}culas. El tercer modelo objeto de estudio es el modelo sticker, que admite operaciones que alteran dicha estructura y, por tanto, puede usar las mol{\'e}culas a modo de unidades de memoria, susceptibles de ser modificadas en en tiempo de ejecuci{\'o}n. 

Este libro es el primer texto escrito en lengua castellana dedicado a la Computaci{\'o}n Molecular basada en ADN. Esperamos y confiamos que su contenido proporcione m{\'e}todos y t{\'e}cnicas que puedan ser de utilidad para estudios posteriores acerca de dichos modelos no convencionales, en particular para el an{\'a}lisis de la robustez de procedimientos complejos descritos en dichos modelos y para la mecanizaci{\'o}n de los procesos de verificaci{\'o}n de programas moleculares en sistemas de razonamiento autom{\'a}tico. },
	isbn = {84-472-0777-3},
	url = {http://www.cs.us.es/~marper/investigacion/libroadn1.html},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Membrane Computing (International Workshop, WMC-CDEA 2002, Revised Papers)},
	year = {2003},
	pages = {VIII+421},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-00611-7},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron}
}
@article {628,
	title = {Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers},
	journal = {Lecture Notes in Computer Science},
	volume = {2597},
	year = {2003},
	publisher = {Springer},
	isbn = {3-540-00611-7},
	url = {http://dblp.uni-trier.de/db/conf/wmp/wmc2002.html},
	author = {Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron}
}
@article {186,
	title = {A MzScheme implementation of Transition P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {2597},
	year = {2003},
	pages = {58-73},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The main goal of this paper is to present the design of an MzScheme program that allows us to simulate the behavior of transition P systems. For that, a library of procedures have been developed that work in two stages. In the first one, the parsing/compiling stage, the input P system is checked, and if it is well defined, then it is represented by means of an internal grammar. In a second stage, the simulation, the computation tree associated to the P system is generated until a prefixed level.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/lpn1vt6lajchxh9t/?p=bb2b349cabc24d1490b7d20ceeaab60e\&pi=4},
	author = {Delia Balbont{\'\i}n-Noval and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {A Note on Emergence in Multi-Agent String Processing Systems},
	journal = {Computing and Informatics},
	volume = {22},
	year = {2003},
	pages = {623-637},
	address = {Eslovaquia},
	abstract = {We propose a way to define (and, in a certain extent, even to measure) the phenomenon of emergence which appears in a complex system of interacting agents whose global behaviour can be described by a language and whose components (agents) can also be associated with grammars and languages. The basic idea is to identify the "linear composition of behaviours" with "closure under basic operations", such as the AFL (Abstract Families of Languages) operations, which are standard in the theory of formal languages. 

},
	keywords = {abstract families of languages, emergence, Grammar systems, multi-agent systems},
	issn = {1335-9150},
	url = {http://www.cai.sk/},
	author = {Jozef Kelemene and Rudolf Freund and Gheorghe Paun}
}
@article {545,
	title = {On Sigma-n definability in Arithmetic.},
	journal = {Philosophical Dimensions of Logic and Science},
	year = {2003},
	pages = {47-56},
	publisher = {Springer},
	edition = {1},
	chapter = {4},
	isbn = {978-1402016455},
	url = {http://www.cs.us.es/~marper/investigacion/definab.pdf},
	attachments = {http://www.gcn.us.es/biblio/themes/files/definab.pdf},
	author = {Joaqu{\'\i}n Borrego-D{\'\i}az and Alejandro Fern{\'a}ndez-Margarit and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {A. Rojszczak and J. Cachro and G. Kurczewski}
}
@article {,
	title = {On three variants of rewriting P systems },
	journal = {Theoretical Computer Science},
	volume = {301},
	year = {2003},
	pages = {201-215},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky and Lindenmayer hierarchies.

},
	keywords = {chomsky hierarchy, Lindenmayer systems, Membrane computing, regulated rewriting},
	issn = {0304-3975},
	doi = {10.1016/S0304-3975(02)00581-9 },
	url = {http://www.ingentaconnect.com/content/els/03043975/2003/00000301/00000001/art00581},
	author = {Claudio Ferretti and Giancarlo Mauri and Gheorghe Paun and Claudio Zandron}
}
@article {107,
	title = {PC grammar systems with five context-free components generate all recursively enumerable languages},
	journal = {Theoretical Computer Science},
	volume = {299},
	year = {2003},
	pages = {785 - 794   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language. 


},
	keywords = {descriptional complexity, parallel communicating grammar systems, recursively enumerable languages},
	issn = {0304-3975 },
	doi = {10.1016/S0304-3975(02)00852-6 },
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@proceedings {,
	title = {Pre-Proceedings of Workshop on Membrane Computing, WMC-2003},
	journal = {Workshop on Membrane Computing, WMC-2003},
	year = {2003},
	address = {Tarragona, Espa{\~n}a},
	author = {Artiom Alhazov and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {,
	title = {Recent Computability Models Inspired from Biology: DNA and Membrane Computing},
	journal = {Theoria},
	volume = {18},
	year = {2003},
	pages = {71-84},
	issn = {0495-4548},
	url = {http://dialnet.unirioja.es/servlet/articulo?codigo=499191},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {104,
	title = {Tissue P systems},
	journal = {Theoretical Computer Science},
	volume = {296},
	year = {2003},
	pages = {295-326},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0304-3975},
	doi = {10.1016/S0304-3975(02)00659-X},
	url = {http://dx.doi.org/10.1016/S0304-3975(02)00659-X},
	author = {Gheorghe Paun and Juan Pazos-Sierra and Carlos Mart{\'\i}n-Vide and Alfonso Rodr{\'\i}guez-Pat{\'o}n}
}
@article {,
	title = {Trends in Membrane Computing},
	journal = {First Annual Meeting of the European Molecular Computing Consortium},
	year = {2003},
	address = {Turku, Finlandia},
	author = {Gheorghe Paun}
}
@article {,
	title = {Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport},
	journal = {Lecture Notes in Computer Science},
	volume = {2568},
	year = {2003},
	pages = {281-290},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Symport and antiport are biological ways of transporting molecules through membranes in "collaborating" pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute only by using communication), then we introduce a novel way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations - multisets: no ordering - and the data structure of the output - strings: linear ordering). A similar remark holds true for the case of analysing P systems: the sequence of certain distinguished objects taken from the environment during a computation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/index/K2TM8T428CFT7FD0.pdf},
	author = {Mihai Ionescu and Carlos Mart{\'\i}n-Vide and Andrei Paun and Gheorghe Paun}
}
@article {,
	title = {On the Reachability Problem for P System with Porters},
	journal = {10th International Conference on Automata and Formal Languages},
	year = {2002},
	month = {August 13-18},
	pages = {1-3},
	address = {Debrecen, Hungr{\'\i}a},
	attachments = {http://www.gcn.us.es/biblio/themes/files/On the Reachability Problem for P systems with Porters.pdf},
	author = {Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Molecular Computation Models in ACL2: A Simulation of Lipton{\textquoteright}s SAT Experiment in the  Adleman{\textquoteright}s Restricted Model},
	journal = {Third International Workshop on the ACL2 Theorem Prover and its Applications},
	year = {2002},
	month = {April 8-9},
	pages = {175-187},
	address = {Grenoble, Francia},
	attachments = {http://www.gcn.us.es/biblio/themes/files/Molecular Computation Models in  ACL2.pdf},
	author = {Francisco J. Mart{\'\i}n-Mateos and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {307,
	title = {Formalizaci{\'o}n computacional del experimento de Lipton sobre el problema SAT},
	journal = {Primer Congreso Espa{\~n}ol de Algoritmos Evolutivos y Bioinspirados},
	year = {2002},
	month = {6-8/02/2002},
	pages = {326-332},
	address = {M{\'e}rida (Spain)},
	isbn = {84-607-3913-9},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini and Carmen Graciani-D{\'\i}az and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {187,
	title = {Solving Knapsack Problems in a Sticker Based Model },
	journal = {Lecture Notes in Computer Science},
	volume = {2340},
	year = {2002},
	month = {01/2002},
	pages = {161-171},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Our main goal in this paper is to give molecular solutions for two NP-complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/qcylexduk2m2pgtp/?p=2fd9a1af78134532a6ef254a6c313bb1\&pi=14},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {548,
	title = {Specification of Adleman{\textquoteright}s Restricted Model Using An Automated Reasoning System: Verification of Lipton{\textquoteright}s Experiment},
	journal = {Lecture Notes in Computer Science},
	volume = {2509},
	year = {2002},
	month = {01/2002},
	pages = {126-136},
	publisher = {Springer Berlin / Heidelberg},
	abstract = {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{\textquoteright}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 mecha nized analysis of unconventional model of computation in general. This approach opens up new possibilities of verifying molecular experiments before implementing them in a laboratory.},
	isbn = {0302-9743},
	doi = {10.1007/3-540-45833-6},
	url = {http://www.springerlink.com/content/hh5q5ruw9x28vdtn/?p=f8f56e08cfcc423f824fb537a05e8c00\&pi=10},
	author = {Carmen Graciani-D{\'\i}az and Francisco J. Mart{\'\i}n-Mateos and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {Computaci{\'o}n Celular con Membranas: Un Modelo no Convencional },
	year = {2002},
	pages = {II+107},
	publisher = {Editorial Kronos},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-86273-52-8},
	url = {http://www.cs.us.es/~marper/investigacion/librocelular1.html},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Computing by Communication in Networks of Membranes},
	journal = {International Journal of Foundations of Computer Science},
	volume = {13},
	year = {2002},
	pages = {779-798},
	publisher = {World Scientific},
	address = {London, U.K.},
	issn = {0129-0541},
	author = {Andrei Paun and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {,
	title = {A Formalization of Transition P Systems},
	journal = {Fundamenta Informaticae},
	volume = {49},
	year = {2002},
	pages = {261-272},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed with completely different techniques than in [1] and [2]. For this, we present a formal syntax and semantic of the transition P systems capturing the synchronized work of P systems, and the nondeterministic and maximally parallel manner in which the rules of these systems can be applied. 


},
	keywords = {Formal Verification, Natural computing, P system},
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1220112},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {190,
	title = {Generation of Diophantine Sets by Computing P Systems with External Output},
	journal = {Lecture Notes in Computer Science},
	volume = {2509},
	year = {2002},
	pages = {176-190},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every diophantine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diophantine set.},
	isbn = {978-3-540-44311-7},
	issn = {0302-9743},
	doi = {10.1007/3-540-45833-6_15},
	url = {http://dx.doi.org/10.1007/3-540-45833-6_15},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {,
	title = {A guide to membrane computing},
	journal = {Theoretical Computer Science},
	volume = {287},
	year = {2002},
	pages = {73 - 100   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Membrane systems are models of computation which are inspired by some basic features of biological membranes. In a membrane system multisets of objects are placed in the compartments defined by the membrane structure, and the objects evolve by means of "reaction rules" also associated with the compartments, and applied in a maximally parallel, nondeterministic manner. The objects can pass through membranes, the membranes can change their permeability, they can dissolve, and they can divide. These features are used in defining transitions between configurations of the system, and sequences of transitions are used to define computations. In the case of symbol-objects, we compute a set of numbers, and in the case of string-objects we compute a set of strings, hence a language. Many different classes of such computing devices (now called P systems) have already been investigated. Most of them are computationally universal, i.e., equal in power to Turing machines. Systems with an enhanced parallelism are able to trade space for time and solve in this way (at least in principle), by making use of an exponential space, intractable problems in a feasible time.The present paper presents the basic ideas of computing with membranes and some fundamental properties (mostly concerning the computational power and efficiency) of P systems of various types. 

},
	keywords = {chomsky hierarchy, Membrane computing, Natural computing, NP-complete problems, Turing computability},
	issn = {0304-3975},
	doi = {10.1016/S0304-3975(02)00136-6 },
	author = {Gheorghe Paun and Grzegorz Rozenberg}
}
@article {,
	title = {Membrane Computing. An Introduction},
	year = {2002},
	pages = {XI+419},
	publisher = {Springer-Verlag},
	address = {Berl{\'\i}n, Alemania},
	isbn = {3-540-43601-4},
	author = {Gheorghe Paun}
}
@article {,
	title = {Membrane Computing: New Results, New Problems},
	journal = {Bulletin of the European Association for Theoretical Computer Science},
	volume = {78},
	year = {2002},
	pages = {204-209},
	address = {Pa{\'\i}ses Bajos},
	issn = {0252-9742},
	author = {Carlos Mart{\'\i}n-Vide and Andrei Paun and Gheorghe Paun}
}
@article {,
	title = {Membrane Computing: The Power of (Rule) Creation},
	journal = {Journal of Universal Computer Science},
	volume = {8},
	year = {2002},
	pages = {369-381},
	address = {Granz Austria},
	abstract = {We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule may also produce rules, to be applied at subsequent steps. We find that this natural and simple feature is surprisingly powerful: systems with only one membrane can characterize the recursively enumerable languages, both in the case of rewriting and of splicing rules, the same result is obtained in the case of symbol-objects, for the recursively enumerable sets of vectors of natural numbers},
	keywords = {chomsky hierarchy, Membrane computing, molecular computing, rewriting, splicing},
	issn = {0948-6968},
	url = {http://www.jucs.org/jucs_8_3/membrane_computing_the_power},
	author = {Fernando Arroyo and Angel Baranda and Juan Castellanos and Gheorghe Paun}
}
@article {,
	title = {Membrane systems with carriers},
	journal = {Theoretical Computer Science},
	volume = {270},
	year = {2002},
	pages = {779-796},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {A membrane system is a model of computation which is inspired by some basic features of biological membranes. In this paper we consider another biologically inspired notion, viz., the notion of a carrier (or vehicle), as, e.g., used in gene cloning. We investigate the power of membrane systems where the rules for the evolving of objects are replaced by the rules that carry objects (by vehicles) through membranes. It turns out that these systems (even with a small number of membranes, a small number of carriers, and a small number of passengers taken by carriers) are computationally universal. 

},
	keywords = {Membrane computing, molecular computing, Natural computing, P systems, Turing computability},
	issn = {0304-3975 },
	doi = {10.1016/S0304-3975(01)00117-7},
	url = {http://portal.acm.org/citation.cfm?id=566256},
	author = {Carlos Mart{\'\i}n-Vide and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {,
	title = {Membrane Systems with Coupled Transport: Universality and Normal Forms},
	journal = {Fundamenta Informaticae},
	volume = {49},
	year = {2002},
	pages = {1 - 15   },
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {This paper continues research on membrane systems which function by communication only, meaning that there are no evolving rules for molecules. The whole computation process relies on passage of molecules through membranes -- this provides communication between regions of the membrane system. Next to transport of single molecules through membranes (uniport) we also study a coupled transport of molecules, with two molecules passing either in the same direction (symport) or in opposite directions (antiport). We study the computational power of such membrane systems and prove that using only symport one gets Turing universality. Moreover, we prove that five membranes suffice to get Turing universality, and the number of membranes can be decreased to three if forbidding context conditions for transport are used. },
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1220092.1220094},
	author = {Carlos Mart{\'\i}n-Vide and Andrei Paun and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {,
	title = {Membrane systems with promoters/inhibitors },
	journal = {Acta Informatica},
	volume = {38},
	year = {2002},
	pages = {695-720},
	publisher = {Springer Verlag},
	address = {Amsterdam, Netherlands},
	abstract = {The computational model of membrane computing (formalized through membrane systems, also called P systems) is based on the way that biological membranes define compartments, each having its set of molecules and (enzymes enhancing) reactions, with compartments communicating through the transport of molecules through membranes. In this paper we augment the basic model of membrane systems with promoters and inhibitors, which formalize the reaction enhancing and reaction prohibiting roles of various substances (molecules) present in cells. We formalize such membrane systems with promoters/inhibitors and investigate their basic properties. In particular we establish universality results, i.e., we provide characterizations of recursively enumerable sets (of vectors of natural numbers) using these systems. It turns out that systems with promoters/inhibitors achieve universal computations without using the standard {\textquotedblleft}auxiliary{\textquotedblright} features of membrane systems, for instance, without using catalysts. 
},
	issn = {0001-5903},
	doi = {10.1007/s00236-002-0090-7},
	url = {http://www.springerlink.com/index/LML8Y8CV3L7E0GD9.pdf},
	author = {Paolo Bottoni and Carlos Mart{\'\i}n-Vide and Gheorghe Paun and Grzegorz Rozenberg}
}
@article {308,
	title = {A Methodology for the Computer-Aided Cleaning of Complex Knowledge Databases},
	journal = {IECON{\textquoteright}02},
	year = {2002},
	address = {Sevilla, Espa{\~n}a},
	isbn = {0-7803-7474-6},
	author = {Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az and Antonia M. Ch{\'a}vez-Gonz{\'a}lez and Miguel A. Guti{\'e}rrez-Naranjo and Jorge D. Navarro-Mar{\'\i}n}
}
@article {192,
	title = {A New Class of Symbolic Abstract Neural Nets: Tissue P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {2387},
	year = {2002},
	pages = {290-299},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Starting from the way the inter-cellular communication takes place by means of protein channels and also from the standard knowledge about neuron functioning, we propose a computing model called a tissue P system, which processes symbols in a multiset rewriting sense, in a net of cells similar to a neural net. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses ("excitations") to the neighboring cells. Such cell nets are shown to be rather powerful: they can simulate a Turing machine even when using a small number of cells, each of them having a small number of states. Moreover, in the case when each cell works in the maximal manner and it can excite all the cells to which it can send impulses, then one can easily solve the Hamiltonian Path Problem in linear time. A new characterization of the Parikh images of ET0L languages are also obtained in this framework.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/index/5LPM4AKRYE01ND8B.pdf},
	author = {Carlos Mart{\'\i}n-Vide and Juan Pazos-Sierra and Gheorghe Paun and Alfonso Rodr{\'\i}guez-Pat{\'o}n}
}
@article {631,
	title = {A New Class of Symbolic Abstract Neural Nets: Tissue P Systems},
	journal = {COCOON {\textquoteright}02: Proceedings of the 8th Annual International Conference on Computing and Combinatorics},
	year = {2002},
	pages = {290-299},
	publisher = {Springer-Verlag},
	address = {London, UK},
	isbn = {3-540-43996-X},
	author = {Carlos Mart{\'\i}n-Vide and Juan Pazos-D{\'\i}az and Gheorghe Paun and Alfonso Rodr{\'\i}guez-Pat{\'o}n}
}
@article {,
	title = {On the Power of P Systems with Symport Rules},
	journal = {Journal of Universal Computer Science},
	volume = {8},
	year = {2002},
	pages = {317-331},
	address = {Granz, Austria},
	abstract = {A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals pass together in the same direction) and antiport rules (one chemical enters and the other exits a membrane), one obtains the computational completeness, and the question was formulated what happens when only symport rules are considered. We address here this question. First, we surprisingly find that "generalized" symport rules are sufficient: if more than two chemicals pass together through membranes, then we get again the power of Turing machines. Three results of this type are obtained, with a trade-off between the number of chemicals which move together (at least three in the best case) and the number of membranes used. The same result is obtained for standard symport rules (couples of chemicals), if the passing through membranes is conditioned by some permitting contexts (certain chemicals should be present in the membrane). In this case, four membranes suffice. The study of other variants of P systems with symport rules (for instance, with forbidding contexts) is formulated as an open problem. 
},
	keywords = {antiport, computational universality, Membrane computing, molecular computing, symport},
	issn = {0948-6968},
	url = {http://www.jucs.org/jucs_8_2/on_the_power_of},
	attachments = {http://www.gcn.us.es/biblio/themes/files/on the power of p systems with symport rules.pdf},
	author = {Carlos Mart{\'\i}n-Vide and Andrei Paun and Gheorghe Paun}
}
@article {,
	title = {On the Power of P systems with Valuation},
	journal = {Computaci{\'o}n y Sistemas. Revista Iberoamericana de Inteligencia Artificial},
	volume = {5},
	year = {2002},
	pages = {120-127},
	address = {Mexico Ciudad},
	issn = {0166-218X},
	author = {Carlos Mart{\'\i}n-Vide and Victor Mitrana and Gheorghe Paun}
}
@article {,
	title = {On the robustness of primitive words },
	journal = {Computaci{\'o}n y Sistemas. Revista Iberoamericana de Inteligencia Artificial},
	volume = {117},
	year = {2002},
	pages = {239-252},
	address = {Pa{\'\i}ses Bajos},
	abstract = {We investigate the effect on primitive words of point mutations (inserting or deleting symbols, substituting a symbol for another one), of morphisms, and of the operation of taking prefixes. Several ways of producing primitive words are obtained in this framework},
	keywords = {Deletion, Density, Insertion, Language, Morphism, Primitive, Word},
	issn = {0166-218X},
	doi = {10.1016/S0166-218X(00)00338-3},
	url = {http://www.ingentaconnect.com/content/els/0166218x/2002/00000117/00000001/art00338},
	author = {Gheorghe Paun and Nicolae Santean and Gabriel Thierrin and Sheng Yu}
}
@article {,
	title = {P systems on graphs of restricted forms},
	journal = {Publicationes Mathematicae Debrecen},
	volume = {60},
	year = {2002},
	pages = {635-660},
	address = {Debrecen, Hungr{\'\i}a},
	issn = {0033-3883},
	author = {Gheorghe Paun and Y. Sakakibara and Takashi Yokomori}
}
@article {,
	title = {P Systems with Symport/Antiport Rules: The Traces of Objects},
	journal = {Grammars},
	volume = {5},
	year = {2002},
	pages = {65-79},
	address = {Dordrecht, Holanda},
	abstract = {We continue here the study of those P systems where the computation is performed by the communication of objects, that is, systems with symport and antiport rules. Instead of the (number of) objects collected in a specified membrane, as the result of a computation we consider the itineraries of a certain object through membranes, during a halting computation, written as a coding of the string of labels of the visited membranes. The family of languages generated in this way is investigated with respect to its place in the Chomsky hierarchy. When the (symport and antiport) rules are applied in a conditional manner, promoted or inhibited by certain objects which should be present in the membrane where a rule is applied, then a characterization of recursively enumerable languages is obtained; the power of systems with the rules applied freely is only partially described.
},
	keywords = {chomsky hierarchy, Membrane computing, P system},
	issn = {1386-7393},
	doi = {10.1023/A:1016372801811},
	url = {http://www.springerlink.com/index/D0EDD350EQCLB92A.pdf},
	author = {Mihai Ionescu and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {,
	title = {The power of communication: P systems with symport/antiport},
	journal = {New Generation Computing},
	volume = {20},
	year = {2002},
	pages = {295 - 305   },
	address = {Tokyo, Jap{\'o}n},
	abstract = {In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (one say symport when two chemicals pass together through a membrane, in the same direction, and antiport when two chemicals pass simultaneously through a membrane, in opposite directions). Surprisingly enough, membrane systems without changing (evolving) the used objects and with the communication based on rules of this type are computationally complete, and this result is achieved even for pairs of communicated objects (as encountered in biology). Five membranes are used; the number of membranes is reduced to two if more than two chemicals may collaborate when passing through membranes. 


},
	keywords = {antiport, computational universality, Membrane computing, molecular computing, symport},
	issn = {0288-3635 },
	url = {http://portal.acm.org/citation.cfm?id=639009},
	author = {Gheorghe Paun and Andrei Paun}
}
@proceedings {,
	title = {Pre- Proceedings of Workshop on Membrane Computing (WMC-CDEA2002)},
	journal = {Workshop on Membrane Computing (WMC-CDEA 2002)},
	year = {2002},
	address = {Curtea de Arges, Rumania},
	author = {Gheorghe Paun and Claudio Zandron}
}
@article {191,
	title = {A Quasi-Metric for Machine Learning},
	journal = {Lecture Notes in Computer Science},
	volume = {2527},
	year = {2002},
	pages = {193-203},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The subsumption relation is crucial in the Machine Learning systems based on a clausal representation. In this paper we present a class of operators for Machine Learning based on clauses which is a characterization of the subsumption relation in the following sense: The clause C1 subsumes the clause C2 iff C1 can be reached from C2 by applying these operators. In the second part of the paper we give a formalization of the closeness among clauses based on these operators and an algorithm to compute it as well as a bound for a quick estimation.},
	isbn = {978-3-540-00131-7},
	issn = {0302-9743},
	doi = {10.1007/3-540-36131-6_20},
	url = {http://dx.doi.org/10.1007/3-540-36131-6_20},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az}
}
@article {,
	title = {Rewriting P Systems with Conditional Communication },
	journal = {Lecture Notes in Computer Science},
	volume = {2300},
	year = {2002},
	pages = {325-353},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {A membrane system (P system) is a model of computation inspired by some basic features of the structure and behaviour of living cells. In this paper we consider systems with string-objects processed by rewriting, with the communication controlled by conditions on the contents of the strings. Symbols, substrings (in an arbitrary place, or as a prefix/suffix), or the shape of the whole string are used as permitting and as forbidding conditions when moving strings from a membrane to a neighboring membrane. Many of the obtained variants lead to new characterizations of recursively enumerable languages (as expected, these characterizations indicate a trade-off between the number of membranes and the strength of the communication conditions used). Several open problems are also formulated.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/index/B69VXGXMY73WD34R.pdf},
	author = {Paolo Bottoni and Anna Labella and Carlos Mart{\'\i}n-Vide and Gheorghe Paun}
}
@article {120,
	title = {Simulating Turing Machines by P systems with External Output},
	journal = {Fundamenta Informaticae},
	volume = {49},
	year = {2002},
	pages = {273-287   },
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {In [3] a variant of the computation model introduced by Gh. Paun in [1] is considered: membrane systems with external output, which were proven to be universal, in the sense that they are able to generate all Parikh images of recursively enumerable languages. Here we give another proof of the universality of this model. The proof is carried out associating to each deterministic Turing machine a P system with external output that simulates its running. Thus, although we work with symbol-objects, we get strings as a result of computations, and in this way we generate directly all reeursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3]. 


},
	keywords = {Membrane computing, Natural computing, turing machines},
	issn = {0169-2968 },
	url = {http://iospress.metapress.com/content/8b4enyyt5pvnxmnr/?p=a68c6353270f4bf89d74cd6fbb9df5c2\&pi=20},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {222,
	title = {Teor{\'\i}a de la Complejidad en Modelos de Computaci{\'o}n Celular con Membranas},
	year = {2002},
	note = {Mario J. P{\'e}rez-Jim{\'e}nez; {\'A}lvaro Romero-Jim{\'e}nez; Fernando Sancho-Caparrini (coautores)},
	pages = {II+118 pages},
	publisher = {Editorial KRONOS},
	address = {Seville (Spain)},
	isbn = {84-86273-57-9},
	url = {http://www.cs.us.es/~marper/investigacion/librocelular2.html},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {,
	title = {Topics in the theory of DNA computing},
	journal = {Theoretical Computer Science},
	volume = {287},
	year = {2002},
	pages = {3 - 38   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools. 


},
	keywords = {biomolecular tool box, Boolean circuits, cryptography, DNA computing, DNA molecules, molecular computing, recursively enumerable languages, splicing systems, turing universality},
	issn = {0304-3975 },
	doi = {10.1016/S0304-3975(02)00134-2 },
	author = {Martyn Amos and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {,
	title = {Topics in the theory of DNA computing},
	journal = {Theoretical Computer Science},
	volume = {287},
	year = {2002},
	pages = {3 - 38   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools. 


},
	keywords = {biomolecular tool box, Boolean circuits, cryptography, DNA computing, DNA molecules, molecular computing, recursively enumerable languages, splicing systems, turing universality},
	issn = {0304-3975},
	doi = {10.1016/S0304-3975(02)00134-2 },
	url = {http://www.ingentaconnect.com/content/els/03043975/2002/00000287/00000001/art00134},
	author = {Martyn Amos and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa}
}
@article {304,
	title = {Towards a Practical Argumentative Reasoning with QSD},
	journal = {I Taller Iberoamericano sobre Deducci{\'o}n Autom{\'a}tica e Inteligencia Artificial},
	year = {2002},
	address = {Sevilla, Espa{\~n}a},
	author = {Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az and Antonia M. Ch{\'a}vez-Gonz{\'a}lez and Miguel A. Guti{\'e}rrez-Naranjo}
}
@article {,
	title = {Verifying a P system generating squares},
	journal = {Romanian Journal of Information Science and Technology},
	volume = {5},
	year = {2002},
	pages = {181-191},
	publisher = {EDITURA ACADEMIEI ROM{\^A}NE},
	address = {Bucure{\c s}ti, Rom{\^a}nia},
	keywords = {Formal Verification, Membrane computing, Natural computing},
	issn = {1453-8245},
	url = {http://www.cs.us.es/~marper/investigacion/resumen-cuadrados.pdf},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {852,
	title = {Initial segments maximal Σₙ-definable sets in fragments of arithmetic},
	journal = {Joint Conference of the 5th Barcelona Logic Meeting and the 6th Kurt G{\"o}del Colloquium},
	volume = {IV},
	year = {2001},
	month = {16-19/07/1999},
	pages = {37-38},
	publisher = {Kurt G ̈del Society},
	address = {Barcelona (Spain)},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
@article {665,
	title = { Vida Artificial: Estudio y An{\'a}lisis del Programa SWARM },
	year = {2001},
	pages = {104},
	isbn = {84-699-4449-5},
	author = {Justo Bl{\'a}zquez-Gallego and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {850,
	title = {Soluciones moleculares del problema SAT de la L{\'o}gica Proposicional},
	journal = {Primeras Jornadas sobre L{\'o}gica y Lenguaje},
	year = {2000},
	month = {29/11-1/12/2000},
	pages = {243-252},
	publisher = {Editorial KRONOS},
	address = {Seville (Spain)},
	isbn = {84-85101-57-X},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Carmen Graciani-D{\'\i}az and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {{\'A}ngel Nepomuceno and Jos{\'e} F. Quesada and Francisco J. Salguero}
}
@article {851,
	title = {Some Functional Schemes in Arithmetic},
	journal = {Logic Colloquium 2000},
	year = {2000},
	month = {23-31/07/2000},
	pages = {154},
	address = {Paris (France)},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {849,
	title = {NP-Completitud y Computaci{\'o}n ADN},
	journal = {Encuentro de Matem{\'a}ticos Andaluces},
	volume = {II},
	year = {2000},
	month = {13-17/11/2000},
	pages = {539-548},
	publisher = {Universidad de Sevilla. Secretariado de Publicaciones},
	address = {Seville (Spain)},
	isbn = {84-472-0290-9},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Emilio Briales-Morales and Alfonso Carriazo-Rubio and Tom{\'a}s Chac{\'o}n-Rebollo and Pedro  Real and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {630,
	title = {Computing with Membranes},
	journal = {Journal of Computer and System Sciences},
	volume = {61},
	year = {2000},
	pages = {108-143},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	issn = {0022-0000},
	doi = {http://dx.doi.org/10.1006/jcss.1999.1693},
	author = {Gheorghe Paun}
}
@article {853,
	title = {Descripciones funcionales de colecci{\'o}n y colecci{\'o}n fuerte en la aritm{\'e}tica},
	journal = {I Congreso Iberoamericano de Filosof{\'\i}a},
	year = {1998},
	month = {21-26/09/1998},
	address = {C{\'a}ceres - Madrid (Spain)},
	author = {Carmen Graciani-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
@article {629,
	title = {Computing with Membranes},
	journal = {Turku Centre for Computer Science},
	number = {208},
	year = {1998},
	month = {11/1998},
	publisher = {Turku Centre for Computer Science},
	address = {Turky, Finland},
	author = {Gheorghe Paun}
}
@article {666,
	title = { Curso Pr{\'a}ctico de Teor{\'\i}a de Conjuntos },
	year = {1998},
	pages = {XXV+345},
	publisher = {Ediciones La {\~N}},
	abstract = {Todos los que hemos impartido t{\'o}picos diversos relativos a la Teor{\'\i}a de Conjuntos, en primer o segundo ciclo universitario, hemos echado de menos, en mayor o menor medida, un texto en el que apareciera un amplio espectro de problemas resueltos estructurados de manera sistem{\'a}tica.

El Curso Pr{\'a}ctico de Teor{\'\i}a de Conjuntos que presentamos, trata de cubrir ese vac{\'\i}o bibliogr{\'a}fico y consideramos que puede ser de inter{\'e}s tanto para profesores como para alumnos universitarios que necesiten trabajar con elementos varios de la Teor{\'\i}a de Conjuntos ({\'o}rdenes, funciones, inducci{\'o}n, recursi{\'o}n, ordinales, finitud, numerabilidad, cardinales,...). Por tanto, puede ser un buen libro de consulta sobre estos temas, a niveles de primer y/o segundo ciclo universitario.

Los temas del curso est{\'a}n estructurados en tres partes: en la primera se presenta un breve resumen te{\'o}rico de los conceptos y resultados m{\'a}s importantes que se abordan; en la segunda parte se describen exhaustivamente soluciones de problemas relativos al contenido del mismo, y la {\'u}ltima se expone una lista de ejercicios propuestos (muchos de ellos con indicaciones clarificadoras). },
	isbn = {84-89524-45-9},
	author = {Jos{\'e} A. Alonso-Jim{\'e}nez and Joaqu{\'\i}n Borrego-D{\'\i}az and Mario J. P{\'e}rez-Jim{\'e}nez and Jos{\'e} L. Ruiz-Reina}
}
@article {,
	title = {Algunos Resultados y Problemas sobre Modelos de la Aritm{\'e}tica},
	journal = {Trabajos de L{\'o}gica y Computaci{\'o}n},
	number = {2},
	year = {1993},
	pages = {42},
	publisher = {Universidad de Sevilla},
	address = {Sevilla},
	author = {Alejandro Fern{\'a}ndez-Margarit and Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {667,
	title = {Esquemas del M{\'a}ximo en la Aritm{\'e}tica},
	year = {1992},
	pages = {9+2 microfilms},
	publisher = {Editorial de la Universidad de Sevilla},
	isbn = {84-472-0079-5},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
@article {668,
	title = {Teor{\'\i}a de Clases y Conjuntos},
	year = {1988},
	pages = {XVIII+582},
	publisher = {Editorial Edunsa},
	isbn = {84-7747-000-6},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez}
}
