Abstract: Transition P systems are a computational model based on the basic features of biological membranes and in the observation of biochemical processes. In this model, a membrane contains object multisets, which evolve following a determine set of evolution rules. The system changes from an initial configuration to another one performing a computation by applying these rules in a non-deterministic maximally parallel way. Previous works about the rule application algorithms follow a common pattern: to choose a rule applicable on the objects multiset, and to apply that rule a number of times. This pattern is repeated until there is no applicable rule. In this paper, we present an algorithm that proposes a new approach that consists of the following steps: (i) To analyze the antecedent rules to establish the applicability domains; (ii) to select some applicable rules depending on the objects multiset available inside the membrane. Unlike previous algorithms, this new approach always selects an applicable rule in each iteration, avoiding iterations with non-applicable rules. In addition, this is a bounded algorithm, which is a necessary condition that facilitates decision-making in membrane architecture design.

Keywords: Natural Computing, Membrane computing, Transition P System, Rules Application Algorithms.

ACM Classification Keywords: D. Software. D.1 Programming Techniques

Link:

A BOUNDED ALGORITHM BASED ON APPLICABILITY DOMAINS FOR THE APPLICATION OF ACTIVE RULES IN TRANSITION P-SYSTEMS

F. Javier Gil, Jorge A. Tejedor, Luis Fernández

http://foibg.com/ibs_isc/ibs-18/ibs-18-p04.pdf