Geodesic
Adaptive tests derivation for nondeterministic automata
Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 90-101.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper is devoted to the adaptive distinguishing experiments derivation for the following automata models: Labelled Transition Systems, nondeterministic, possibly partial, Finite State Machines and Timed Finite State Machines. The methods suggested here do not exploit “all weather condition” assumption and are based on the intersection of the corresponding automata. The experiments can be used for test derivation and diagnosis for discrete event systems.
Keywords: Labelled Transition Systems, nondeterministic Finite State Machine, Timed Finite State Machine, distinguishing experiment, compatibility, adaptive experiment. 
@article{PDM_2009_4_a8,
     author = {M. L. Gromov and N. V. Yevtushenko},
     title = {Adaptive tests derivation for nondeterministic automata},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {90--101},
     publisher = {mathdoc},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_4_a8/}
}
TY  - JOUR
AU  - M. L. Gromov
AU  - N. V. Yevtushenko
TI  - Adaptive tests derivation for nondeterministic automata
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 90
EP  - 101
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_4_a8/
LA  - ru
ID  - PDM_2009_4_a8
ER  - 
%0 Journal Article
%A M. L. Gromov
%A N. V. Yevtushenko
%T Adaptive tests derivation for nondeterministic automata
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 90-101
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_4_a8/
%G ru
%F PDM_2009_4_a8
M. L. Gromov; N. V. Yevtushenko. Adaptive tests derivation for nondeterministic automata. Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 90-101. http://geodesic.mathdoc.fr/item/PDM_2009_4_a8/

[1] Milner R., Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, 1989 | Zbl

[2] Hierons R. M., “Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting”, IEEE Trans. Comput., 53:10 (2004), 1330–1342 | DOI

[3] Simão A., Petrenko A., “Generating Checking Sequences for Partial Reduced Finite State Machines”, TestCom' 08/FATES' 08, Springer Verlag, Berlin, 2008, 153–168

[4] Shabaldina N., El-Fakih K., Yevtushenko N., “Testing Nondeterministic Finite State Machines with Respect to the Separability Relation”, Testing of Software and Communicating Systems, Springer, Berlin, 2007, 305–318

[5] Merayo M., Núñez M., Rodríguez I., “Formal Testing from Timed Finite State Machines”, Computer Networks, 52:3 (2008), 432–460 | DOI | Zbl

[6] Alur R., Courcoubetis C., Yannakakis M., “Distinguishing tests for nondeterministic and probabilistic machines”, STOC' 95, ACM, New York, 1995, 363–372 | Zbl

[7] Gromov M., Willemse T., “Model-Based Testing Techniques for Diagnosis”, Testing of Software and Communicating Systems, Springer, Berlin, 2007, 138–154

[8] Gill A., Introduction to the theory of Finite-State Machines, McGraw-Hill, New York, 1962 | MR

[9] Tretmans J., “Test Generation with Inputs, Outputs and Repetitive Quiescence”, Software – Concepts and Tools, 17:3 (1996), 103–120 | Zbl

[10] Evtushenko N. V., Petrenko A. F., Vetrova M. V., Nedeterminrovannye avtomaty: Analiz i sintez. Ch. 1. Otnosheniya i operatsii, Ucheb. posobie, Tomskii gosuniversitet, Tomsk, 2006, 142 pp.

[11] Gromov M., Popov D., Yevtushenko N., “Deriving test suites for timed Finite State Machines”, Proceedings of IEEE East-West Design Test Symposium' 08, SPD FL Stepanov V. V., Kharkov, 2008, 339–343

[12] Kufareva I. B., Primenenie nedeterminirovannykh avtomatov v zadachakh sinteza proveryayuschikh testov dlya sistem logicheskogo upravleniya, Avtoref. dis. $\dots$ kand. tekhn. nauk, Tomskii gosuniversitet, Tomsk, 2000, 16 pp.