Geodesic
Deriving synchronizing and homing sequences for input/output automata
Modelirovanie i analiz informacionnyh sistem, Tome 24 (2017) no. 6, pp. 730-742.

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

In this paper, we study the problem of existence check and derivation of synchronizing and homing sequences for finite input/output automata. Corresponding sequences can be effectively used for the current state identification of a system under test/verification, after the input sequence is applied. In the model considered in the paper, the alphabet of actions is divided into disjoint sets of inputs and outputs; however, no sets of possible initial or final states are defined. We introduce the notions of homing and synchronizing sequences for a specific class of such machines for which at each state the transitions only under inputs or under outputs are defined, and the machine transition diagram does not contain cycles labeled by outputs, i.e. the language of the machine does not contain traces with infinite postfix of outputs. For such a class of input/output automata, we establish necessary and sufficient conditions for the existence of synchronizing and homing sequences and discuss the length of such sequences. We also define some subclasses of automata for which the worst-case upper bounds (normally, exponential) are not reachable.
Keywords: input/output automata, synchronizing sequence, homing sequence. 
@article{MAIS_2017_24_6_a5,
     author = {N. G. Kushik and N. V. Yevtushenko and I. B. Burdonov and A. S. Kossatchev},
     title = {Deriving synchronizing and homing sequences for input/output automata},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {730--742},
     publisher = {mathdoc},
     volume = {24},
     number = {6},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2017_24_6_a5/}
}
TY  - JOUR
AU  - N. G. Kushik
AU  - N. V. Yevtushenko
AU  - I. B. Burdonov
AU  - A. S. Kossatchev
TI  - Deriving synchronizing and homing sequences for input/output automata
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2017
SP  - 730
EP  - 742
VL  - 24
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2017_24_6_a5/
LA  - ru
ID  - MAIS_2017_24_6_a5
ER  - 
%0 Journal Article
%A N. G. Kushik
%A N. V. Yevtushenko
%A I. B. Burdonov
%A A. S. Kossatchev
%T Deriving synchronizing and homing sequences for input/output automata
%J Modelirovanie i analiz informacionnyh sistem
%D 2017
%P 730-742
%V 24
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2017_24_6_a5/
%G ru
%F MAIS_2017_24_6_a5
N. G. Kushik; N. V. Yevtushenko; I. B. Burdonov; A. S. Kossatchev. Deriving synchronizing and homing sequences for input/output automata. Modelirovanie i analiz informacionnyh sistem, Tome 24 (2017) no. 6, pp. 730-742. http://geodesic.mathdoc.fr/item/MAIS_2017_24_6_a5/

[1] Martjugin P. V., “Nizhnie ocenki dliny kratchajshih berezhno sinhronizirujushhih slov dlja dvuh- i trjohbukvennyh chastichnyh avtomatov”, Diskretn. analiz i issled. oper., 15:4 (2008), 44–56 (in Russian) | MR | Zbl

[2] Gill A., “State-identification experiments in finite automata”, Information and Control, 4 (1961), 132–154 | DOI | MR | Zbl

[3] Martyugin P., “Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata”, Theory Comput. Syst., 54:2 (2014), 293–304 | DOI | MR | Zbl

[4] Hierons R. M., Jourdan G. V., Ural H., Yenigün H., “Using adaptive distinguishing sequences in checking sequence constructions”, Proc. of the 2008 ACM symposium on Applied computing (SAC), ACM, 2008, 682–687 | DOI

[5] Ito M., Shikishima-Tsuji K., “Some Results on Directable Automata”, Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, Lecture Notes in Computer Science, 3113, Springer, Berlin–Heidelberg, 2004, 125–133 | DOI | MR | Zbl

[6] Kohavi Z., Switching and Finite Automata Theory, McGraw-Hill, New York, 1978 | MR | Zbl

[7] Kushik N., El-Fakih K., Yevtushenko N., Cavalli A.R., “On adaptive experiments for nondeterministic finite state machines”, International Journal on Software Tools for Technology Transfer, 18:3 (2016), 251–264 | DOI

[8] Kushik N., López J., Cavalli A.R., Yevtushenko N., “Improving Protocol Passive Testing through 'Gedanken' Experiments with Finite State Machines”, Proc. 2016 IEEE International Conference on Software Quality, Reliability and Security (QRS), IEEE, 2016, 315–322 | DOI

[9] Kushik N., El-Fakih K., Yevtushenko N., “Preset and adaptive homing experiments for nondeterministic finite state machines”, Implementation and Application of Automata, CIAA 2011, Lecture Notes in Computer Science, 6807, 2011, 215–224 | DOI | MR | Zbl

[10] Kushik N., Yevtushenko N., “On the Length of Homing Sequences for Nondeterministic Finite State Machines”, Implementation and Application of Automata, CIAA 2013, Lecture Notes in Computer Science, 7982, 2013, 220–231 | DOI | MR | Zbl

[11] Lee D., Yannakakis M., “Testing finite-state machines: state identification and verification”, IEEE Trans. on Computers, 43:3 (1994), 306–320 | DOI | MR

[12] Moore E.F., “Gedanken-experiments on sequential machines”, Automata Studies, Annals of Mathematical Studies, 34, Princeton University Press, 1956, 129–153 | MR

[13] Sandberg S., “Homing and Synchronizing Sequences”, Model-Based Testing of Reactive Systems, Lecture Notes in Computer Science, 3472, 2005, 5–33 | DOI

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

[15] Volkov M.V., “Synchronizing Automata and the Černý Conjecture”, Language and Automata Theory and Applications, LATA 2008, Lecture Notes in Computer Science, 5196 \year 2008, 11–27 | DOI | MR | Zbl

[16] Kushik N.G, Yevtushenko N.V, Burdonov I.B., Kossatchev A.S, “Synchronizing and Homing Experiments for Input/output Automata”, System Informatics, 2017, no. 10, 1–9

[17] Yenigün H., Yevtushenko N., Kushik N., “The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs”, Information Processing Letters, 127 (2017), 49–53 | DOI | MR | Zbl