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

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

Title: Testing from semi-independent communicating finite state machines with a slow environment
Authors: Hierons, RM
Keywords: Directed graphs
Finite state machines
Testing
Transportation
Vehicles
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.
URI: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=655598
http://bura.brunel.ac.uk/handle/2438/351
DOI: http://dx.doi.org/10.1049/ip-sen:19971789
Appears in Collections:B-SERC Research Papers
School of Information Systems, Computing and Mathematics Research Papers
Computer Science

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.

 


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