Solving SAT and Hamiltonian Cycle Problem Using Asynchronous P Systems

In the present paper, we consider fully asynchronous parallelism in membrane computing, and propose two asynchronous P systems for the satisfiability (SAT) and Hamiltonian cycle problem. We first propose an asynchronous P system that solves SAT with n variables and m clauses, and show that the proposed P system computes SAT in O(mn2n) sequential steps or O(mn) parallel steps using O(mn) kinds of objects. We next propose an asynchronous P system that solves the Hamiltonian cycle problem with n nodes, and show that the proposed P system computes the problem in O(n!) sequential steps or O(n2) parallel steps using O(n2) kinds of objects.

[1]  Rudolf Freund,et al.  Sequential P Systems with Unit Rules and Energy Assigned to Membranes , 2004, MCU.

[2]  Artiom Alhazov,et al.  Solving HPP and SAT by P Systems with Active Membranes and Separation Rules , 2006, Acta Informatica.

[3]  Gheorghe Păun,et al.  Chapter 1 Introduction to Membrane Computing , 2006 .

[4]  Vincenzo Manca.  DNA and Membrane Algorithms for SAT , 2002, Fundam. Informaticae.

[5]  Mario J. Pérez-Jiménez,et al.  A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes , 2003, Workshop on Membrane Computing.

[6]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[7]  Oscar H. Ibarra,et al.  On one-membrane P systems operating in sequential mode , 2005, Int. J. Found. Comput. Sci..

[8]  Mario J. Pérez-Jiménez,et al.  A fast P system for finding a balanced 2-partition , 2005, Soft Comput..

[9]  Mario J. Pérez-Jiménez,et al.  A uniform solution to SAT using membrane creation , 2007, Theor. Comput. Sci..

[10]  Mario J. Pérez-Jiménez,et al.  A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[11]  Mario J. Pérez-Jiménez,et al.  Solving the Subset-Sum problem by P systems with active membranes , 2009, New Generation Computing.

[12]  Giancarlo Mauri,et al.  Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.

[13]  Gheorghe Paun,et al.  Introduction to Membrane Computing , 2006, Applications of Membrane Computing.

[14]  Agustín Riscos Núñez,et al.  Solving the Subset-Sum problem by P systems with active membranes , 2005 .

[15]  Mario de Jesús Pérez Jiménez,et al.  Solving the BINPACKING Problem by Recognizer P Systems with Active Membranes , 2004 .

[16]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[17]  Gabriel Ciobanu,et al.  P systems with minimal parallelism , 2007, Theor. Comput. Sci..