Abstract: In the field of Transition P systems implementation, it has been determined that it is very important to determine in advance how long takes evolution rules application in membranes. Moreover, to have time estimations of rules application in membranes makes possible to take important decisions related to hardware / software architectures design. The work presented here introduces an algorithm for applying active evolution rules in Transition P systems, which is based on active rules elimination. The algorithm complies the requisites of being nondeterministic, massively parallel, and what is more important, it is time delimited because it is only dependant on the number of membrane evolution rules.

Keywords: Natural computing, Membrane computing, Transition P systems, rules application algorithms

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

Link:

DELIMITED MASSIVELY PARALLEL ALGORITHM BASED ON RULES ELIMINATION FOR APPLICATION OF ACTIVE RULES IN TRANSITION P SYSTEMS

Francisco Javier Gil, Luis Fernández, Fernando Arroyo, Jorge Tejedor

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p11.pdf