Testing from a finite state machine: Extending invertibility to sequences

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hierons, RM	-
dc.coverage.spatial	24	en
dc.date.accessioned	2006-11-06T10:17:02Z	-
dc.date.available	2006-11-06T10:17:02Z	-
dc.date.issued	1997	-
dc.identifier.citation	The Computer Journal 40(4): 220-230	en
dc.identifier.uri	http://comjnl.oxfordjournals.org/cgi/content/abstract/40/4/220	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/347	-
dc.description.abstract	When testing a system modelled as a finite state machine it is desirable to minimize the effort required. It has been demonstrated that it is possible to utilize test sequence overlap in order to reduce the test effort and this overlap has been represented by using invertible transitions. In this paper invertibility will be extended to sequences in order to reduce the test effort further and encapsulate a more general type of test sequence overlap. It will also be shown that certain properties of invertible sequences can be used in the generation of state identification sequences.	en
dc.format.extent	447345 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Oxford University Press	en
dc.subject	Computer testing	en
dc.subject	Finite state machine	en
dc.subject	Transmission protocol	en
dc.title	Testing from a finite state machine: Extending invertibility to sequences	en
dc.type	Research Paper	en
dc.identifier.doi	http://dx.doi.org/10.1093/comjnl/40.4.220	-
Appears in Collections:	Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC)

Files in This Item:

File	Description	Size	Format
Testing from a finite.pdf		436.86 kB	Adobe PDF	View/Open