Mutual mobile membranes with objects on surface

Triangle

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.

International Journal of Computer Mathematics, 2013

This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition of new variants of P systems with a dynamic structure and for the comparison of existing definitions as well as for their extension. We give a detailed definition of the formalism and we present some examples of how to translate several existing variants of P systems with a dynamic structure.

Information Sciences

The main contribution of this paper is the introduction of the new concept of membrane controller based on the structure and functioning of a deterministic numerical P system. The procedure for developing a membrane controller and for using it to control a mobile robot is explained and several test cases are given in which membrane controllers are used to control both simulated and real mobile robots and to generate various desired behaviours (obstacle avoidance, wall following, and follow the leader). The experiments reported in this paper validate the concept and prove that the performance of a membrane controller is comparable to or better than that of other controllers (such as fuzzy logic controllers).

Computer, 2003

A membrane system is a model of computation which is inspired by some basic features of biological membranes. In this paper we consider another biologically inspired notion, viz., the notion of a carrier (or vehicle), as, e.g., used in gene cloning. We investigate the power of membrane systems where the rules for the evolving of objects are replaced by the rules that carry objects (by vehicles) through membranes. It turns out that these systems (even with a small number of membranes, a small number of carriers, and a small number of passengers taken by carriers) are computationally universal.

… Process Calculi and of the First …, 2010

Formal modelling of Multi-Agent Systems (MAS) is a challenging task due to high complexity, interaction, parallelism and continuous change of roles and organisation between agents. In this paper we record our research experience on formal modelling of MAS. We review our research throughout the last decade, by describing the problems we have encountered and the decisions we have made towards resolving them and providing solutions. Much of this work involved membrane computing and classes of P Systems, such as Tissue and Population P Systems, targeted to the modelling of MAS whose dynamic structure is a prominent characteristic. More particularly, social insects (such as colonies of ants, bees, etc.), biology inspired swarms and systems with emergent behaviour are indicative examples for which we developed formal MAS models. Here, we aim to review our work and disseminate our findings to fellow researchers who might face similar challenges and, furthermore, to discuss important issues for advancing research on the application of membrane computing in MAS modelling.

In this paper we define a general P system covering some biological operations with membranes, including evolution, communication, modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving SAT.

2011

We modify the most used evolution strategy in membrane systems (namely that of maximal parallelism) by imposing a synchronization between rules. A synchronization over a set of rules can be applied only if each rule of the set can be applied at least once. For membrane systems working in the accepting mode, this synchronization is powerful enough to provide the computational completeness without any other ingredient (no catalysts, promoters, inhibitors, etc). The modeling power of synchronization is described by simulating the basic arithmetic operations (addition, subtraction, multiplication and division). Keywords Membrane computing • Synchronization of the rules • Computational completeness • Arithmetic operations This work was presented at 20th Conference on Membrane Computing (CMC20)

Electronic Notes in Theoretical Computer Science, 2009

We use a modal logic in order to show that the strategy-based rewrite semantics for membrane systems fully preserves the maximal concurrency of evolution rules actions, whereas the maximal concurrency of communication actions and structural actions is partially preserved. Consequently, the strategy-based rewrite semantics describes more faithfully the behavior of the membrane systems than the rewrite logic-based semantics. It is known that the rewrite logic-based semantics implements the maximal concurrency of the evolution rules in membrane systems only by interleaving concurrency. The concurrency degrees of the communication and structural actions are the same for the two rewrite-based semantics.

Theoretical Computer Science, 2012

We examine, from the point of view of membrane computing, the two basic assumptions of reaction systems, the "threshold" and "no permanence" ones. In certain circumstances (e.g., defining the successful computations by local halting), the second assumption can be incorporated in a transition P system or in a symport/antiport P system without losing the universality. The case of the first postulate remains open: the reaction systems deal, deterministically, with finite sets of symbols, which is not of much interest for computing; three ways to introduce nondeterminism are suggested and left as research topics.

Nano Communication Networks, 2015

We use membrane systems to define a formalism inspired by cell biology in which mobility and timing are explicitly specified. In order to reason about the behaviours of complex biological systems, we introduce several observational equivalences over mobile membranes with lifetimes. These equivalences based on observations correspond to several combinations of mobility operations that can be performed, timing aspects of the objects involved in mobility and their explicit positions inside membranes. Various relationships between these observational equivalences are proved. Moreover, we use the ambient logic to provide a logical characterization for located observational equivalence.