Reduced length checking sequences

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/358

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hierons, RM	-
dc.contributor.author	Ural, H	-
dc.coverage.spatial	14	en
dc.date.accessioned	2006-11-06T16:15:27Z	-
dc.date.available	2006-11-06T16:15:27Z	-
dc.date.issued	2002	-
dc.identifier.citation	Hierons. R.M. Ural. H. (2002) 'Reduced length checking sequences', IEEE Transactions on Computers, 51(9), pp. 1111-1117. doi:10.1109/tc.2002.1032630.	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/358	-
dc.description.abstract	Here, the method proposed by Ural, Wu and Zhang (1997) for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines.	en
dc.format.extent	468169 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE) Computer Society	en
dc.subject	Finite state machine	en
dc.subject	Checking sequence	en
dc.subject	Test minimization	en
dc.subject	Distinguishing sequence	en
dc.title	Reduced length checking sequences	en
dc.type	Research Paper	en
dc.identifier.doi	https://doi.org/10.1109/tc.2002.1032630	-
Appears in Collections:	Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC)

Files in This Item:

File	Description	Size	Format
FullText.pdf		457.2 kB	Adobe PDF	View/Open