| Summary: | 博士 === 國立交通大學 === 資訊工程學系 === 86 === Evolution of communication networks has led toward increasingly
complexprotocols to interconnect heterogeneous system.In order
to functionproperly,individual vendor''s implementation should be
tested to verifythat it conforms to the relevant protocol
specification,i.e.,conformancetesting. Moreover, fault diagnosis
further identifies the location of the implementation faults.
For efficientlyu executing the conformance testing and fault
diagnosis, this thesis aims at solving three related problems:
minimum-length state verification, homogeneous Finite State
Machines(FSMs) minimization, and distanced testers
synchronization,respectively.First, since an Implementation
Under Test(IUT) is typically regarded as black box, state
verification is then related to the problem of derivingan input/
output sequence which can be used to determine if the IUT
iscurrently in a particular state. Although the approach of the
UniqueInput/Output (UIO) sequence has been utilized as an
efficient techniquefor state verification, some states in a
protocol, however, may possessno UIO sequences. A substitute
method of the input/output sequence, called a signature, for a
state without a UIO sequence is thus employed. The first goal
of the thesis is to propose an efficient algorithm of
constructing the minimum-length signature. Second, to identify
potentialfaulty implementations caused by a transfer error in
the protocolspecification, cross verification over the
corresponding FSMs is performedafter all potential faulty FSMs
have been minimized. Existing minimizationalgorithms become
inefficient due to the lack of taking advantage of the
homogeneity of these potential faulty FSMs. The second goal of
the thesis is to propose a two-phase algoritm for the efficient
and simultaneous minimization of a set of homogeneous faulty
FSMs. Experimental resultsshow that the algorithm renders the
minimization complexity greatly reduced for most relistic
protocol FSMs. Finally, conformance testing may lead tothe
synchronization problem should predetermined test sequences be
appliedto multiple distanced testers, namely under the multi-
party configuration.The third goal of the thesis is to propose a
novel synchroniation paradigmwhich seamlessly unifies two
synchronization techniques, theself-synchronizable wequence and
the external synchronization operation.To demonstrate the
viability of the proposed paradigm, the thesis also presents the
generations of two synchronizable sequences, namely
thesynchronizable preamble and the synchronizable distinguishing
sequence,which have previously been used for the testing of the
correctness of a protocol''s transition.
|
|---|
