Natural Computing Membrane Computing Transition P System Rules Application Algorithms
Institute of Information Theories and Applications FOI ITHEA
Transition P systems are computational models based on basic features of biological membranes and
the observation of biochemical processes. In these models, membrane contains objects multisets, which evolve
according to given evolution rules. In the field of Transition P systems implementation, it has been detected the
necessity to determine whichever time are going to take active evolution rules application in membranes. In
addition, to have time estimations of rules application makes possible to take important decisions related to the
hardware / software architectures design.
In this paper we propose a new evolution rules application algorithm oriented towards the implementation of
Transition P systems. The developed algorithm is sequential and, it has a linear order complexity in the number of
evolution rules. Moreover, it obtains the smaller execution times, compared with the preceding algorithms.
Therefore the algorithm is very appropriate for the implementation of Transition P systems in sequential devices.