Parallel Implementation for Deriving Preset Distinguishing Experiments of Nondeterministic Finite State Machines

被引：0
|
作者：
Haddad, Abdul Rahim [1 ]
El-Fakih, Khaled [1 ]
Barlas, Gerassimos [1 ]
机构：
[1] Amer Univ Sharjah, Comp Sci & Engn, Sharjah, U Arab Emirates
来源：
2017 7TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO) | 2017年
关键词：
Software Engineering; Functional Testing; Distinguishing Experiments; Nondeterministic Finite State Machines; Parallel Algorithms; OpenMP;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Derivation of input sequences for distinguishing states of a finite state machine (FSM) specification is well studied in the context of FSM-based functional testing. We present a parallel multithreaded implementation of the exact algorithm using Open Multi-Processing (OpenMP). Experiments are conducted to assess the performance of the parallel implementation as compared to the sequential implementation using both execution time speedup and efficiency.
引用
收藏
页数：6
相关论文
共 50 条
  • [11] Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
    Bilal Elghadyry
    Faissal Ouardi
    Zineb Lotfi
    Sébastien Verel
    Journal of Big Data, 8
  • [12] Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
    Elghadyry, Bilal
    Ouardi, Faissal
    Lotfi, Zineb
    Verel, Sebastien
    JOURNAL OF BIG DATA, 2021, 8 (01)
  • [13] Parallel composition of nondeterministic Finite State Machines with Timeouts
    Kondratyeva, Olga, V
    Yevtushenko, Nina, V
    Cavalli, Ana R.
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2014, 27 (02): : 73 - 81
  • [14] On deriving test suites for nondeterministic finite state machines with time-outs
    Shabaldina, N. V.
    Galimullin, R. F.
    PROGRAMMING AND COMPUTER SOFTWARE, 2012, 38 (03) : 127 - 133
  • [15] Decreasing the Complexity of Deriving Test Suites against Nondeterministic Finite State Machines
    Yenigun, Husnu
    Kushik, Natalia
    Lopez, Jorge
    Yevtushenko, Nina
    Cavalli, Ana R.
    2017 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2017,
  • [16] On deriving test suites for nondeterministic finite state machines with time-outs
    N. V. Shabaldina
    R. F. Galimullin
    Programming and Computer Software, 2012, 38 : 127 - 133
  • [17] ON DERIVING THE PARALLEL COMPOSITION OF EXTENDED FINITE STATE MACHINES
    Shirokova, E., V
    Prokopenko, S. A.
    Shabaldina, N., V
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2019, (48): : 83 - 91
  • [18] An Improved Upper Bound for the Length of Preset Distinguishing Sequences of Distinguished Merging Finite State Machines
    Gunicen, Canan
    Inan, Kemal
    Turker, Uraz Cengiz
    Yenigun, Husnu
    INFORMATION SCIENCES AND SYSTEMS 2014, 2014, : 325 - 335
  • [19] Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines
    Zhang, F
    Cheung, TY
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2003, 29 (01) : 1 - 14
  • [20] The state reduction of nondeterministic finite-state machines
    Damiani, M
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1997, 16 (11) : 1278 - 1291
12345