Membrane Computing and Its Applications
Kriti Bhargava1, Nisheeth Saxena2
1Kriti Bhargava, Department of Computer Science & Engineering, Faculty of Engineering & Technology, Mody University of Science and Technology, Lakshmangarh, Sikar, Rajasthan, India.
2Nisheeth Saxena, Department of Computer Science & Engineering, Faculty of Engineering & Technology, Mody University of Science and Technology, Lakshmangarh, Sikar, Rajasthan, India.
Manuscript received on April 01, 2014. | Revised Manuscript Received on April 20, 2014. | Manuscript published on April 20, 2014. | PP: 17-22 | Volume-2, Issue-5, April 2014. | Retrieval Number: E0456042514/2014©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: There are two types of computing; one is conventional and another is unconventional. Turing machine is a hypothetical device and a conventional model, model of computation; it is not a random access machine, so to simulate current day’s basis systems; in a exact manner register machine had been defined, so they are conventional model of computing. Paradigms like DNA computing, Quantum computing, Membrane Computing, they are model of unconventional computing. These have comes an existence in their resent times and we have found a certain problems can tackle in a very efficient manner using this. The practical use of this is still a question and it’s being exploded. Membrane computing which biologically inspired and mathematically motivated. Membrane structure is an essential ingredient of a membrane computing, having hierarchical arrangement of membranes, like a cell or tree. This mainly deals with distributed and parallel computing models. Parallelism is restricted in classical computers bounded by ‘n’ (16/64) number of processors. But when size of problems increases, then the number of processors can’t increases. Unbounded parallelism is exists in DNA, Membrane computing. Because of unbounded parallelism, you can have DNA strands and they can exist within one cubic centimeter of a solution; millions of DNA strands can exists. Because of that the action state place parallel and you can have a number of operations performed simultaneously. The basic features are evolution rules and evolving objects encapsulated in compartments of membranes. These evolution rules are applied on multisets. It is a framework to reflecting a limb of a system model. Inspiration of membrane computing is the process which takes place in a cell, the reaction which develops in cell region. The processing of substances, energy and information in these regions, through the membranes which delimit them are computational processes. We try to simulate these processes and see that anything we can define in a formal manner using this model of computation. In this paper, briefly discuss about membrane computing applications like global clock, L system, solving optimization problems, solving SAT, HPP etc.
Keywords: Membrane Computing, P system, HPP, SAT, L system.