Brunel University Research Archive (BURA) >
Research Areas >
Information Systems and Computing >

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
Publication 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:B-SERC Research Papers
Information Systems and Computing
School of Information Systems, Computing and Mathematics Research Papers

Files in This Item:

File Description SizeFormat
Using a Minimal.pdf426.89 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan