Membrane Computing and Its Applications

International Journal of Applied Information Systems, 2013

Membrane Computing (MC) (or P System theory) is a recent area of Natural Computing, the field of computer science that deals with computational techniques is inspired by the structure and functioning of living cells. P systems are massively parallel and distributed model of computation. Membrane Computing investigates models of computation inspired by the structure and functions of biological cells. There are some simulations models that have been developed but do not usually allow parallelism. Turing Machine (TM) and membrane computing are computation models; one of the main differences between them is the behavior of each other, since TM is algorithmic behavior while on the other hand Transition P Systems are Interactive computing behavior. This research investigates a Turing machine model of a special class of P system under a condition which is the rules are applied in a predefined order (which is applying rules priority). From this point of view, the P Systems could assume the same behavior of Turing machine in its sequential behavior. A single membrane can be considered as a machine (membrane devices) in the membrane structure of transition P Systems; hence the whole system of membrane structure consists of several machines that interact with each other. The interaction can be in the form of data passing. The aim of this research is designing a TM to simulate the behavior of a Transition P System. Also the research will show how Turing Machine can be partitioned into sub machines as well as the design of membrane machines can be partitioned into sub machines or sub modules.

Computing Research Repository, 2010

Inspired by the emergent membrane computing (P Systems) concepts, some efforts are carried out introducing simulation models, some are software oriented, and others are hardware, yet all are applied with the current vision of the conventional computers, based on "Von Neumann architecture", which is a sequential design in its essence. We think that these models will need -as a consequent result-to a new architecture exposing a true parallel design, in this paper; we try to investigate and introduce a global view for how it would be like to have such architecture. The main goal is to point out to this direction broadly, suggesting that it might be useful considering some aspects, like the need for a new definition of an operating system and its programs, which will eventually lead to a higher scope: the membrane computer.

J. Univers. Comput. Sci., 1999

We continue the investigation of the power of the computability models introduced in [Gh. Paun, Computing with membranes, TUCS Report 208, November 1998] under the name of transition super-cell systems. We compare these systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (we take the Parikh image of the usual language generated by these mechanisms rather than the language). Several open problems are also formulated.

We consider P systems with symbol-objects and string-objects. We examine their power and capacity to generate computably enumerable languages. In the former case, we conclude that the non-cooperative systems are not as powerful as the cooperative ones, and in particular we prove that catalytic systems with priorities and of degree two are equivalent to Turing machines. For string-object systems two membranes and priorities suffice for simulating Turing machines, as well. We also mention to an important result for splicing systems of diameter (1, 2, 2, 1), as well as the cases of contextual and insertion-deletion systems.

2011

What follows is a list of open problems and research topics compiled by the two editors of this “mega-paper”, with the authors who contributed to this list mentioned together with their problems and research topics. The idea of such a collection occurred during CMC 2011, held in Fontainebleau, Paris, France (23 26 August 2011), and the result is meant to be a working material for the Tenth Brainstorming Week on Membrane Computing, Sevilla, Spain (January 30 February 3, 2012).

International Journal of Foundations of Computer Science, 2013

This paper discusses research frontiers of membrane computing by presenting current open problems and research topics, together with the relevant background and motivation.

Fundamenta Informaticae, 2000

In this note we introduce the notion of a membrane computing schema for string objects. We propose a computing schema for a membrane network (i.e., tissue-like membrane system) where each membrane performs unique type of operations at a time and sends the result to others connected through the channel. The distinguished features of the computing models obtained from the schema are: 1. only context-free insertion operations are used for string generation, 2. some membranes assume filtering functions for structured objects(molecules), 3. the generating model and accepting model are obtained in the same schema, and both are computationally universal, 4. several known rewriting systems with universal computability can be reformulated in terms of membrane computing schema in a uniform manner. The first feature provides the model with a simple uniform structure which facilitates a biological implementation of the model, while the second feature suggests further feasibility of the model in terms of DNA complementarity. Through the third and fourth features, one may have a unified view of a variety of existing rewriting systems with Turing computability in the framework of membrane computing paradigm.

Lecture Notes in Computer Science, 2006

Fundamenta Informaticae, 2002