On one FSM Class with a Polynomial Number of States in Observable Form
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 1 (2008) no. 3, pp. 257-261
Cet article a éte moissonné depuis la source Math-Net.Ru
This work is devoted to the description of some property of a finite state machine (FSM), which allows one to speak about polynomial number of states in observable form of a FSM. The observable form is an essential part of the vast variety of methods for testing and optimization of systems, based on FSM model.
Keywords:
finite state machine, the observable form of a finite state machine, reduction to an observable form.
@article{JSFU_2008_1_3_a3,
author = {Maxim L. Gromov and Ol'ga V. Kondratyeva},
title = {On one {FSM} {Class} with {a~Polynomial} {Number} of {States} in {Observable} {Form}},
journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
pages = {257--261},
year = {2008},
volume = {1},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/JSFU_2008_1_3_a3/}
}
TY - JOUR AU - Maxim L. Gromov AU - Ol'ga V. Kondratyeva TI - On one FSM Class with a Polynomial Number of States in Observable Form JO - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika PY - 2008 SP - 257 EP - 261 VL - 1 IS - 3 UR - http://geodesic.mathdoc.fr/item/JSFU_2008_1_3_a3/ LA - ru ID - JSFU_2008_1_3_a3 ER -
%0 Journal Article %A Maxim L. Gromov %A Ol'ga V. Kondratyeva %T On one FSM Class with a Polynomial Number of States in Observable Form %J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika %D 2008 %P 257-261 %V 1 %N 3 %U http://geodesic.mathdoc.fr/item/JSFU_2008_1_3_a3/ %G ru %F JSFU_2008_1_3_a3
Maxim L. Gromov; Ol'ga V. Kondratyeva. On one FSM Class with a Polynomial Number of States in Observable Form. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 1 (2008) no. 3, pp. 257-261. http://geodesic.mathdoc.fr/item/JSFU_2008_1_3_a3/
[1] A. Petrenko, N. Yevtushenko, “Conformance Tests as Checking Experiments for Partial Nondeterministic FSM”, Proceedings of the 5th International Workshop on Formal Approaches to Testing of Software (Fates 2005), Lecture Notes Comput. Sci., 3997, Springer, Berlin, 2005, 118–133
[2] N. V. Evtushenko, A. F. Petrenko, M. V. Vetrova, Nedeterminirovannye avtomaty: analiz i sintez. Ch. 1. Otnosheniya i operatsii, Uchebnoe posobie, TGU, Tomsk, 2006
[3] G. P. Agibalov, A. M. Oranov, Lektsii po teorii konechnykh avtomatov, TGU, Tomsk, 1984
[4] B. A. Trakhtenbrot, Ya. M. Barzdin, Konechnye avtomaty (povedenie i sintez), Nauka, M., 1970 | MR | Zbl