A Method of the Complete Test Derivation For Labeled TransitionSystems
This paper is devoted to the problem of the complete test derivation for Labeled Transition Systems (LTS). It is suggested to transform an LTS to correspondent Finite State Machine (FSM) for which methods of derivation of complete tests are known. For this operations of transformation an LTS to FSM and FSM-test to LTS-test are defined.
Download file
Counter downloads: 335
Keywords
complete test , test , Finite State Machine , labeled Transition System , пересечение автоматов , пересечение полуавтоматов , полный проверяющий тест , тест , автомат , полуавтомат , intersection of LTSes , intersection of FSMsAuthors
| Name | Organization | |
| Gromov M.L. | gromov@sibmail.com |
References
Gromov M., Willemse T.A. Model-based testing techniques for diagnosis. Willemse: Testing and Model-Checking Techniques for Diagnosis // Proceedings of the Test Com in LNCS, 2007. P. 138 - 154.
Tretmans J. Test generation with inputs, outputs and repetitive quiescence // Software-Concepts and Tools. 1996. 17(3). P. 103 - 120.
Petrenko A., Yevtushenko N. Conformance tests as checking experiments for partial nondeterministic FSM // Proceedings of the 5th International Workshop on Formal Approaches to Testing of Software in LNCS. 2005. P. 118 - 133.
