Looking for a cheaper ROSA

Authors:
Fernando L. Pelayo;Fernando Cuartero;Diego Cazorla
Affiliations:
Departamento de Sistemas Informáticos, Escuela Superior de Ingenieria Informática, Universidad de Castilla-La Mancha, Albacete, Spain;Departamento de Sistemas Informáticos, Escuela Superior de Ingenieria Informática, Universidad de Castilla-La Mancha, Albacete, Spain;Departamento de Sistemas Informáticos, Escuela Superior de Ingenieria Informática, Universidad de Castilla-La Mancha, Albacete, Spain
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Year:
2011

Citing 5
Cited 0

A complete proof system for timed observations

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Exploring Very Large State Spaces Using Genetic Algorithms

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Generating the syntactic and semantics graphs for a Markovian process algebra

Journal of Computational and Applied Mathematics
Denotational semantics for programming languages, balanced quasi-metrics and fixed points

International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

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 possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-complete task, so that, the reaching of a particular 'desired' state is a problem which deserves some heuristic for improving the amount of resources to be carried out. In this line, Artificial Intelligence by means of Genetic Algorithms (GA's), provides metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space, as it is the exploration of a LTS. In this paper, we try to avoid this problem, so only unfolding the most promising (for the task of reaching a 'goal' state) branches within the LTS.