Open AccessTemporal feature analysis method describing for automata models of computation systems
Author(s) -
Michael Sinev,
M. A. Mitrokhin,
A.I Martyshkin,
I N Doroshenko,
Aleksey Dubravin,
M.S. Fedyashov,
A.V. Gorynina
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2094/3/032043
Subject(s) - computer science , automaton , computation , feature (linguistics) , representation (politics) , finite state machine , algorithm , state (computer science) , process (computing) , theoretical computer science , programming language , linguistics , philosophy , politics , political science , law
The paper reported the temporal feature analysis method describing for automata models of computation systems. The method is based on from source algorithm to modified algorithm expanding makes it possible to take characteristics of work process related to execution time measurement. The paper considers the transition method from source algorithm representation to modification a final state machine with additional states providing registration of temporal features. The paper demonstrates method usage example on computer system authorization algorithm, approves an algorithm complexity for features registration O(n) for n-states automata algorithm. The method can be used for a large class algorithm, but is recommended to apply it to an algorithm, separated on procedure thus mean of commands amount should be more than 500 for more time measurement accuracy.