Deriving checking sequences for nondeterministic FSMs
Most FSM based methods for test derivation are developed for initialized Finite State Machines (FSM) and the latter means that a reliable reset is assumed in an implementation under test in order to glue test sequences together. If the reset is rather expensive then the number of test sequences has...
| Published in: | Труды Института системного программирования РАН |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
2018-10-01
|
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/867 |