Experimental evaluation of FSM-based testing methods

Dorofeeva, Rita; El-Fakih, Khaled; Maag, Stéphane; Cavalli, Ana; Yevtushenko, Nina

doi:10.1109/sefm.2005.17

Cited by 32 publications

(38 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…States 3 and 2 of Q 1 are 1-r-distinguishable by a timed input (i 2 , 1) and states 2 and 4 are 1-rdistinguishable by a timed input (i 1 , 2). Thus, we remove states (3, 2) and (2, 4) from Q 1 and obtain Q 2 which does not include states (3,2) and (2,4). States 1 and 3 of the initial state (1, 3) in Q 2 are 2-r-distinguishable.…”

Section: Propositionmentioning

confidence: 99%

“…FSMs are widely used in many application areas; in particular, they are used as the underlying models for formal description techniques, such as SDL and UML State Diagrams, and many conformance test derivation methods are based on a specification given in the form of a finite state machine. For surveys see [3], [11] and for some related experiments see [4]. Most of the past work on FSM-based conformance testing has been done for deriving tests for deterministic FSMs w.r.t.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distinguing Non-deterministic Timed Finite State Machines

Gromov

El-Fakih

Shabaldina

et al. 2009

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an adaptive algorithm for r-distinguishing two possibly non-separable TFSMs. The proposed techniques extend existing methods for untimed non-deterministic FSMs by dealing with the fact that unlike untimed FSMs in general, a TFSM has an infinite number of timed inputs. Correspondingly we state that the upper bounds on the length of distinguishing sequences are the same as for untimed FSMs.

show abstract

Section: Propositionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distinguing Non-deterministic Timed Finite State Machines

Gromov

El-Fakih

Shabaldina

et al. 2009

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

show abstract

“…There are several methods in the literature that generate n-complete test suites, such as W, HSI, H, SPY, and P. These methods produce test suites with different characteristics that can only be experimentally compared. Few experimental studies on comparing different FSM-based test methods can be found in the literature (Dorofeeva et al, 2005a;Simao et al, 2009a;Dorofeeva et al, 2010). Moreover, they fall short when it comes down to considering recent contributions and analyzing different aspects relevant to the practical application of these methods in service-oriented applications.…”

Section: Overviewmentioning

confidence: 99%

Model based testing of service oriented applications

Endo¹

View full text Add to dashboard Cite

“…In this paper, we consider deterministic and complete EFSMs, i.e., for each parameterized input sequence there exists a single parameterized output sequence that is produced by the EFSM for the given input sequence. b) FSM F is tested as completely specified FSM [4] and then the test suit is "cleaned" by deleting all suffixes of test sequences that lead to the DNC state. However, the fault coverage of such a test suite is still unknown.…”

Section: The Efsm Modelmentioning

confidence: 99%