Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Proceedings of the Institute for System Programming of the RAS, 2019, Volume 31, Issue 4, Pages 175–188
DOI: https://doi.org/10.15514/ISPRAS-2019-31(4)-12
(Mi tisp447)
 

This article is cited in 1 scientific paper (total in 1 paper)

FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts

A. S. Tvardovskiia, N. V. Yevtushenkobc

a National Research Tomsk State University
b Ivannikov Institute for System Programming of the Russian Academy of Sciences
c National Research University Higher School of Economics
References:
Abstract: Finite State Machine (FSM) based approaches are widely used for deriving tests with guaranteed fault coverage for discrete event systems and as the behavior of many nowadays information and control systems depends on time, classical FSMs are extended by clock variables. Moreover, optionality in the real system’s specifications motivates the studying test derivation against models with the nondeterministic behavior. In this paper, we adapt classical FSM based test derivation methods for nondeterministic FSMs with timed guards and timeouts (TFSMs). We show that unlike classical FSM conformance relation, the check cannot be reduced to checking the correspondence between TFSMs transitions and this violates the main principle of FSM based test derivation methods. Respectively, a proposed approach and the appropriate fault model are based on the FSM abstraction of the given TFSM specification that is used to adequately describe the behavior of a TFSM. The fault domain contains TFSMs with the known upper boundary on the number of FSM abstraction states and allows to avoid explicit enumeration of implementations under test. We study properties of the FSM abstraction for a nondeterministic TFSM and justify that the use of an FSM abstraction allows to adapt classical FSM based test derivation methods when deriving tests with guaranteed fault coverage for TFSMs. A method is proposed for deriving a complete test suite for a complete possibly nondeterministic TFSM when an implementation under test is a deterministic complete TFSM.
Keywords: Finite State Machine, timeout, timed guard, nondeterministic Timed Finite State Machine, test derivation, fault coverage.
Funding agency Grant number
Russian Foundation for Basic Research 19-07-00327/19
This work is partly supported by RFBR project No 19-07-00327/19.
Document Type: Article
Language: English
Citation: A. S. Tvardovskii, N. V. Yevtushenko, “FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts”, Proceedings of ISP RAS, 31:4 (2019), 175–188
Citation in format AMSBIB
\Bibitem{TvaEvt19}
\by A.~S.~Tvardovskii, N.~V.~Yevtushenko
\paper FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts
\jour Proceedings of ISP RAS
\yr 2019
\vol 31
\issue 4
\pages 175--188
\mathnet{http://mi.mathnet.ru/tisp447}
\crossref{https://doi.org/10.15514/ISPRAS-2019-31(4)-12}
Linking options:
  • https://www.mathnet.ru/eng/tisp447
  • https://www.mathnet.ru/eng/tisp/v31/i4/p175
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Proceedings of the Institute for System Programming of the RAS
    Statistics & downloads:
    Abstract page:122
    Full-text PDF :66
    References:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024