Genetic Algorithm for Path-based Testing of Component Outage Situations in IoT System Processes
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00388257" target="_blank" >RIV/68407700:21230/25:00388257 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1016/j.asoc.2025.113854" target="_blank" >https://doi.org/10.1016/j.asoc.2025.113854</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.asoc.2025.113854" target="_blank" >10.1016/j.asoc.2025.113854</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Genetic Algorithm for Path-based Testing of Component Outage Situations in IoT System Processes
Popis výsledku v původním jazyce
Component outages often affect IoT system operations and processes. These components can be physical devices, infrastructure parts, or system modules. Among other possible causes, outages are often due to limited or intermittent network connectivity. To ensure reliable operations, connection outage scenarios must reviewed systematically, which is especially important for critical systems. Path-based testing techniques are preferable for this task, as they sequence events in the system and, therefore, allow to verify the effects the limited network connectivity on the system processes. Because the available path-based testing techniques provide only a limited ability to solve this problem effectively, in this study, we propose an adaptation of genetic algorithm to generate specialized test paths from a model that captures the system under test processes. Compared with the four path-based testing alternatives for solving the testing problem, the proposed algorithm yielded the best results in all four defined test set metrics for the two defined test coverage criteria. Regarding the average total length of the test paths, which served as a proxy for testing costs, those produced by the proposed adapted genetic algorithm outperformed the best of the proposed baselines by 23.5% and 29% individual test coverage criteria.
Název v anglickém jazyce
Genetic Algorithm for Path-based Testing of Component Outage Situations in IoT System Processes
Popis výsledku anglicky
Component outages often affect IoT system operations and processes. These components can be physical devices, infrastructure parts, or system modules. Among other possible causes, outages are often due to limited or intermittent network connectivity. To ensure reliable operations, connection outage scenarios must reviewed systematically, which is especially important for critical systems. Path-based testing techniques are preferable for this task, as they sequence events in the system and, therefore, allow to verify the effects the limited network connectivity on the system processes. Because the available path-based testing techniques provide only a limited ability to solve this problem effectively, in this study, we propose an adaptation of genetic algorithm to generate specialized test paths from a model that captures the system under test processes. Compared with the four path-based testing alternatives for solving the testing problem, the proposed algorithm yielded the best results in all four defined test set metrics for the two defined test coverage criteria. Regarding the average total length of the test paths, which served as a proxy for testing costs, those produced by the proposed adapted genetic algorithm outperformed the best of the proposed baselines by 23.5% and 29% individual test coverage criteria.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2025
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Applied Soft Computing
ISSN
1568-4946
e-ISSN
1872-9681
Svazek periodika
185
Číslo periodika v rámci svazku
December
Stát vydavatele periodika
NL - Nizozemsko
Počet stran výsledku
22
Strana od-do
—
Kód UT WoS článku
001594234600001
EID výsledku v databázi Scopus
2-s2.0-105018173651