Algorithm of active rules elimination for application of evolution rules

Authors:
Jorge A. Tejedor;Luis Fernández;Fernando Arroyo;Abraham Gutiérrez
Affiliations:
Universidad Politécnica de Madrid, Natural Computing Group, Madrid, Spain;Universidad Politécnica de Madrid, Natural Computing Group, Madrid, Spain;Universidad Politécnica de Madrid, Natural Computing Group, Madrid, Spain;Universidad Politécnica de Madrid, Natural Computing Group, Madrid, Spain
Venue:
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Year:
2007

Citing 3
Cited 1

Membrane Computing: An Introduction

Membrane Computing: An Introduction
Hardware Implementation of a Bounded Algorithm for Application of Rules in a Transition P-System

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Design of a Hardware Architecture Based on Microcontrollers for the Implementation of Membrane Systems

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Optimizing evolution rules application and communication times in membrane systems implementation

WMC'07 Proceedings of the 8th international conference on Membrane computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new evolution rules application algorithm to a multiset of objects to use in the P system implementation in digital devices. In each step of this algorithm two main actions are carried out eliminating, at least, an evolution rule to the set of active rules. Therefore, the number of operations executed is limited and it can be known a priori which is its execution time at worst. This is very important as it allows for determination of the number of membranes to be located in each processor in the distributed implementation architectures of P systems to obtain optimal times with minimal resources. Although the algorithm is sequential, it reaches a certain degree of parallelism due to a rule that can be applied several times in a single step. In addition to this, this algorithm has shown in the experimental tests that the execution times is better than the ones previously published.