@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 {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 {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 {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 {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}
}
