RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2013 Volume 13, Issue 2(2), Pages 14–20 (Mi isu408)

Computer science

Identification of a state machine structure with finites fragment of behavior

S. A. Bogomolov

Saratov State Socio-Economic University, Russia, 410003, Saratov, Radishcheva st., 89

Abstract: Identification of a state machine structure with finite fragments of behavior is discussed. The state machine behavior is a set of various finite-sequential (f.-s.) functions realized in a state machine, and under a finite fragment of behavior we mean traces of f.-s. functions and state machines. The concept of an identifying trace for a state machine irredundant over its realization is introduced. The approach is suggested that enables to separate and descript in the set of traces identifying a state machine the finite set of irredundant traces consisting of only essential information for identification of a state machine.

Key words: state machine, experiments with a state machine, subexperiment of experiment, trace of f.-s. function and state machine, identifying trace of state machine, operation of trace reduction, irredundant identifying trace of state machine.

UDC: 519.95

DOI: 10.18500/1816-9791-2013-13-2-2-14-20



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024