On the possibilities of FSM description of Parallel composition of Timed Finite State Machines
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 composition of two types of Timed Finite State Machine...
Main Authors: | A. S. Tvardovskii, A. V. Laputenko |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/451 |
Similar Items
-
FSM abstraction based method for deriving test suites with guaranteed fault coverage against nondeterministic Finite State Machines with timed guards and timeouts
by: Aleksandr Sergeevitch Tvardovskii, et al.
Published: (2019-10-01) -
Deriving Homing Sequences for Finite State Machines with Timed Guards
by: Aleksandr Sergeevich Tvardovskii, et al.
Published: (2020-12-01) -
Solving parallel equations for Finite State Machines with Timeouts
by: O. . Kondratyeva, et al.
Published: (2018-10-01) -
Deriving adaptive distinguishing sequences for Finite State Machines
by: A. S. Tvardovskii, et al.
Published: (2018-10-01) -
Experiments on Parallel Composition of Timed Finite State Machines
by: A. P. Sotnikov, et al.
Published: (2018-10-01)