Cart (Loading....) | Create Account
Close category search window
 

Algorithm for Application of Evolution Rules Based on Linear Diofantic Equations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Arteta, A. ; Natural Comput. Group, Univ. Politec. de Madrid, Madrid, Spain ; Fernandez, L. ; Gil, J.

Transition P system are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P systems evolve through transitions between two consecutive configurations. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of evolution rules inside each membrane of the P system. Hence, rules application is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in each one of the evolution steps. It is known that P systems have a high degree of nondeterminism and parallelism. A transition in such a system consists in applying in parallel a set of atomic actions (e.g., evolution rules) and this set of atomic actions is randomly chosen from a domain of possible next transitions. This paper tries to characterize this domain as the hyperspace defined by a set of diophantine equations and then to develop an algorithm which randomly chooses solutions from this hyperspace. Those solutions are uniquely related to the number of times that certain evolution rules are applied. The work presented here includes an algorithm based on resolving linear systems equations and explain into detail the process that the algorithm must follow.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on

Date of Conference:

26-29 Sept. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.