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 define tissue P systems with costs assigning execution costs to the synapses that are
used to transport the objects between cells. We use the Priced-Timed Maude rewriting …

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 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 …

Mutual mobile membrane systems represent a variant of mobile membrane systems in
which endocytosis and exocytosis work whenever the involved membranes “agree” on the …

Membrane computing is a computational framework that depends on the behavior and
structure of living cells. P systems are arising from the biological processes which occur in …