On the verification of strictly deterministic behavior of Timed Finite State Machines
Finite State Machines (FSMs) are widely used as formal models for solving numerous tasks in software engineering, VLSI design, development of telecommunication systems, etc. To describe the behavior of a real-time system one could supply FSM model with clocks - a continuous time parameters with real...
Main Authors: | E. M. Vinarskii, V. A. Zakharov |
---|---|
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/538 |
Similar Items
-
Experiments on Parallel Composition of Timed Finite State Machines
by: A. P. Sotnikov, et al.
Published: (2018-10-01) -
On the minimization of timed Finite State Machines
by: Alexandre Tvardovskiy
Published: (2018-10-01) -
Minimizing Finite State Machines with time guards and timeouts
by: A. S. Tvardovskii, et al.
Published: (2018-10-01) -
The effect of partiality and adaptivity on the complexity of FSM state identification problems
by: H. Yenigun, et al.
Published: (2018-10-01) -
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)