Test Selection for Hierarchical and Communicating Finite State Machines

State-based languages are widely used for modelling systems that have an internal state, such as communications protocols and embedded control systems. As testing is a vital part of system development, this has led to much interest in testing from finite state machines (FSMs). However, complex syste...

Full description

Saved in:
Bibliographic Details
Published in:Computer journal 2009-05, Vol.52 (3), p.334-347
Main Author: Ipate, Florentin
Format: Article
Language:English
Subjects:
Complex systems
Computer science
Design
Hierarchies
Input output
Programming languages
Systems development
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:State-based languages are widely used for modelling systems that have an internal state, such as communications protocols and embedded control systems. As testing is a vital part of system development, this has led to much interest in testing from finite state machines (FSMs). However, complex systems are seldom designed in one step; usually, the design is constructed gradually, through a process of refinement. In the case of state-based models, this may lead to a hierarchy of machines. Furthermore, some of the components of the hierarchy may exhibit concurrent behaviour. In this paper, we present a method for generating tests for a hierarchical FSM by reusing and refining the tests for the FSM components of the hierarchy. The method is also adapted for testing a system of communicating FSMs, in which the communication is one-directional, from one master to one or more slaves.
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxn027