Checking experiments with non-observable tree FSMs
The paper addresses the problem of deriving preset checking experiments for non-observable FSMs. The fault model is considered to be a ‘white box’ where all possible implementations are explicitly enumerated. We show that if the specification FMS has a tree structure then it is possible to derive a...
Main Author: | N. . Kushik |
---|---|
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/937 |
Similar Items
-
Deriving checking sequences for nondeterministic FSMs
by: Anton Ermakov
Published: (2018-10-01) -
Deriving adaptive checking sequence for nondeterministic Finite State Machines
by: A. D. Ermakov, et al.
Published: (2018-10-01) -
Locating a faulty component of an EFSM composition
by: Svetlana Prokopenko
Published: (2018-10-01) -
On the model checking of finite state transducers over semigroups
by: A. R. Gnatenko, et al.
Published: (2018-10-01) -
Deriving adaptive distinguishing sequences for Finite State Machines
by: A. S. Tvardovskii, et al.
Published: (2018-10-01)