%0 Conference Paper %1 ross:1998:pscGPicp %A Ross, Brian J. %B Genetic Programming 1998: Proceedings of the Third Annual Conference %C University of Wisconsin, Madison, Wisconsin, USA %D 1998 %E Koza, John R. %E Banzhaf, Wolfgang %E Chellapilla, Kumar %E Deb, Kalyanmoy %E Dorigo, Marco %E Fogel, David B. %E Garzon, Max H. %E Goldberg, David E. %E Iba, Hitoshi %E Riolo, Rick %I Morgan Kaufmann %K algorithms, genetic programming %P 338--343 %T Pairwise Sequence Comparison and the Genetic Programming of Iterative Concurrent Programs %U http://citeseer.ist.psu.edu/503596.html %X The genetic programming of iterative concurrent programs written in the CCS process algebra is investigated. Using a generational genetic programming scheme, experiments succesfully evolved a cyclic concurrent program that performs a even-parity-2 analysis on a communicating input stream. The fitness evaluation strategy determines how well programs communicate with randomly generated streams of input signals. Fitness is measured by performing a pairwise sequence alignment comparison of two execution sequences -- the output sequence generated by the program communicating with the test signal stream, and the correct output sequence for that test case. The optimal edit distance between these sequences is efficiently computed using dynamic programming. The main result is that sequence alignment evaluation against randomly generated test cases is a promising evaluation strategy for evolving cycling protocols. %@ 1-55860-548-7

@inproceedings{ross:1998:pscGPicp, abstract = {The genetic programming of iterative concurrent programs written in the CCS process algebra is investigated. Using a generational genetic programming scheme, experiments succesfully evolved a cyclic concurrent program that performs a even-parity-2 analysis on a communicating input stream. The fitness evaluation strategy determines how well programs communicate with randomly generated streams of input signals. Fitness is measured by performing a pairwise sequence alignment comparison of two execution sequences -- the output sequence generated by the program communicating with the test signal stream, and the correct output sequence for that test case. The optimal edit distance between these sequences is efficiently computed using dynamic programming. The main result is that sequence alignment evaluation against randomly generated test cases is a promising evaluation strategy for evolving cycling protocols.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {University of Wisconsin, Madison, Wisconsin, USA}, author = {Ross, Brian J.}, biburl = {https://www.bibsonomy.org/bibtex/26457b8494196b2fc86d77e65367bf21d/brazovayeye}, booktitle = {Genetic Programming 1998: Proceedings of the Third Annual Conference}, editor = {Koza, John R. and Banzhaf, Wolfgang and Chellapilla, Kumar and Deb, Kalyanmoy and Dorigo, Marco and Fogel, David B. and Garzon, Max H. and Goldberg, David E. and Iba, Hitoshi and Riolo, Rick}, interhash = {a6832bfada0c0f4bff8262b8ceb83c2f}, intrahash = {6457b8494196b2fc86d77e65367bf21d}, isbn = {1-55860-548-7}, keywords = {algorithms, genetic programming}, month = {22-25 July}, notes = {GP-98}, pages = {338--343}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA, USA}, timestamp = {2008-06-19T17:50:36.000+0200}, title = {Pairwise Sequence Comparison and the Genetic Programming of Iterative Concurrent Programs}, url = {http://citeseer.ist.psu.edu/503596.html}, year = 1998 }