CN102244590A - Status verification method in protocol conformance test - Google Patents
Status verification method in protocol conformance test Download PDFInfo
- Publication number
- CN102244590A CN102244590A CN2010101675843A CN201010167584A CN102244590A CN 102244590 A CN102244590 A CN 102244590A CN 2010101675843 A CN2010101675843 A CN 2010101675843A CN 201010167584 A CN201010167584 A CN 201010167584A CN 102244590 A CN102244590 A CN 102244590A
- Authority
- CN
- China
- Prior art keywords
- state
- tested
- candidate
- checking
- list entries
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 82
- 238000012360 testing method Methods 0.000 title claims abstract description 64
- 238000012795 verification Methods 0.000 title claims abstract description 23
- 238000003745 diagnosis Methods 0.000 claims abstract description 36
- 230000007704 transition Effects 0.000 claims description 35
- 239000011159 matrix material Substances 0.000 claims description 9
- 238000006467 substitution reaction Methods 0.000 claims description 6
- 239000000203 mixture Substances 0.000 claims description 5
- 230000001143 conditioned effect Effects 0.000 claims description 3
- 238000005457 optimization Methods 0.000 claims description 2
- 230000000875 corresponding effect Effects 0.000 description 20
- 230000008569 process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008676 import Effects 0.000 description 3
- 230000008520 organization Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000010998 test method Methods 0.000 description 2
- 238000013518 transcription Methods 0.000 description 2
- 230000035897 transcription Effects 0.000 description 2
- 230000000052 comparative effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005284 excitation Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Landscapes
- Maintenance And Management Of Digital Transmission (AREA)
Abstract
The invention discloses a status verification method in a protocol conformance test. Based on an FSM (finite state machine)/EFSM (extended finite state machine) model, the method comprises the following steps: firstly verifying whether implementation under test (IUT) conforms to a correct input condition; constructing a diagnosis input sequence and a candidate status set which correspond to a status to be verified; and verifying whether the tested status U in the IUT is the status S to be verified or whether the tested status is a certain status in a candidate status set corresponding to the status S to be verified. The status verification method has the advantages of strong verification capability and high efficiency.
Description
Technical field
The present invention relates to the state verification method in a kind of testing protocol consistency, belong to based on the cycle tests generation of FSM/EFSM model and the error diagnosis field in the testing protocol consistency, wherein FSM (Finite State Machine) is a finite-state automata, and EFSM (Extended FiniteState Machine) is the extended finite state automaton.
Background technology
Pointed as ISO/IEC 9646 (Open System Interconnection--protocol conformance test method and framework), the main target of testing protocol consistency is whether the tested agreement of checking realizes consistent with the corresponding protocol standard.Agreement is that two or more communication entities connect each other with communicate by letter one group rule and behavior and retrain, and it has guaranteed between the communication entity that pattern communicates according to the rules.Therefore, testing protocol consistency in occupation of extremely important status, is that agreement is implemented in the network indispensable part before the actual deployment in protocol engineering.
The ISO of International Standards Organization has formulated a cover international standard-ISO/ worker EC 9646, for testing protocol consistency provides basic skills and framework, for abstract test suite has been worked out design procedure and describing method, and provides guidance for realization of test system.ISO/IEC 9646 has described a method in common opinion, in order to test the consistency of a product of claiming to have realized a certain osi protocol and respective protocol standard.Yet ISO/IEC 9646 standards do not relate to formal cycle tests and generate and relevant regulations, do not relate to concrete error diagnosis technology yet.In testing protocol consistency, cycle tests is one group of test activity set with certain ordinal relation, and it has indicated tests required particular content and step.It is the core content of error detector process that cycle tests generates, and has directly determined the efficient and the quality of error detector.Formal cycle tests generates the wrong covering power that can improve test and certain automatic test ability is provided, and is one of core technology in the uniformity test.
In formalization cycle tests generation technique, it is the basic steps that the dependence test sequence generates that protocol specification is carried out formalized description.The state automata model is a kind of protocol description method of comparative maturity, and the state automata model that is most widely used at present is finite-state automata (FSM) model and extended finite state automaton (EFSM) model.In the FSM model, s is used in state transition (or claiming the limit)
i* x → s
j* y represents that its implication is: be in state s in system
iThe time, if system is applied input x (input can be understood as the excitation to system, can represent different inputs with incoming symbol), the then s that gets the hang of of system
jAnd output symbol y (output can be understood as the response of system, can represent different output with output symbol).Wherein, state s
iHead (or initial) state that is called this state transition, state s
jTail (or termination) state that is called this state transition.In addition, in above-mentioned mark, also available t (s
i, x) be illustrated in state s
iThe following state that incoming symbol x entered (is s
j).In the present invention, the element in the state transition except that state is called as the state transition tag element, and (in illustraton of model) these elements are formed the label that is marked on the limit, and for example: the state tag of FSM model is " incoming symbol/output symbol "; In the EFSM model, the label of state transition is " incoming symbol/output symbol/variable operation ".
At present, obtained long term studies and development, and obtained using widely based on the cycle tests generation technique of FSM/EFSM model.In existing method for creating test sequence based on the FSM model, relatively typical method comprises UIO (Unique Input/Output) method, W method, Wp method, SC method, DS (Distinguishing Sequence) method, C method and T method etc.The main target of these methods is the cycle testss that generate high wrong coverage rate, whether meets corresponding standard with the checking system under test (SUT).
The DS method relates to two stages, i.e. state verification stage and state transition test phase.In the state verification stage, use distinguishing sequence that state is identified.Distinguishing sequence is defined as: establish X
0Be a list entries (being the incoming symbol string), if with X
0Obtain different output sequence (output symbol string) when being applied to different states, then claim X
0Be distinguishing sequence.The C method is also referred to as the characteristic sequence method, and it identifies state with feature set.Feature set is made up of list entries, can be expressed as C={C
1, C
2..., C
s, and satisfy: when the cycle tests among the C was applied to any two different conditions among the standard FSM, resulting output sequence all was inequality.Each element (cycle tests) among the C is called as characteristic sequence.When C only comprised an element, the unique characteristic sequence that comprises was exactly a distinguishing sequence.In the UIO method, suppose to exist an I/O sequence can identify each state that this sequence is called uio sequence.Formally, state s
iUio sequence (be designated as UIO
i) be an energy is distinguished this state from other state I/O sequence with minimum length.The W method identifies state by feature set, and feature set is related with output symbol.The Wp method is the improvement to the W method, and it utilizes in the W method subclass of feature set to remove to carry out state verification, so this method can reduce the length of cycle tests.In the Wp method, different conditions uses different subclass to carry out state verification.
Main target based on the method for creating test sequence of FSM model is whether the test system under test (SUT) meets corresponding standard, is the whole conforming technological means of a kind of checking.In some method for creating test sequence (method of Jie Shaoing as mentioned), relate to status indicator (or claiming checking), but this status indicator is at the described FSM model of protocol specification (being called standard FSM) to state automata based on the FSM model.When having mistake in agreement realizes, above-mentioned status indicator method can't be verified (judging promptly whether tested state is the state of certain appointment among the standard FSM) to tested state, thereby the diagnosis that leads to errors is difficult to effectively carry out.Output symbol mistake (being that certain response that agreement realizes is carried out not according to standard) and transcription error (state that certain state transition entered that is the agreement realization is not the corresponding states among the standard FSM) are two kinds of main causes that cause above-mentioned situation, shown in Figure of description 1 (a), " a/b, c/d " is state s
1Uio sequence, but under the erroneous condition shown in Fig. 1 (b), this sequence is no longer distinguished state s
1, promptly can't judge whether certain tested state is state s by this sequence
1In error diagnosis process, there are the problems referred to above equally in the checking of designated state based on the EFSM model.
In general, in the testing protocol consistency based on the FSM/EFSM model, error diagnosis is the relatively weaker link of a research.At present, there is under the situation of uncertain mistake the method that the state during still unmatchful agreement realizes is accurately verified.
Summary of the invention
Because after utilization finds that based on the protocol conformance test method of FSM/EFSM model agreement realizes having mistake, because transcription error or/and the quantity of output error and position can't determine, in the error diagnosis process, be difficult to problem that designated state is judged, whether the invention provides the state verification method in a kind of testing protocol consistency (based on the FSM/EFSM model), be that certain state of standard FSM/EFSM model is verified with designated state during agreement is realized.
The present invention is by the following technical solutions:
This invention is the state verification method in the testing protocol consistency, and this method adopts following steps based on FSM/EFSM model and its:
1) checking is prepared: a given tested realization, this tested state s that realizes a tested state u in corresponding standard FSM/EFSM model, this tested realization and intend checking;
2) suppose the correct condition establishment of input if described tested realization meets the correct conditioned disjunction of input for diagnostic message is provided, then standard FSM/EFSM model is stored with predetermined data structure.Otherwise, method ends;
3) obtain based on standard FSM/EFSM model and intend pairing diagnosis list entries of proofing state s and candidate state set, and other the tested state verified in the described tested realization of preparing against store in the diagnosis list entries that will obtain and candidate state set;
4) if the number of elements in the set of candidate state described in the step 3) surpasses candidate's threshold value, then abandon proceeding this method; Otherwise, enter next step;
5) according to the pairing diagnosis list entries of state s of the plan checking of finding in the step 3) tested state u is tested, observe corresponding test result, obtain the state verification conclusion, that is: whether tested state u is the state s that intends checking in the tested realization, or whether this tested state is the some states during the pairing candidate state of state s of intending checking is gathered.
In the testing protocol consistency process, the main target of error diagnosis is the position that misjudgment takes place, and the state in therefore need realizing agreement is discerned.According to technical solution of the present invention the state verification method, can not consider whether mistake of output symbol, be difficult to the effectively problem of identification thereby overcome or alleviated the state that is caused owing to the output symbol mistake, improved the stationkeeping ability of error diagnosis to a certain extent.The state verification ability of this method can be analyzed before test, thereby has avoided unnecessary test.In addition, the concrete state verification ability of method is relevant with corresponding standard FSM/EFSM model, is somewhat dependent upon the degree fully (being the ratio of standard incoming symbol quantity with whole incoming symbol quantity of state in the model) of model specification incoming symbol definition.Generally speaking, if the degree fully of the standard incoming symbol of certain state is more little, then the candidate state collection of this state is more little, and the state verification ability of this method is strong more.Usually, particularly in communication protocol, the average definition of standard incoming symbol is spent less, proposed by the invention method fully and is had high state recognition ability.For example, in model shown in Figure 2 (model source: Yujun Zhang and Zhongcheng Li, Hierarchical Protocol Description and Test Genration Method forMobile IPv6 Testing) in, the average definition of standard incoming symbol is spent lower fully.(suppose that all states can turn to free position) under worst case, this model is s only
6And s
7The pairing candidate state collection of diagnosis list entries size be 2, the size of other candidate state collection is 1, promptly this example has very strong state verification ability.
Said method, the correct condition optimization of described input carry out the test of standard incoming symbol at tested realization in the unit testing that is associated is satisfied.
Said method, standard FSM/EFSM model is with matrix structure or link-list structure storage, and if adopt the matrix structure storage, palpus is distinguished the state transition tag element; If adopt the adjacency list structure storage, then node elements is corresponding with the element of state transition label.
Said method, the storage element type of matrix structure is a character string forms, the state transition tag element of being distinguished comprises that any incoming symbol, output meet and the variable assignments operation, and adopts the escape symbolic notation that the state transition tag element is distinguished; This escape symbolic notation adopts “ " the expression list separator, if tag element comprises “ " symbol, and then use “ " symbolic substitution; When above-mentioned method for expressing is carried out semantic interpretation, single appearance " " symbol is separator, continuous two of occurring of order " " symbol with a symbol " " symbolic substitution returns.
Said method, at first obtain in the described step 3) and originate in the corresponding list entries carried out of intending the state s of checking, and then choose the list entries carried out that can make a distinction other state maximum possible in corresponding state and the model as diagnosing list entries based on standard FSM/EFSM model; And the set of getting the undistinguishable state composition of diagnosis list entries is gathered as the pairing candidate state of the state s that intends checking.
Preferably, described candidate's threshold value is made as less value, as 2 or 3.
Preferably, when the size of the pairing candidate state set of the state s that intends checking is 1, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, the state s of then tested state u for intending verifying, otherwise tested state u is not the state s that intends checking; When the size of the candidate state of state s set greater than 1 the time, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, then tested state u is a state in the pairing candidate state set of intending verifying of state s, otherwise tested state u is not in the candidate state set of the state s that intends checking.
Description of drawings
Below in conjunction with Figure of description technical scheme of the present invention is further elaborated, wherein:
Fig. 1 is FSM error instance figure, and wherein figure (a) is a standard FSM model, and figure (b) is that wrong FSM realizes.
Fig. 2 is a MIPv6 mobile node state transition graph.
Fig. 3 is based on the state verification method flow diagram in the testing protocol consistency of technical solution of the present invention, and wherein figure (a) is the condition express method block diagram, and figure (b) is the state representation entity relationship.
Fig. 4 is the adjacency list storage node composition of FSM/EFSM, and wherein figure (a) is a state automata model adjacency list overall construction drawing, and figure (b) is FSM model adjacency list node structure figure, and figure (c) is EFSM model adjacency list node structure figure.
Fig. 5 is state s
iInput forwarding tree structure schematic diagram.
Embodiment
The present invention relates to some new notions, comprise diagnosis list entries, the candidate state set of state and import correct condition, at first these notions are described below.
If an incoming symbol has clear and definite definition (being that state s can accept this incoming symbol) to certain state s in given standard, claim that then this symbol is the standard incoming symbol of state s.When incoming symbol of input under certain state s, may there be following situation in output: export normal symbol 1.; 2. without any output, but this situation should have normal output in standard FSM/EFSM model; 3. newspaper output error.The output of above-mentioned back two kinds of situations is referred to as improper output.
If the non-standard incoming symbol of this state of input under designated state then claims to produce an output and interrupts.Claim described output to be output as when interrupting taking place and interrupt output.Do not have the output disruption if list entries α is applied in state s when (referring to begin to import successively incoming symbol the α from state s), this sequence is called as the list entries carried out that originates in state s.Attention: can carry out list entries at standard FSM/EFSM model definition.Can not carry out other state t if originate in the list entries carried out of state s, claim that then state s and t are differentiable.
Formally, under certain state s the input certain standard incoming symbol (when being designated as a), the state set that may enter be designated as C (s, a).The further created symbol C ' of the present invention (S, i).Formally, establish S set={ e
1, e
2..., e
t, then C ' (S, i)=C (e
1, i) ∪ ∪ C (e
2, i) ∪ ... ∪ C (e
t, i).If " i
0, i
1..., i
k" list entries of expression, when this sequence is applied in state s
0When last, the sequence that gets the hang of is " s
1, s
2..., s
k", then satisfy:
(1)s
1∈C(s，i
0)；
(2)s
m∈C′(C′(C′...(C′(C(s，i
0)，i
1)...)，i
m-2)，i
m-1)，1＜m≤k。
If certain can be carried out list entries and state s can be made a distinction with other state to greatest extent, claim then this can carry out list entries and be the diagnosis list entries that the set that claims undistinguishable other state and this state to form is the pairing candidate state set of this diagnosis list entries (or state s).For simplifying conveniently, this programme will diagnose list entries to be called DI (Distinguishing Input) sequence sometimes.
In existing method for creating test sequence based on the FSM/EFSM model, most methods suppose that reasonably the corresponding states in the realization can accept all standard incoming symbols.The present invention further reasonably supposes the corresponding states energy in realizing and only can accept all standard incoming symbols, and claims this to be assumed to the correct supposition of input.Accordingly, import correct condition refer to standard FSM/EFSM model in realization the corresponding states energy and only can accept all standard incoming symbols.Importing correct condition can be satisfied by in the relevant unit testing of state simple dependence test being carried out in input.In common test practice, this test tends to carry out or part is carried out, and this programme only explicitly calls for it, its concrete operations is not described in detail.
With reference to the state verification method in the testing protocol consistency shown in the Figure of description 3, this method adopts following steps based on FSM/EFSM model and its:
1) checking is prepared: a given tested realization, this tested standard FSM/EFSM that realizes correspondence
Tested state u and intend the state s of checking in model, this tested realization;
2) suppose the correct condition establishment of input if described tested realization meets the correct conditioned disjunction of input for diagnostic message is provided, then standard FSM/EFSM model is stored with predetermined data structure.Otherwise, method ends;
3) obtain based on standard FSM/EFSM model and intend pairing diagnosis list entries of proofing state s and candidate state set, and other the tested state verified in the described tested realization of preparing against store in the diagnosis list entries that will obtain and candidate state set;
4) if the number of elements in the set of candidate state described in the step 3) surpasses candidate's threshold value, then abandon proceeding this method; Otherwise, enter next step;
5) according to the pairing diagnosis list entries of state s of the plan checking of finding in the step 3) tested state u is tested, observe corresponding test result, obtain the state verification conclusion, that is: whether tested state u is the state s that intends checking in the tested realization, or whether this tested state is the some states during the pairing candidate state of state s of intending checking is gathered.
In the Figure of description 3, provided the adjacency list storage node composition of FSM/EFSM model.In Fig. 3, suppose that the state automata model has k state, wherein be s
0Initial state has the individual state transition of n (i) with state s
i(0≤i≤k) is a start node, symbol s
I, lExpression is from state s
iThe shape of tail attitude of l the state transition of setting out.
As indicated above, importing correct condition can satisfy by following simple restriction: carry out the test of standard incoming symbol at tested realization in the unit testing that is associated, and testing out the input correction work of being correlated with during correct condition that do not meet, promptly software (or system) is not met the correct condition part of input and correct or perfect, make it meet the correct condition of input.If defer to above-mentioned restriction in dependence test, then tested realization meets the correct condition of input., a kind of false judgment supposes that the correct condition of input satisfies, and then also carries out follow-up condition diagnosing process if being provided.Those skilled in the art can select according to actual needs.
Standard FSM/EFSM is with matrix structure or link-list structure storage, and if adopt the matrix structure storage, palpus is distinguished the state transition tag element; If adopt the adjacency list structure storage, then node elements is corresponding with the element of state transition label.
Preferably, if adopting matrix structure stores, then element type is a character string forms, the state transition tag element of being distinguished comprises that at least any incoming symbol, output meet and the variable assignments operation, and adopts the escape symbolic notation that the state transition tag element is distinguished to satisfy the needs of data retrieval; This escape symbolic notation adopts “ " the expression list separator, if tag element comprises “ " symbol, and then use “ " symbolic substitution; When above-mentioned representation is carried out semantic interpretation, single appearance " " symbol is separator, continuous two of occurring of order " " symbol with one " " symbolic substitution returns.
For satisfying the requirement of method, the obtaining of described diagnosis list entries comprises at first obtains the list entries carried out based on standard FSM/EFSM model that originates in corresponding states s, and then chooses the list entries carried out that can make a distinction other state maximum possible in corresponding state and the model as the diagnosis list entries; And the set of getting the undistinguishable state composition of diagnosis list entries is the pairing candidate state set of s.
Further, a kind of preferred mode in order to obtain diagnosing list entries, is introduced input and is comprised collection and two notions of input transition tree, is introduced respectively below.All standard incoming symbol set of this state of standard incoming symbol set expression of designated state.In the given state automaton model, the set of the standard incoming symbol of different conditions may be different, also may be identical.If the set of the standard incoming symbol of two states is identical, claim that then these two states are that input is of equal value.Further, the input of introducing state (being made as s) comprises collection, is designated as S
I +(s), satisfy:
Wherein, the standard incoming symbol set of I (s) expression state s promptly comprises the set of all standard incoming symbols of state s.
In order to explain and make up the DI sequence of state, this programme is introduced a kind of special tree structure---the input transition tree.Each transition tree is corresponding with the state institute that determines, has described the state that a certain state transition under the correct supposition of input may enter.In transition tree, each node (being made as N) all is positioned at certain level (being designated as lev (N)), is defined as follows:
Wherein, the father node of p (N) expression node N.In transition tree, state of node (except that root node) expression, and use this status indication, claim that the state of mark is a node state.Therefore, the flag state of the different nodes in the forwarding tree may be identical.In the input transition tree, the node that node state is identical can be distinguished by tree hierachy.
For state s, its input transition tree organization definition is as follows:
(1) the tree root node is a dummy node;
(2) child of tree root node is that status indication is S
I +(s) node of each state in (comprise the node itself that is labeled as state s, and claim that this node is an identification nodes);
(3) establish the state that x is certain downstream node institute mark of identification nodes in the i layer, a is any standard incoming symbol of this state, then for C (x, a) each state (being made as e) in, a newly-built node that status indication is e, and with symbol a to corresponding tree limit mark in addition.
In above-mentioned definition, S
I +(s) node except that being labeled as s is called the sign reference node in the set.In addition, identification nodes is that the subtree of root is called the sign subtree in the transition tree.Fig. 5 has provided the structural representation of input transition tree.In the figure, s
I, jExpression S
I +(s
i) remove s in the set
iJ outer state, I
I, jExpression state s
iJ standard incoming symbol, c (i) represents from state s
iStandard incoming symbol quantity.Fig. 5 has only provided the structure of three levels, and further structure can be expanded by said method.The structure of forwarding tree is referring to the algorithm 1 shown between two following dotted lines.
Next the method for being derived the DI sequence by the input transition tree is described.Be similar to uio sequence, the present invention T (s
i, α) list entries of expression, this sequence can be with automaton from state t (s
i, α) take state s to
i(mark t (s
i, α) expression is to state s
iApply the state that is arrived behind the list entries).If state s by algorithm 1 structure
iThe total x bar of sign subtree in the pairing forwarding tree is from s
iTo the path of leaf node, the cascade of incoming symbol is designated as β respectively on each paths
1, β
2..., β
xThen diagnose list entries to be:
β
1T(s
i，β
1)β
2T(s
i，β
2)…β
iT(s
i，β
i)…β
x-1T(s
i，β
x-1)β
x
Algorithm 1: make up diagnosis list entries and candidate state collection
1:procedure FINDDI (M, s
iThe M of) //is standard FSM/EFSM; s
iState for appointment.
2: create tree root node r;
Establishment is labeled as s
uNew node, this joint
Point is the child node of root; C
Candidate← S
+ IO(s
i); Lev ← 1 //C
CandidateFor waiting
Select state set
3: if C
CandidateOnly comprise s
i, conti ← false then; Otherwise, conti ← true;
4:while conti is true, and there is not the node do with invalid flag in the lev layer
In the 5:for sign subtree in the lev layer each not with the node institute mark of invalid flag
State s do
6:for C (s, i
1) C (s, i
2) ∪ ... ∪ C (s, i
k) in each state e do//i
1,
i
2..., i
kStandard incoming symbol for s
7: create the child of a s, its flag state is e, and the limit mark enters shape
The pairing incoming symbol of attitude e (being designated as i);
The reference node of any reference node c do//s of 8:for s correspondence refers to nonstandard
Know certain node in the subtree, the incoming symbol sequence on the path from root to this node with from
Root is identical to the incoming symbol sequence on the path of s.
(c i) is not empty then to 9:if C
10: newly-built | C (c, i) | individual node, difference mark C (c, the i) state in,
The limit is labeled as i;
11： else
12: with c corresponding identification reference node from C
CandidateMiddle deletion;
13： endif
14： endfor
The node then that is designated e has been arranged on the path of 15:if from the tree root to e
16: add invalid flag to this node that is designated e;
17： endif
18： endfor
19： endfor
20： if|C
candidate|＝1?then
21： conti←false；
22： endif
23：end?while
24: generate the diagnosis list entries according to the sign subtree that generates
Gathering pairing threshold value about described candidate state is a default integer, and candidate state set scale is big more, and then Yan Zheng accuracy rate is low more, and therefore, described candidate's threshold value is made as 2 or 3, to improve the accuracy of checking.
When the size of the pairing candidate state set of the state s that intends checking is 1, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, the state s of then tested state u for intending verifying, otherwise tested state u is not the state s that intends checking; When the size of the candidate state of state s set greater than 1 the time, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, then tested state u is a state in the pairing candidate state set of intending verifying of state s, otherwise tested state u is not in the pairing candidate state set of the state s that intends checking.
Claims (8)
1. the state verification method in the testing protocol consistency, this method is based on the FSM/EFSM model and adopt following steps:
1) checking is prepared: a given tested realization, this tested state s that realizes a tested state u in corresponding standard FSM/EFSM model, this tested realization and intend checking;
2) suppose the correct condition establishment of input if described tested realization meets the correct conditioned disjunction of input for diagnostic message is provided, then standard FSM/EFSM model is stored with predetermined data structure; Otherwise, method ends;
3) obtain based on standard FSM/EFSM model and intend pairing diagnosis list entries of proofing state s and candidate state set, and other the tested state verified in the described tested realization of preparing against store in the diagnosis list entries that will obtain and candidate state set;
4) if the number of elements in the set of candidate state described in the step 3) surpasses candidate's threshold value, then abandon proceeding this method; Otherwise, enter next step;
5) according to the pairing diagnosis list entries of state s of the plan checking of finding in the step 3) tested state u is tested, observe corresponding test result, obtain the state verification conclusion, that is: whether tested state u is the state s that intends checking in the tested realization, or whether this tested state is a state during the pairing candidate state of state s of intending checking is gathered.
2. method according to claim 1 is characterized in that: the correct condition optimization of described input carries out the incoming symbol test by the state to tested realization in the unit testing that is associated is satisfied.
3. method according to claim 1 is characterized in that: standard FSM/EFSM model is with matrix structure or link-list structure storage, and if adopt the matrix structure storage, palpus is distinguished each state transition tag element; If adopt the adjacency list structure storage, then node elements is corresponding with the element of state transition label.
4. method according to claim 3, it is characterized in that: the storage element type of matrix structure is a character string forms, the state transition tag element of being distinguished comprises that incoming symbol, output meet and the variable assignments operation, and adopts the escape symbolic notation that the state transition tag element is distinguished; This escape symbolic notation adopts “ " the expression list separator, if tag element comprises “ " symbol, and then use “ " symbolic substitution; When above-mentioned method for expressing is carried out semantic interpretation, single appearance " " symbol is separator, continuous two of occurring of order " " symbol with one " " symbolic substitution returns.
5. method according to claim 1, it is characterized in that: at first obtain in the described step 3) and originate in the corresponding pairing list entries carried out of state s of intending checking, and then choose the list entries carried out that can make a distinction other state maximum possible in corresponding state and the model as diagnosing list entries based on standard FSM/EFSM model; And the set of getting the undistinguishable state composition of diagnosis list entries is gathered as the pairing candidate state of the state s that intends checking.
6. method according to claim 1 or 5, it is characterized in that: the diagnosis list entries obtains by the traversal to the false transitions space.
7. method according to claim 1 is characterized in that: described candidate's threshold value is made as 2 or 3.
8. method according to claim 1, it is characterized in that: when the size of the pairing candidate state set of the state s that intends checking is 1, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, the state s of then tested state u for intending verifying, otherwise tested state u is not the state s that intends checking; When the size of the candidate state of state s set greater than 1 the time, if the pairing diagnosis list entries of state s of intending verifying is applied to can not have on the tested state u interruptedly and carries out, then tested state u is a state in the pairing candidate state set of intending verifying of state s, otherwise tested state u is not in the pairing candidate state set of the state s that intends checking.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010167584.3A CN102244590B (en) | 2010-05-10 | 2010-05-10 | Status verification method in protocol conformance test |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010167584.3A CN102244590B (en) | 2010-05-10 | 2010-05-10 | Status verification method in protocol conformance test |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102244590A true CN102244590A (en) | 2011-11-16 |
| CN102244590B CN102244590B (en) | 2014-05-14 |
Family
ID=44962445
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010167584.3A Expired - Fee Related CN102244590B (en) | 2010-05-10 | 2010-05-10 | Status verification method in protocol conformance test |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102244590B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111240883A (en) * | 2020-01-16 | 2020-06-05 | 北京工业大学 | Finite state machine based system diagnosis method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1484783A (en) * | 2000-09-26 | 2004-03-24 | 皇家菲利浦电子有限公司 | Security monitor of system runs software simulator in parallel |
| CN1749769A (en) * | 2004-05-21 | 2006-03-22 | 富士通株式会社 | Invariant detects |
-
2010
- 2010-05-10 CN CN201010167584.3A patent/CN102244590B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1484783A (en) * | 2000-09-26 | 2004-03-24 | 皇家菲利浦电子有限公司 | Security monitor of system runs software simulator in parallel |
| CN1749769A (en) * | 2004-05-21 | 2006-03-22 | 富士通株式会社 | Invariant detects |
Non-Patent Citations (2)
| Title |
|---|
| 倪群等: "用于协议一致性测试序列生成的状态规范化算法", 《通信学报》, vol. 18, no. 2, 28 February 1997 (1997-02-28) * |
| 陈涛等: "基于FSM的协议一致性测试序列生成算法研究", 《计算机工程与应用》, 28 February 2010 (2010-02-28) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111240883A (en) * | 2020-01-16 | 2020-06-05 | 北京工业大学 | Finite state machine based system diagnosis method, device, equipment and storage medium |
| CN111240883B (en) * | 2020-01-16 | 2023-08-29 | 北京工业大学 | System diagnosis method, device, equipment and storage medium based on finite state machine |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102244590B (en) | 2014-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021104270A1 (en) | Configuration anomaly detection method, server and storage medium | |
| CN109491905A (en) | Head end test method, apparatus and electronic equipment | |
| EP2868045B1 (en) | A method of and network server for detecting data patterns in an input data stream | |
| CN110287696B (en) | Detection method, device and equipment for rebound shell process | |
| CN110489317B (en) | Cloud system task operation fault diagnosis method and system based on workflow | |
| US10831630B2 (en) | Fault analysis method and apparatus based on data center | |
| CN109391526A (en) | A kind of detection method and device of network loop | |
| CN107294856B (en) | Method, equipment and system for determining topology change | |
| CN111526094B (en) | RSTP state machine scheduling method and system | |
| CN102244590B (en) | Status verification method in protocol conformance test | |
| US9367821B2 (en) | System and method for profiling requests in service systems | |
| US11665165B2 (en) | Whitelist generator, whitelist evaluator, whitelist generator/evaluator, whitelist generation method, whitelist evaluation method, and whitelist generation/evaluation method | |
| CN112532467A (en) | Method, device and system for realizing fault detection | |
| CN115357513B (en) | Program ambiguity test method, device, equipment and storage medium | |
| CN115514683A (en) | Method and device for determining packet loss reason, exchange chip and storage medium | |
| CN109560964B (en) | Equipment compliance checking method and device | |
| KR102275635B1 (en) | Apparatus and method for detecting anomaly through function call pattern analysis | |
| CN107305540A (en) | Address cutting recognition methods | |
| CN101547138A (en) | Method and device for quick pattern matching | |
| US11743066B2 (en) | Reachability verification method and apparatus | |
| CN101651571B (en) | Analytic method and equipment for ports | |
| CN113015115B (en) | Charging message processing method, device, charging system and storage medium | |
| WO2023185185A1 (en) | Network device management method and apparatus | |
| CN110096555B (en) | Table matching processing method and device for distributed system | |
| CN115174426B (en) | Output message detection method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140514 |