A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules

In the framework of membrane computing, several interesting results concerning frontiers of efficiency between the complexity classes P and NP have been found by using different ingredients. One of the main characteristics of cell-like membrane systems is their rooted tree-like structure, where a natural parent-children membrane relationship exists, and objects can travel through the membranes. Separation rules are used as a method to obtain an exponential workspace in terms of membranes in polynomial time. Inspired by cell meiosis, objects from the original membrane are distributed between the two new membranes. In this work, P systems with evolutional symport/antiport rules and separation rules are used to give a solution to SAT, a well known NP-complete problem. One of the advantages of this solution is the use of the environment as a passive agent.