An efficient time-free solution to QSAT problem using P systems with proteins on membranes
P systems are a class of distributed parallel computing devices inspired by some basicbehaviors of biological membranes, which have the restriction that each rule is executedin exactly one time unit. However, it is natural to consider the systems without the timerestriction on each rule since bioche...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107935 |
| Acceso en línea: | https://hdl.handle.net/11441/107935 https://doi.org/10.1016/j.ic.2017.06.005 |
| Access Level: | acceso abierto |
| Palabra clave: | Bio-inspired computing Membrane Computing P System Time-free solution QSAT problem |
| Sumario: | P systems are a class of distributed parallel computing devices inspired by some basicbehaviors of biological membranes, which have the restriction that each rule is executedin exactly one time unit. However, it is natural to consider the systems without the timerestriction on each rule since biochemical reactions in biological systems are inherentlyparallel and have different reaction rates, and the execution time of biochemical reactionsis unpredictably sensitive to environmental factors. In this work, we construct a family ofPsystems with proteins on membranes and membrane division that are “robust” againstthe execution time of rules. Specifically, we present a time-free uniform solution to theQSATproblem by using Psystems with proteins on membranes and membrane division inthe sense that the execution time of the involved rules has no influence on the correctnessof the solution. |
|---|