Probabilistic approach for minimizing checking sequences for non-deterministic FSMs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Probabilistic approach for minimizing checking sequences for non-deterministic FSMs

Résumé

The paper is devoted to model based testing against probabilistic FSMs. Differently from our prior work in 2021, we consider checking sequences and possibilities of test suite minimization through reducing the length of the resulting checking sequence. Given a level of certainty P , we define a P-probably checking sequence under a white box testing assumption and discuss how a suffix of an input sequence can be omitted, such that the resulting sub-sequence is P-probably checking. The specification and possible implementations are non-initialized, i.e., the assumption of 'no reset' is supported.
Fichier principal
Vignette du fichier
PFSM_checking_sequence (13).pdf (255.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : Copyright (Tous droits réservés)

Dates et versions

hal-04322446 , version 1 (04-12-2023)

Identifiants

Citer

Natalia Kushik, Nina Yevtushenko, Jorge López. Probabilistic approach for minimizing checking sequences for non-deterministic FSMs. 35th International Conference on Testing Software and Systems (ICTSS), Sep 2023, Bergame (Italie), Italy. pp.237-243, ⟨10.1007/978-3-031-43240-8_15⟩. ⟨hal-04322446⟩
19 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More