Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines

A Master of Science thesis in Computer Engineering by Ayat Saleh entitled, "Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines," submitted in September 2017. Thesis advisor is Dr. Khaled El-Fakih. Soft and hard co...

Full description

Saved in:
Bibliographic Details
Main Author: Saleh, Ayat (author)
Format: doctoralThesis
Published: 2017
Subjects:
Online Access:http://hdl.handle.net/11073/9129
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864513436285665280
author Saleh, Ayat
author_facet Saleh, Ayat
author_role author
dc.contributor.none.fl_str_mv El Fakih, Khaled
dc.creator.none.fl_str_mv Saleh, Ayat
dc.date.none.fl_str_mv 2017-11-27T05:47:33Z
2017-11-27T05:47:33Z
2017-09
dc.format.none.fl_str_mv application/pdf
dc.identifier.none.fl_str_mv 35.232-2017.31
http://hdl.handle.net/11073/9129
dc.language.none.fl_str_mv en_US
dc.subject.none.fl_str_mv Model Based Testing
Distinguishing Test case
Incremental Algorithms
Heuristics
Sequential machine theory
Computer algorithms
dc.title.none.fl_str_mv Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/doctoralThesis
description A Master of Science thesis in Computer Engineering by Ayat Saleh entitled, "Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines," submitted in September 2017. Thesis advisor is Dr. Khaled El-Fakih. Soft and hard copy available.
format doctoralThesis
id aus_2321597911a9522df4f1773f32dbc343
identifier_str_mv 35.232-2017.31
language_invalid_str_mv en_US
network_acronym_str aus
network_name_str aus
oai_identifier_str oai:repository.aus.edu:11073/9129
publishDate 2017
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State MachinesSaleh, AyatModel Based TestingDistinguishing Test caseIncremental AlgorithmsHeuristicsSequential machine theoryComputer algorithmsA Master of Science thesis in Computer Engineering by Ayat Saleh entitled, "Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines," submitted in September 2017. Thesis advisor is Dr. Khaled El-Fakih. Soft and hard copy available.Many methods are proposed for the construction of distinguishing test cases (DTCs) based on a specification given in the form of a Finite State Machine (FSM). In FSM-based testing, we have a black-box FSM Implementation Under Test (IUT) about which we lack some information, and we want to conclude this information by using the applied input sequences of DTCs to the IUT, then by observing the output responses to the applied input sequences final conclusions about the IUTare drawn. A DTC is adaptive if the next input of a DTC is selected based on the previously observed outputs. In this thesis, we propose an incremental approach, called Inc, for the construction of an adaptive DTC for a given set of states of a nondeterministic FSM. In addition, two heuristics are proposed for the derivation of adaptive DTCs. The first heuristic, called H, uses depth first search for a given fixed height while appropriately utilizing hashing to speed up the search for a DTC. The second heuristic, called Hc, is similar to the first; however, it uses a cost function for ordering the inputs to be considered while conducting the search. Comprehensive experiments are conducted, using both real and randomly generated FSMs, to assess the existence of DTCs and compare the performance of the proposed approaches. According to these experiments, in terms of execution time, Inc usually outperforms an existing non-incremental algorithm, called A, when a DTC does not exist. However, in contrary to the H and Hc methods, both A and Inc do not scale well for large size FSMs. Both H and Hc have comparable execution time; however, for large size FSMs, in terms of quality of obtained solutions (length of obtained DTC), usually Hc outperforms H.College of EngineeringDepartment of Computer Science and EngineeringMaster of Science in Computer Engineering (MSCoE)El Fakih, Khaled2017-11-27T05:47:33Z2017-11-27T05:47:33Z2017-09info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisapplication/pdf35.232-2017.31http://hdl.handle.net/11073/9129en_USoai:repository.aus.edu:11073/91292025-06-26T12:27:14Z
spellingShingle Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
Saleh, Ayat
Model Based Testing
Distinguishing Test case
Incremental Algorithms
Heuristics
Sequential machine theory
Computer algorithms
status_str publishedVersion
title Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
title_full Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
title_fullStr Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
title_full_unstemmed Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
title_short Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
title_sort Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
topic Model Based Testing
Distinguishing Test case
Incremental Algorithms
Heuristics
Sequential machine theory
Computer algorithms
url http://hdl.handle.net/11073/9129