Feasible test generation by elimination of inconsistencies in EFSM models of computer and communication systems.
Item
-
Title
-
Feasible test generation by elimination of inconsistencies in EFSM models of computer and communication systems.
-
Identifier
-
AAI9986320
-
identifier
-
9986320
-
Creator
-
Duale, Ali Yusuf.
-
Contributor
-
Adviser: M. Umit Uyar
-
Date
-
2000
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical | Computer Science
-
Abstract
-
Conformance testing aims at the detection of possible discrepancies between an implementation and its specification. Furthermore, conformance testing is essential for achieving a seamless interoperability among the components of a heterogeneous system. Finite-state machines (FSMs) are used to model and generate conformance test sequences for the control structures of communication protocols. On the other hand, the extended finite-state machines (EFSMs) are used when the data portion of a communication protocol is considered.;Although methods to automatically generate conformance test sequences from the FSMs are available, the test generation from the EFSMs is among the most challenging aspects of conformance testing. If the interdependencies among the variables used in the actions and conditions of the EFSMs are not considered during the test generation, the test sequences may be unrealizable in a test laboratory.;This dissertation presents a method that enables the generation of realizable test sequences from a class of EFSMs. Inconsistencies among the actions and conditions of EFSM models are defined. Algorithms for the detection and elimination of these inconsistencies are developed. These algorithms eliminate inconsistencies by creating new nodes and edges for the EFSM graph.;However, these nodes and edges are created only when needed, thus avoiding unnecessary growth of the state space. For the cases where the state explosion is unavoidable, the size of the new graph is constantly monitored as the algorithms eliminate the inconsistencies.;Once inconsistencies are eliminated, realizable test sequences can be generated from the resulting consistent EFSMs by using the test generation methods available for the FSM models.;The proposed methodology is currently being used to solve the conflicting timers problem which arises when a protocol has multiple timers running concurrently. Due to the conflicting timers, a test sequence of a protocol such as the Estelle specification of the MIL-STD-188-220 may be interrupted by unexpected timeouts. Preliminary results show that generating test sequences for the MIL-STD-188-220 after eliminating the timer inconsistencies significantly improves the test coverage by including more transitions into the test sequences without timer interruptions.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
