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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bloom, B.: Ready Simulation, Bisimulation, and the Semantics of CCS-like Languages. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (1989)
Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebriac Theory of Probabilistic and Nondeterministic Processes. Journal of Logic and Algebraic Programming 55(1-2), 57–103 (2003)
Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5, 1–20 (1993)
Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading (1989)
Holland, J.H.: Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975)
Ortega-Mallén, Y., de Frutos-Escrig, D.: A complete proof system for timed observations. In: TAPSOFT 1991, vol. 1, pp. 412–440 (1991)
Pelayo, F.L., Cuartero, F., Ossa, L., Pelayo, M.L., Guirao, J.L.G.: Towards the evolutionary process algebra. In: 8th IEEE Int. Conf. on Cognitive Informatics, pp. 69–76. IEEE Computer Society Press, Los Alamitos (2009)
Pelayo, F.L., Cuartero, F., Valero, V., Cazorla, D.: Analysis of the MPEG-2 encoding algorithm with ROSA. Electronic Notes on Theoretical Computer Science 80(1), 185–202 (2003), http://www.elsevier.nl/locate/entcs/volume80.html
Pelayo, F.L., Pelayo, M.L., Guirao, J.G.: Generating the syntactic and semantics graphs for a markovian process algebra. Journal of Computational and Applied Mathematics 204, 38–47 (2007)
Godefroid, P., Khurshid, S.: Exploring very large state spaces using genetic algorithms. In: Procedings of the Conference on Tools and Algorithms for Construction and Analysis of Systems, Grenoble, France, pp. 266–280 (2002)
Rodriguez-Lopez, J., Romaguera, S., Valero, O.: Denotational semantics for programming languages, balanced quasi-metrics and fixed points. International Journal of Computer Mathematics 85(3), 623–630 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pelayo, F.L., Cuartero, F., Cazorla, D. (2011). Looking for a Cheaper ROSA. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21498-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-21498-1_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21497-4
Online ISBN: 978-3-642-21498-1
eBook Packages: Computer ScienceComputer Science (R0)