Combined Function and Trace Test

摘要

While testing based on finite state machines has been extensively investigated in the literature, issues concerning testing based on extended finite state machines (EFSMs) have not been adequately addressed. An EFSM is a finite state machine in which each transition is labelled by the name of a function (or a relation) defined on a set of input, output and internal variables. Testing on the basis of EFSMs is especially complicated due to the fact that an EFSM transition transforms a large (some-time infinite) set of data in contrast to just one value in a finite state machine. Moreover, it is generally not possible to identify, which transition has occurred in an EFSM. These problems manifest themselves in the relationship between function and trace test. By function test we mean the test of individual functions of the software which are responsible for the transformation of data. Each function can be triggered by certain inputs in certain internal states. By trace test, or testing the dynamic behaviour, we mean the test of traces (sequences) of functions.