An Asynchronous P System for MAX-SAT

Membrane computing, which is a computational model based on cell activity, has considerable attention as one of new paradigms of computations. In the membrane computing, the asynchronous parallelism must be considered to make the membrane computing more realistic. We propose an asynchronous P system that solves the maximum satisfiability problem (MAX-SAT) with n variables and m clauses. The proposed P system computes MAX-SAT in O(mn2ⁿ) sequential steps or O(mn) parallel steps using O(mn) kind of objects and evolution rules of size O(m²n).