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 …

Membrane computing provides computational devices inspired by living cells (called
membrane systems) that are proved to be computationally universal. It is a theoretical …

We consider synchronized membrane systems extended with communication and division
rules, using the maximal parallelism evolution strategy together with synchronization …

P systems with anti-membranes represent a variant of P systems with anti-matter in which
the concept of annihilation between a matter object and its corresponding anti-matter object …

We study the efficiency of the reaction systems in solving NP-complete problems. Due to the
fact that standard reaction systems are qualitative, in order to accomplish our aim, in this …

Recently we have considered the possibility of using bio-inspired mobility for solving a weak
NP-complete problem (Partition). In this paper we provide a semi-uniform polynomial …

In membrane systems evolution rules are constructed using only objects from a finite
alphabet. In this paper we investigate rules in which variables are used. Namely, we define …

In this paper we introduce a membrane system named adaptive P system which is able to
adjust dynamically its behaviour depending on resource availability. Such a system is …

Mobile membranes represent a model of computation inspired from the biological movement
provided by endocytosis and exocytosis in the living cells. This paper presents a survey of …

Mobile membranes represent a variant of membrane systems in which the main operations
are inspired by the biological operations of endocytosis and exocytosis. We study the …