%0 Conference Proceedings
%T Refining the Specification FSM When Deriving Test Suites w.r.t. the Reduction Relation
%+ Tomsk State University [Tomsk]
%A Tvardovskii, Aleksandr
%Z Part 6: Short Contributions
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 29th IFIP International Conference on Testing Software and Systems (ICTSS)
%C St. Petersburg, Russia
%Y Nina Yevtushenko
%Y Ana Rosa Cavalli
%Y Hüsnü Yenigün
%I Springer International Publishing
%3 Testing Software and Systems
%V LNCS-10533
%P 333-339
%8 2017-10-09
%D 2017
%R 10.1007/978-3-319-67549-7_22
%K Finite state machines (FSM)
%K Nondeterministic FSM
%K Test derivation
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Finite State Machines (FSMs) are widely used when deriving tests for components of discrete event systems. In general, the specification FSM can be nondeterministic and in this case, a test suite with the guaranteed fault coverage is derived with respect to the reduction relation. However, when deriving such tests for nondeterministic FSMs, the existing methods return rather long test suites which cannot be used for real systems. In order to shorten a test suite, the set of possible implementation FSMs can be reduced. We present an approach for deriving shorter test suites for nondeterministic FSMs with respect to the reduction relation via refining the specification FSM.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01678992/document
%2 https://inria.hal.science/hal-01678992/file/449632_1_En_22_Chapter.pdf
%L hal-01678992
%U https://inria.hal.science/hal-01678992
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-10533