Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

Please use this identifier to cite or link to this item:

Title: Testing from semi-independent communicating finite state machines with a slow environment
Authors: Hierons, RM
Keywords: Directed graphs
Finite state machines
Publication Date: 1997
Publisher: Institution of Engineering and Technology
Citation: IEE Proceedings - Software Engineering, 144(5-6): 291-295, Oct 1997
Abstract: Some systems may be modelled as a set of communicating finite state machines with a slow environment. These machines communicate through the exchange of values. While it is possible to convert such a model into one finite state machine, from which test cases can be derived, this process may lead to an explosion in the number of states. Alternatively it is possible to utilise any independence that exists. The problem of producing a minimal test set, in the presence of certain types of independence and unique input/output sequences, can be represented as a variant of the vehicle routing problem. Possible heuristics for solving this problem are outlined and the method is applied to an example.
Appears in Collections:Computer Science
Software Engineering (B-SERC)
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Testing From Semi-indepenedent.pdf329.4 kBAdobe PDFView/Open

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