Check Transition Extended Automation on Base Cut
In given work is offered method of the building checking test for extended automaton on base distinguishing sequences in special cut of the automaton of the source extended automaton i.e. in its simplified to versions. The sufficient conditions are fixed, under which sequences, distinguishing two conditions in cut, distinguish these conditions in source extended automaton.
Download file
Counter downloads: 324
Keywords
расширенный автомат , контекстно-свободный расширенный автомат , различающая последовательность , extended automaton , R-cut , FSM-cut , context-free extended automaton , distinguishing sequenceAuthors
Name | Organization | |
Mihaylov Yu.V. | Mikhailov_Y@sibmail.com | |
Kolomeec A.V. | admiral@sibmail.com |
References
Petrenko A., Boroday S., Groz R. Confirming configurations in EFSM // IEEE TSE. 2004. V. 30/1. P. 29 - 42.
El-Fakih K., S. Prokopenko, N. Yevtushenko, G. Bochmann. Fault diagnosis in extended Finite State Machine // Lecture Notes in Computer Science. 2003. P. 197 - 210.
Petrenko A., Yevtushenko N., Bochmann G.A. Fault models for testing in context // Proc. of the IFIP 1st Joint International Confeence FORTE/PSTV. Chapman & Hall, 1996. P. 163 -178.
El-Fakih K., Kolomeez A., Prokopenko S., Yevtushenko N. Extended finite state machine based test derivation driving by user defined faults // International Conference ICST, 2008.
