Testing from a nondeterministic finite state machine using adaptive state counting

被引：69
|
作者：
Hierons, RM [1 ]
机构：
[1] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2004年 / 53卷 / 10期
基金：
英国工程与自然科学研究理事会;
关键词：
software engineering; software/program verification; testing and debugging; nondeterministic finite state machine; adaptive testing; state counting;
D O I：
10.1109/TC.2004.85
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.
引用
收藏
页码：1330 / 1342
页数：13
相关论文
共 50 条
  • [21] Initial-State Observability of Mealy-Based Finite-State Machine With Nondeterministic Output Functions
    Zhang, Zhipeng
    Xia, Chengyi
    Fu, Jun
    Chen, Zengqiang
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (10): : 6396 - 6405
  • [22] Testing from a finite-state machine: Extending invertibility to sequences
    Hierons, RM
    COMPUTER JOURNAL, 1997, 40 (04): : 220 - 230
  • [23] Active Learning of Nondeterministic Finite State Machines
    Pacharoen, Warawoot
    Aoki, Toshiaki
    Bhattarakosol, Pattarasinee
    Surarerks, Athasit
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [24] Distinguishing tests for nondeterministic finite state machines
    Boroday, SY
    TESTING OF COMMUNICATING SYSTEMS, 1998, : 101 - 107
  • [25] TESTING NONDETERMINISTIC STATE MACHINES WITH FAULT COVERAGE
    FUJIWARA, S
    VONBOCHMANN, G
    IFIP TRANSACTIONS C-COMMUNICATION SYSTEMS, 1992, 3 : 267 - 280
  • [26] NONDETERMINISTIC STATE MACHINES IN PROTOCOL CONFORMANCE TESTING
    PETRENKO, A
    YEVTUSHENKO, N
    LEBEDEV, A
    DAS, A
    PROTOCOL TEST SYSTEMS, VI, 1994, 19 : 363 - 378
  • [27] GAMBLING USING A FINITE STATE MACHINE
    FEDER, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) : 1459 - 1466
  • [28] New approaches for passive testing using an Extended Finite State Machine specification
    Cavalli, A
    Gervy, C
    Prokopenko, S
    INFORMATION AND SOFTWARE TECHNOLOGY, 2003, 45 (12) : 837 - 852
  • [29] Accelerating Finite State Machine-Based Testing Using Reinforcement Learning
    Turker, Uraz Cengiz
    Hierons, Robert M.
    El-Fakih, Khaled
    Mousavi, Mohammad Reza
    Tyukin, Ivan Y.
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 50 (03) : 574 - 597
  • [30] Adaptive executable test sequences generation from an extended finite state machine
    Shu, Ting
    Liu, Lianggui
    Xu, Weiqiang
    Li, Wenshu
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2012, 49 (06): : 1211 - 1219
12345