Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/352
Title: | Using a minimal number of resets when testing from a finite state machine |
Authors: | Hierons, RM |
Keywords: | Finite state machine;Graph algorithms;Minimization;Reset;Test generation algorithm |
Issue Date: | 2004 |
Publisher: | Elsevier |
Citation: | Information Processing Letters, 90(6): 287-292 |
URI: | http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=1011112 http://bura.brunel.ac.uk/handle/2438/352 http://www.elsevier.com/wps/find/journaldescription.cws_home/505612/description#description |
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 |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.