7 research outputs found
Decision Trees for Applicability of Evolution Rules in Transition P Systems
Transition P Systems 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 that are
determined by the membrane structure and multisets present inside membranes. Moreover, transitions between
two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of active
evolution rules subset inside each membrane of the P system. But, to establish the active evolution rules subset,
it is required the previous calculation of useful and applicable rules. Hence, computation of applicable evolution
rules subset is critical for the whole evolution process efficiency, because it is performed in parallel inside each
membrane in every evolution step. The work presented here shows advantages of incorporating decision trees in
the evolution rules applicability algorithm. In order to it, necessary formalizations will be presented to consider this
as a classification problem, the method to obtain the necessary decision tree automatically generated and the
new algorithm for applicability based on it
Researching Framework for Simulating/Implementating P Systems
Researching simulation/implementation of membranes systems is very recent. Present literature
gathers new publications frequently about software/hardware, data structures and algorithms for implementing P
system evolution.
In this context, this work presents a framework which goal is to make tasks of researchers of this field easier.
Hence, it establishes the set of cooperating classes that form a reusable and flexible design for the customizable
evaluation with new data structures and algorithms. Moreover, it includes customizable services for correcting,
monitoring and logging the evolution and edition, recovering, automatic generating, persistence and visualizing P
systems
HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system
P systems or Membrane Computing are a type of a distributed, massively parallel and non
deterministic system based on biological membranes. They are inspired in the way cells process chemical
compounds, energy and information. These systems perform a computation through transition between two
consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of
multisets present at any moment in the existing m regions of the system at that moment time. Transitions
between two configurations are performed by using evolution rules which are in each region of the system in a
non-deterministic maximally parallel manner.
This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves
as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic
system in several stages, each of them with concrete matters.
In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the
active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is
presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is
smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of
steps and, therefore, the end of the process will be reached in a shorter length of time
Contradiction versus Selfcontradiction in Fuzzy Logic
* This work is partially supported by CICYT (Spain) under project TIN 2005-08943-C02-001 and by UPM-CAM (Spain) under project R05/11240.Trillas et al. introduced in [7] and [8] the concepts of both self-contradictory fuzzy set and contradiction
between two fuzzy sets. Later, in [1] and [2] the necessity of determine not only the contradiction, but also the
degree in that this property occurs, was considered. This paper takes up again these subjects, and firstly we
study if there exists some connection between the two first notions. After that, taking into account that self-
contradiction of a fuzzy set could be understood as the contradiction with itself, and starting from the degrees of
contradiction between two fuzzy sets proposed in [5], we obtain degrees of self-contradiction. Finally,
preservation of some intuitive properties both in the use of connectives and in the obtaining of new knowledge
throughout compositional rule of inference, are tested
Fast Linear Algorithm for Active Rules Application in Transition P Systems
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
Solving complex problems with a bioinspired model
Membrane systems are parallel and bioinspired systems which simulate membranes behavior when processing information. As a part of unconventional computing, P-systems are proven to be effective in solvingcomplexproblems.
A software technique is presented here that obtain good results when dealing with such problems. The rules application phase is studied and updated accordingly to obtain the desired results. Certain rules are candidate to be eliminated which can make the model improving in terms of time
New Algorithms for Application of Evolution Rules based on Applicability Benchmarks
Abstract- 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 consecutives 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. The work presented here includes definitions of maximal and minimum applicability benchmarks of an evolution rule over a determined multiset of objects. These two definitions permit the design of new algorithms that improve complexity of traditional step by step one. This is achieved through new parallelism degree for the application of evolution rules