On adaptive experiments for nondeterministic finite state machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal on Software Tools for Technology Transfer Année : 2016

On adaptive experiments for nondeterministic finite state machines

Résumé

Adaptive experiments are well defined in the context of finite state machine (FSM) based analysis, in particular, in FSM based testing where homing and distinguishing experiments with FSMs are used for test derivation. In this paper, we define and propose algorithms for deriving adaptive homing and distinguishing experiments for non-initialized nondeterministic finite state machines (NFSMs). For NFSMs, the construction of adaptive experiments is rather complex as the partition over produced outputs does not define a partition over the set of states but a collection of intersecting subsets, and thus, the refinement of such set system is more difficult than the refinement of a partition. Given a complete non-initialized possibly non-observable NFSM, we establish necessary and sufficient conditions for having adaptive homing and distinguishing experiments and evaluate the height of these experiments
Fichier non déposé

Dates et versions

hal-01354241 , version 1 (18-08-2016)

Identifiants

Citer

Natalia Kushik, Khaled El-Fakhi, Nina Yevtushenko, Ana Rosa Cavalli. On adaptive experiments for nondeterministic finite state machines. International Journal on Software Tools for Technology Transfer, 2016, 18 (3), pp.251 - 264. ⟨10.1007/s10009-014-0357-7⟩. ⟨hal-01354241⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More