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: | |
|---|---|
| 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 |
| _version_ | 1828417125832720384 |
|---|---|
| author | N. . Kushik |
| author_facet | N. . Kushik |
| author_sort | N. . Kushik |
| collection | DOAJ |
| description | 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 complete checking experiment that has polynomial length. |
| first_indexed | 2024-12-10T14:14:51Z |
| format | Article |
| id | doaj.art-d1738ff633854bdebc4fb746bfcfc223 |
| institution | Directory Open Access Journal |
| issn | 2079-8156 2220-6426 |
| language | English |
| last_indexed | 2024-12-10T14:14:51Z |
| publishDate | 2018-10-01 |
| publisher | Ivannikov Institute for System Programming of the Russian Academy of Sciences |
| record_format | Article |
| series | Труды Института системного программирования РАН |
| spelling | doaj.art-d1738ff633854bdebc4fb746bfcfc2232022-12-22T01:45:22ZengIvannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-0127644145010.15514/ISPRAS-2015-27(6)-28937Checking experiments with non-observable tree FSMsN. . Kushik0Томский государственный университет; Телеком Южный Париж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 complete checking experiment that has polynomial length.https://ispranproceedings.elpub.ru/jour/article/view/937конечный автомат, недетерминированный (ненаблюдаемый) автомат, древовидный автомат, проверяющий эксперимент |
| spellingShingle | N. . Kushik Checking experiments with non-observable tree FSMs Труды Института системного программирования РАН конечный автомат, недетерминированный (ненаблюдаемый) автомат, древовидный автомат, проверяющий эксперимент |
| title | Checking experiments with non-observable tree FSMs |
| title_full | Checking experiments with non-observable tree FSMs |
| title_fullStr | Checking experiments with non-observable tree FSMs |
| title_full_unstemmed | Checking experiments with non-observable tree FSMs |
| title_short | Checking experiments with non-observable tree FSMs |
| title_sort | checking experiments with non observable tree fsms |
| topic | конечный автомат, недетерминированный (ненаблюдаемый) автомат, древовидный автомат, проверяющий эксперимент |
| url | https://ispranproceedings.elpub.ru/jour/article/view/937 |
| work_keys_str_mv | AT nkushik checkingexperimentswithnonobservabletreefsms |