Time-free solution to SAT problem using P systems with active membranes

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.

Download Full-text

Time-free Solution to Independent Set Problem using P Systems with Active Membranes

Fundamenta Informaticae ◽

10.3233/fi-2021-2072 ◽

2021 ◽

Vol 182 (3) ◽

pp. 243-255

Author(s):

Yu Jin ◽

Bosheng Song ◽

Yanyan Li ◽

Ying Zhu

Keyword(s):

Membrane Computing ◽

Independent Set ◽

P Systems ◽

Natural Computing ◽

Free Solution ◽

Independent Set Problem ◽

Global Clock ◽

Active Membranes ◽

Biological Reality ◽

Hard Problems

Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of living cells. The computation models obtained in the field of membrane computing are usually called P systems. P systems have been used to solve computationally hard problems efficiently on the assumption that the execution of each rule is completed in exactly one time-unit (a global clock is assumed for timing and synchronizing the execution of rules). However, in biological reality, different biological processes take different times to be completed, which can also be influenced by many environmental factors. In this work, with this biological reality, we give a time-free solution to independent set problem using P systems with active membranes, which solve the problem independent of the execution time of the involved rules.

Download Full-text

An efficient time-free solution to SAT problem by P systems with proteins on membranes

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2016.03.008 ◽

2016 ◽

Vol 82 (6) ◽

pp. 1090-1099 ◽

Cited By ~ 14

Author(s):

Bosheng Song ◽

Mario J. Pérez-Jiménez ◽

Linqiang Pan

Keyword(s):

P Systems ◽

Free Solution ◽

Sat Problem

Download Full-text

Tissue P Systems with Cell Division

International Journal of Computers Communications & Control ◽

10.15837/ijccc.2008.3.2397 ◽

2008 ◽

Vol 3 (3) ◽

pp. 295 ◽

Cited By ~ 63

Author(s):

Gheorghe Păun ◽

Mario J. Perez-Jimenez ◽

Agustín Riscos-Nunez

Keyword(s):

Cell Division ◽

Polynomial Time ◽

Basic Feature ◽

P Systems ◽

Sat Problem ◽

Active Membranes ◽

Hard Problems

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.

Download Full-text