@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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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/q=node/sites/all/modules/views/files/gallerix/albums/17/724/files/24SNP_Matrix2b.pdf},
	author = {XiangXiang Zeng and Henry Adorna and Miguel A. Mart{\'\i}nez-del-Amor and Linqiang Pan}
}
@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 {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 {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 {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 {,
	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/q=node/sites/all/modules/views/files/gallerix/albums/17/724/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}
}
@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 {,
	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/q=node/sites/all/modules/views/files/gallerix/albums/17/724/files/Trading polarizations for Labels....pdf},
	author = {Artiom Alhazov and Linqiang Pan and Gheorghe Paun}
}
