Abstract: P systems or Membrane Computing are a type of a distributed, massively parallel and non
deterministic system based on biological membranes. They are inspired in the way cells process chemical
compounds, energy and information. These systems perform a computation through transition between two
consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of
multisets present at any moment in the existing m regions of the system at that moment time. Transitions
between two configurations are performed by using evolution rules which are in each region of the system in a
non-deterministic maximally parallel manner.
This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves
as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic
system in several stages, each of them with concrete matters.
In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the
active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is
presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is
smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of
steps and, therefore, the end of the process will be reached in a shorter length of time.

Keywords: Membrane Computing, Evolution Rules, Circuit design, Digital systems, Transition P System.

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

HW IMPLEMENTATION OF A OPTIMIZED ALGORITHM FOR THE APPLICATION OF ACTIVE RULES IN A TRANSITION P-SYSTEM

Victor Martinez, Luis Fernandez, Fernando Arroyo, Abraham Gutierrez

http://www.foibg.com/ijita/vol14/ijita14-4-p04.pdf