Abstract
Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. In this paper we apply this to the fitness checking stage in an evolution strategy for learning finite state machines. We give experimental results consisting of learning the control program for a vending machine. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Johnson, C. G. (2007). Genetic programming with fitness based on model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4445 LNCS, pp. 114–124). Springer Verlag. https://doi.org/10.1007/978-3-540-71605-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
