2026-09-21T13:16:31Zhttps://bura.brunel.ac.uk/oai/request

oai:bura.brunel.ac.uk:2438/30622016-01-27T09:08:31Zcom_2438_23com_2438_58com_2438_8630com_2438_8620col_2438_3672col_2438_210col_2438_9053col_2438_8638

Hierons, RM Harman, M Derderian, Karnig Agop 2009-02-25T14:58:06Z 2009-02-25T14:58:06Z 2006 http://bura.brunel.ac.uk/handle/2438/3062 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University. Testing software implementations, formally specified using finite state automata (FSA) has been of interest. Such systems include communication protocols and control sections of safety critical systems. There is extensive literature regarding how to formally validate an FSM based specification, but testing that an implementation conforms to the specification is still an open problem. Two aspects of FSA based testing, both NP-hard problems, are discussed in this thesis and then combined. These are the generation of state verification sequences (UIOs) and the generation of sequences of conditional transitions that are easy to trigger. In order to facilitate test sequence generation a novel representation of the transition conditions and a number of fitness function algorithms are defined. An empirical study of the effectiveness on real FSA based systems and example FSAs provides some interesting positive results. The use of genetic algorithms (GAs) makes these problems scalable for large FSAs. The experiments used a software tool that was developed in Java. Submitted by BURA Manager (bura-manager@brunel.ac.uk) on 2009-02-25T14:56:07Z No. of bitstreams: 1 nps1D6.tmp.pdf: 1859342 bytes, checksum: 3f49b4e51bf3a9e4846e8a461f966f77 (MD5) Approved for entry into archive by BURA Manager(bura-manager@brunel.ac.uk) on 2009-02-25T14:58:06Z (GMT) No. of bitstreams: 1 nps1D6.tmp.pdf: 1859342 bytes, checksum: 3f49b4e51bf3a9e4846e8a461f966f77 (MD5) Made available in DSpace on 2009-02-25T14:58:06Z (GMT). No. of bitstreams: 1 nps1D6.tmp.pdf: 1859342 bytes, checksum: 3f49b4e51bf3a9e4846e8a461f966f77 (MD5) Previous issue date: 2006-12 1859342 bytes application/pdf en Brunel University, School of Information Systems, Computing and Mathematics School of Information Systems, Computing and Mathematics http://bura.brunel.ac.uk/bitstream/2438/3062/3/FulltextThesis.pdf GA FSM EFSM Automated test sequence generation for finite state machines using genetic algorithms Thesis