An assessment of extended finite state machine test selection criteria

El-Fakih, Khaled; Simão, Adenilso da Silva; Jadoon, Noshad; Maldonado, José Carlos

doi:10.1016/j.jss.2016.09.044

Cited by 15 publications

(15 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…No empirical assessments were provided in the previous work reported by El‐Fakih et al. [22,23]. Besides, here, we also provide two novel assessments showing that there are no significant differences between the test suites coverage of different classes of EFSM and code faults.…”

Section: Introductionmentioning

confidence: 56%

“…[22] and El‐Fakih et al. [23], respectively. In particular, in the first work [22], three (out of the five) EFSM‐based test suites considered in this paper are sorted (from best to worst) with respect to their coverage of code faults, and in the second work [23], the test suites considered in this paper are sorted with respect to their coverage of EFSM faults.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Assessing test suites of extended finite state machines against model‐ and code‐based faults

El-Fakih

Alzaatreh

Türker

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

Tests can be derived from extended finite state machine (EFSM) specifications considering the coverage of single-transfer faults, all transitions using a transition tour, all-uses, edge-pair, and prime path with side trip. We provide novel empirical assessments of the effectiveness of these test suites. The first assessment determines for each pair of test suites if there is a difference between the pair in covering EFSM faults of six EFSM specifications. If the difference is found significant, we determine which test suite outperforms the other. The second assessment is similar to the first; yet, it is carried out against code faults of 12 Java implementations of the specifications. Besides, two assessments are provided to determine whether test suites have better coverage of certain classes of EFSM (or code) faults than others. The evaluation uses proper data transformation of mutation scores and p-value adjustments for controlling Type I error due to multiple tests. Furthermore, we show that subsuming mutants have an impact on mutation scores of both EFSM and code faults; and accordingly, we use a score that removes them in order not to invalidate the obtained results. The assessments show that all-uses tests were outperformed by all other tests; transition tours outperformed both edge-pair and prime path with side trips; and single-transfer fault tests outperformed all other test suites. Similar results are obtained over the considered EFSM and code fault domains, and there were no significant differences between the test suites coverage of different classes of EFSM and code faults.

show abstract

Section: Introductionmentioning

confidence: 56%

Section: Introductionmentioning

confidence: 99%

Assessing test suites of extended finite state machines against model‐ and code‐based faults

El-Fakih

Alzaatreh

Türker

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…Test sequence execution cost is measured by the length of test sequences. Although these are clearly approximation methods, for practical reasons such methods have been commonly used in a number of testing studies [14][15][16].…”

Section: Theorem 5 Given An Fsm Suppose Thatmentioning

confidence: 99%

Test Sequence Reduction of Wireless Protocol Conformance Testing to Internet of Things

Lin

Zeng

Gao

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

Wireless communication protocols are indispensable in Internet of Things (IoT), which refer to rules and conventions that must be followed by both entities to complete wireless communication or service. Wireless protocol conformance testing concerns an effective way to judge whether a wireless protocol is carried out as expected. Starting from existing test sequence generation methods in conformance testing, an improved method based on overlapping by invertibility and multiple unique input/output (UIO) sequences is proposed in this paper. The method is accomplished in two steps: first, maximum-length invertibility-dependent overlapping sequences (IDOSs) are constructed, then a minimum-length rural postman tour covering the just constructed set of maximum-length IDOSs is generated and a test sequence is extracted from the tour. The soundness and effectiveness of the method are analyzed. Theory and experiment show that desirable test sequences can be yielded by the proposed method to reveal violations of wireless communication protocols in IoT.

show abstract

“…The first direction is automation (from the automation of certain operations to the introduction of automated control of technological processes). In particular, Petri nets [10], the methods of finite automata [11][12][13] and the assertion mechanisms are used for this purpose. The second direction is associated with the use of the methods of artificial intelligence and paying more attention not to simulating a control object, but rather to formalizing the driving activity of a person-operator [14][15][16].…”

Section: A G O R O B C H E N K Omentioning

confidence: 99%

Improving the process of driving a locomotive through the use of decision support systems

Tartakovskyi

Gorobchenko

Antonovych

2016

EEJET

View full text Add to dashboard Cite

Розроблено структуру та архітектурну ієрархію локомотивних СППР. Алгоритм дій машиніста локомотива представлено нечітким імовірнісним графом. Вагові коефіцієнти переходів між вершинами завдані нечіткими числами, значення яких записані в матриці графа. Вибір варіанта рішення локомотивної СППР реалізовано за адитивним критерієм. Опис динамічної бази знань проведено з використанням продукційної моделі представлення знань Ключові слова: керування локомотивом, прийняття рішень, інтелектуальна система, база знань, нечіткий класифікатор Разработана структура и архитектурная иерархия локомотивных СППР. Алгоритм действий машиниста локомотива представлен нечетким вероятностным графом. Весовые коэффициенты переходов между вершинами заданы нечеткими числами, значения которых записаны в матрице графа. Выбор варианта решения локомотивной СППР реализован по аддитивному критерию. Описание динамической базы знаний проведено с использованием продукционной модели представления знаний Ключевые слова: управление локомотивом, принятие решений, интеллектуальная система, база знаний, нечеткий классификатор

show abstract

An assessment of extended finite state machine test selection criteria

Cited by 15 publications

References 8 publications

Assessing test suites of extended finite state machines against model‐ and code‐based faults

Assessing test suites of extended finite state machines against model‐ and code‐based faults

Test Sequence Reduction of Wireless Protocol Conformance Testing to Internet of Things

Improving the process of driving a locomotive through the use of decision support systems

Contact Info

Product

Resources

About