This paper continues the investigation of population P systems model [F. Bernardini, M. Gheorghe, Population P systems, Journal of Universal Computer Science 10 (5) (2004) 509–539] by considering bacterium quorum sensing (QS) phenomena as the basis of the new approach. A new computational model called QS P system is introduced. It is proved that QS P systems are able to simulate counter machine...

We propose here a (biologically inspired) model of P system called proton pumping P system that is a special case of evolution– communication P system. In cell biology there are transport mechanisms, involving protons. We generalize this idea by considering a few different types of protons. A proton pumping P system is, essentially, an evolution–communication P system where a special subset of ...

In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorte...

Stochastic simulations based on the tau leaping method are applicable to well stirred chemical reaction systems occurring inside a single fixed volume. In this paper we propose a novel method, based on the tau leaping procedure, for the simulation of complex systems composed by several communicating regions. The new method is here applied to dynamical probabilistic P systems, which are characte...

Some elementary rigorous remark about the replica formalism in the Statistical Physics' approach to threshold phenomena in Computational Complexity Theory is presented.

In the last decade, there have been many papers dealing with second-order multivalued boundary value problems. We mention the works of Erbe and Krawcewicz [5, 6], Frigon [7, 8], Halidias and Papageorgiou [9], Kandilakis and Papageorgiou [11], Kyritsi et al. [12], Palmucci and Papalini [17], and Pruszko [19]. In all the above works, with the exception of Kyritsi et al. [12], p = 2 (linear differ...

In this work we propose a variant of P systems based on the Central Dogma of Molecular Biology which establishes the transformation of DNA strands into protein products by applying different string transformation such as transductions and transcriptions. We introduce a new kind of worm object rules to carry out transducion operations. Finally, we establish the universality of the proposed model...

Until now, the usual variants of P systems have only a finite number of options in every step of their computations (that is, an associated computation tree is defined for them). In this way, irrespectively whether they are non-deterministic or probabilistic P systems, we obtain a discrete space of computations where the system evolves. Here we present a variant of P systems which in every step...

In this paper we define and study Scenario Based P Systems, a model of computation inspired by the metabolic pathways and networks. Starting from the classical definition of P systems with symbol objects and multiset rewriting rules, we define regular expressions able to capture the causal dependencies among different executions of the rules. The results show the computational power of this model.