<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Grzegorz Rozenberg</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bridging Membrane and Reaction Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Eleventh Brainstorming Week on Membrane Computing (11BWMC)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the Eleventh Brainstorming Week on Membrane Computing (11BWMC)</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/files/11bwmc/243_paun_perez_rozenberg.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Fénix Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Sevilla, España</style></pub-location><pages><style face="normal" font="default" size="100%">243-256</style></pages><isbn><style face="normal" font="default" size="100%">978-84-940691-9-2</style></isbn><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record></records></xml>