Zobrazeno 1 - 10
of 177
pro vyhledávání: '"Tvardovskii, A."'
Publikováno v:
In Science of Computer Programming March 2024 233
Publikováno v:
Моделирование и анализ информационных систем, Vol 27, Iss 4, Pp 376-395 (2020)
State identification is the well-known problem in the theory of Finite State Machines (FSM) where homing sequences (HS) are used for the identification of a current FSM state, and this fact is widely used in the area of software and hardware testing
Externí odkaz:
https://doaj.org/article/6f14f6811a2b499cb651d044ce3f1ecc
Publikováno v:
Труды Института системного программирования РАН, Vol 31, Iss 4, Pp 175-188 (2019)
Finite State Machine (FSM) based approaches are widely used for deriving tests with guaranteed fault coverage for discrete event systems and as the behavior of many nowadays information and control systems depends on time, classical FSMs are extended
Externí odkaz:
https://doaj.org/article/d36a2519d0bf410c841a8b5c0ff9935d
Publikováno v:
In IFAC PapersOnLine 2018 51(7):486-492
Autor:
A. S. Tvardovskii, A. V. Laputenko
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 1, Pp 25-40 (2018)
Finite State Machines (FSMs) are widely used for analysis and synthesis of digital components of control systems. In order to take into account time aspects, timed FSMs are considered. In this paper, we address the problem of deriving a parallel comp
Externí odkaz:
https://doaj.org/article/6ee4b06eb1d048aa92c96f66ed853973
Autor:
A. S. Tvardovskii, N. V. Yevtushenko
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 4, Pp 139-154 (2018)
FSM (Finite State Machines) are widely used for deriving tests with guaranteed fault coverage for control systems. Distinguishing sequences (DS) are used in FSM based testing for state identification and can significantly reduce the size of a returne
Externí odkaz:
https://doaj.org/article/a254e69ff3354fedbba8956d26ed0fb1
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 139-154 (2018)
Finite State Machines (FSMs) are widely used for analysis and synthesis of components of control systems. In order to take into account time aspects, timed FSMs are considered. As the complexity of many problems of analysis and synthesis of digital a
Externí odkaz:
https://doaj.org/article/609ca53496614422baf76d893081ee87
Publikováno v:
Моделирование и анализ информационных систем, Vol 24, Iss 4, Pp 496-507 (2017)
Nowadays, the behaviour of many systems can be properly described by taking into account time constraints, and this motivates the adaptation of existing Finite State Machine (FSM)- based test derivation methods to timed models. In this paper, we prop
Externí odkaz:
https://doaj.org/article/8c30b7b1dd934f96945a58ff291abf6e
Autor:
A. S. Tvardovskii, N. V. Yevtushenko
Publikováno v:
Automatic Control and Computer Sciences. 55:738-750
Publikováno v:
Computer Journal; Sep2023, Vol. 66 Issue 9, p2181-2190, 10p