Results

**1 - 1**of**1**### IOS Press A Quasi- Genetic Process Algebra

"... Abstract. Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and where all the possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-hard task, so ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and where all the possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-hard task, so that, the reaching of a particular ‘desired ’ state is a problem which deserves some heuristic for improving the amount resources to be carried out. Let’s take a look to Artificial Intelligence: Genetic Algorithms, GA’s are metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space. GA’s [21, 11] have been widely used to solve problems in the fields of combinatorial and numerical optimization. Due to their stochastic nature, their behaviour when dealing with some problems is difficult to predict. However, there have been many attempts to develop models related with some of their features. Thus, in their origin, Holland developed the Schemata Theory[21] which tried to demonstrate their functioning by assuming that those configurations of variables, schematas, which contribute to build a good solution, tend to spread through the population as generations pass. Later on, many other attempts have been carried out in order to model some features of these algorithms. Thus, statistical models to predict population sizing or time to convergence have been