Using a minimal number of resets when testing from a finite state machine

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hierons, RM	-
dc.coverage.spatial	9	en
dc.date.accessioned	2006-11-06T12:40:05Z	-
dc.date.available	2006-11-06T12:40:05Z	-
dc.date.issued	2004	-
dc.identifier.citation	Information Processing Letters, 90(6): 287-292	en
dc.identifier.uri	http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=1011112	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/352	-
dc.identifier.uri	http://www.elsevier.com/wps/find/journaldescription.cws_home/505612/description#description	en
dc.format.extent	437132 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Elsevier	-
dc.subject	Finite state machine	en
dc.subject	Graph algorithms	en
dc.subject	Minimization	en
dc.subject	Reset	en
dc.subject	Test generation algorithm	en
dc.title	Using a minimal number of resets when testing from a finite state machine	en
dc.type	Research Paper	en
Appears in Collections:	Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC)

Files in This Item:

File	Description	Size	Format
Using a Minimal.pdf		426.89 kB	Adobe PDF	View/Open