Input sequence generation for testing of Communicating Finite State Machines (CFSMs)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 1429-1430

  Derderian, Karnig ^a   Hierons, Robert M ^a   Harman, Mark ^a   Guo, Qiang ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048828758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_164     Document Type: Article

References (7)

1. Tanenbaum, A.: Computer Networks. Prentice Hall (1996) 3rd edition.
2. Beizer, B.: Software testing techniques. Technical report (1990) 2nd edition.
3. Petrenko, A., Yavtushenko, N., Dssouli, R.: Testing strategies for communicating fsms. Protocol Test Systems (November 1995) 195-208
4. Hierons, R.: Checking states and transitions of a set of communicating finite state machines. Microprocessors and Microsystems,Special Issue on Testing and testing techniques for real-time embedded software systems, 24 (2001) 443 452.
5. Guo, Q., Hierons, R., Harman, M., Derderian, K.: Computing unique input/output sequences using genetic algorithms. In: LNCS vol. 2931, Springer (2004) 169-184
6. Goldderg, D.E.: Genetic Algorithms in search, optimisation and machine learning. Addison-Wesley Publishing Company (1989)
7. Derderian, K., Hierons, R., Harman, M., Guo, Q.: Generating unique input output sequences for finite state machine testing using genetic algorithms. IEE Electronics Letters (Under consideration) (2004)