CN104243243B - A kind of method for generating protocol test sequence - Google Patents
A kind of method for generating protocol test sequence Download PDFInfo
- Publication number
- CN104243243B CN104243243B CN201410542685.2A CN201410542685A CN104243243B CN 104243243 B CN104243243 B CN 104243243B CN 201410542685 A CN201410542685 A CN 201410542685A CN 104243243 B CN104243243 B CN 104243243B
- Authority
- CN
- China
- Prior art keywords
- data
- state machine
- component
- parameter
- datagram
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of method for generating protocol test sequence, comprise the following steps：The streamline extended finite state machine model including data package state machine corresponding with the protocol specification and channel set is built for the protocol specification of the network equipment to be tested；According to the streamline extended finite state machine model extraction abstract component datagram, the abstract component datagram includes representing the summit of the data package, represents the directed edge of the channel set and entrance and the exit point of the streamline extended finite state machine model；All directed edges of covering, all data paths between entrance and exit point in the streamline extended finite state machine model are generated based on abstract component datagram；Traversal full data path generates the cycle tests for accessing total data component in the data path respectively.This invention simplifies network protocol testing method, state explosion problem can be slowed down.
Description
Technical field
The present invention relates to network protocol testing technical field, specifically, it is related to a kind of based on the limited shape of streamline extension
The method for generating protocol test sequence of state machine.
Background technology
Protocol test technology is to ensure that network communication protocol is correctly correctly interconnected between realization and the different network equipments
Important means.Uniformity test is basic protocol testing method, its target be detection protocol realize whether with protocol specification
It is consistent.
Self -adaptive based on formalization method is the major issue in this field, and its target is the shape from protocol specification
Formula model sets out, and generates the test set (or cycle tests) for test activity.In most of Self -adaptive skills having pointed out
In art, its basic thought is that system under test (SUT) (System Under Test, abbreviation SUT) is modeled as into a finite state machine
Or the system of extended finite state machine, and then generate cycle tests.
The method for creating test sequence based on extended finite state machine only considers single process model situation in the prior art,
For the streamline situation with multiple processes that are mutually related without reference to.The latter can only pass through the various of exhaustive multiple processes
Combine, and built-up pattern is set up respectively to various combinations and solve, the scale of modeling is difficult to receive, and to follow-up test
Generation causes obstacle.
The content of the invention
One of technical problem solved by the invention is the cycle tests based on extended finite state machine in the prior art
Generation method exists for the streamline situation with multiple processes that are mutually related and is confined to exhaustive process combination, for each
The combination of the process of kind is modeled and causes modeling in large scale, is unfavorable for the defect of protocol test.
The invention provides a kind of method for generating protocol test sequence, comprise the following steps：
Built for the protocol specification of the network equipment to be tested including data package state corresponding with the protocol specification
The streamline extended finite state machine model of machine and channel set；
According to the streamline extended finite state machine model extraction abstract component datagram, the abstract component datagram
Summit including representing the data package, represents the directed edge and the streamline extended finite state of the channel set
The entrance of machine model and exit point；
All directed edges of covering are generated based on abstract component datagram, in the streamline extended finite state machine mould
All data paths between the entrance of type and exit point；
Traversal full data path generates the cycle tests for accessing total data component in the data path respectively.
According to one embodiment of present invention, the data package state machine table is shown as describing the multiple parallel of data package
The array of protocol process, the array includes state set parameter, input parameter, output parameter and the status change collection of data package
Close parameter.
According to one embodiment of present invention, the streamline extended finite state machine model further comprises representing to be measured
The shared variable that flow table is cached in the network switch.
According to one embodiment of present invention, it is described according to the streamline extended finite state machine model extraction abstraction set
Part datagram includes：
Ignore the transition process of the data package state machine, extract the multiple summits connected by the directed edge, entrance
Point and exit point and the abstract component datagram that constitutes；
Delete the corresponding summit of data package of untreatment data message in abstract component datagram, and no data message
The corresponding directed edge of channel passed through；
Increasing shared variable summit in abstract component datagram is used to represent the shared variable data package, and increases
Shared variable directed edge represents the channel between the shared variable data package and other data packages.
According to one embodiment of present invention, it is described that all directed edges of covering, place are generated based on abstract component datagram
All data paths include between the entrance of the streamline extended finite state machine model and exit point：
Current vertex parameter initialization, the initial parameter of current vertex is used as using the entrance parameter；
Current vertex parameter updates, and next summit of current vertex is selected in abstract component datagram, on next summit
It is not exit point and in the case of being not blank spot, the parameter of current vertex is updated with the parameter on next summit；On next summit
In the case of for blank spot, the parameter of current vertex is updated with the parameter on the fraternal summit not accessed；
Repeat current vertex parameter and update step, in the case of being exit point on next summit, record by entrance
To exit point data path.
According to one embodiment of present invention, the access data path is generated respectively in the traversal full data path
In the step of cycle tests of middle total data component,
Testing data component in a selected data paths, joins according to the default input of testing data component input channel
The default output parameter of number and output channel searches status change in testing data component state machine；
The preceding guide passage of the initial state by original state to the status change is searched in testing data component state machine
Footpath；
The cycle tests of testing data component is determined by the status change and preceding guiding path.
According to one embodiment of present invention, the shared variable directed edge represent the shared variable data package with to
Channel between the data package of shared variable write-in data, and/or
Channel between the shared variable data package and the data package for reading data from shared variable.
According to one embodiment of present invention, the data package includes the one or more in following items：
The monitor of the network switch, the general flow table item in network switch flow table, Data Matching component, data mismatch
Component.
According to one embodiment of present invention, the general flow table item data package state machine includes following various states
It is one or several kinds of：
Interpolation data stream simultaneously forwards data, interpolation data stream and jumps to other flow tables, interpolation data stream and abandon data
Message, change data flow and forward data, modification data flow and to jump to other flow tables, change data flow and abandon datagram
Text.
According to one embodiment of present invention, one kind of the data mismatch component state machine including following various states or
Person is several：
Interpolation data stream simultaneously uploads data, interpolation data stream and jumps to other flow tables, interpolation data stream and abandon data
Message, change data flow and upload data, modification and data flow and jump to other flow tables, change data flow and abandon datagram
Text.
The beneficial effects of the present invention are for the streamline situation with multiple processes that are mutually related, there is provided one kind
Based on streamline extended finite state machine model, full data path in overlay model ensure that.The present invention expands streamline
Abstract exhibition finite state machine model is only to describe the module data figure of data package and channel, deletes not processing data stream
Associated component and channel, simplify method of testing.In addition, by being leading by the status change process simplification inside data package
Path, only considers the data path in abstract component datagram, can slow down state explosion problem.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
Obtain it is clear that or being understood by implementing the present invention.The purpose of the present invention and other advantages can be by specification, rights
Specifically noted structure is realized and obtained in claim and accompanying drawing.
Brief description of the drawings
Accompanying drawing is used for providing a further understanding of the present invention, and constitutes a part for specification, the reality with the present invention
Apply example to be provided commonly for explaining the present invention, be not construed as limiting the invention.In the accompanying drawings：
Fig. 1 is the step flow chart for being used to generate the method for protocol test sequence according to embodiments of the present invention；
Fig. 2 is the friendship for the OpenFlow agreements that use streamline extended finite state machine according to embodiments of the present invention is described
Change planes model schematic；
Fig. 3 is general flow table item data package state machine FE according to embodiments of the present inventioniStatus change schematic diagram；
Fig. 4 is data mismatch component state machine TM according to embodiments of the present inventioniStatus change schematic diagram；
Fig. 5 is the step flow chart of extraction abstract component datagram according to embodiments of the present invention；
Fig. 6 is the abstract component datagram of the interchanger model extraction according to Fig. 2；
Fig. 7 is the step flow chart of generation data path according to embodiments of the present invention；
Fig. 8 is the step flow chart of generation cycle tests according to embodiments of the present invention；
Fig. 9 is the schematic diagram of a data paths according to embodiments of the present invention.
Embodiment
To make the object, technical solutions and advantages of the present invention clearer, further is made to the present invention below in conjunction with accompanying drawing
Ground is described in detail.
A kind of embodiments of the invention offer being used for based on streamline extended finite state machine generates protocol test sequence
Method, this method ensures the covering to pipeline system described by streamline extended finite state machine model, while slowing down state
Explosion issues.
Described in detail referring to Fig. 1 provided in this implementation be used for generate protocol test sequence method.
First in step s 110, the protocol specification for the network equipment to be tested builds and included and the protocol specification pair
The data package state machine and the streamline extended finite state machine model of channel set answered.Wherein, the data package shape
State machine is expressed as describing the array of multiple parallel protocol process of data package, and the state set that the array includes data package is joined
Number, input parameter, output parameter and status change lumped parameter.
Extended finite state machine (Extended Finite State Machine, abbreviation EFSM) is extensive in the prior art
For describing procotol.But, some protocol specifications include the concurrent process of multiple non-communicating in a network entity, because
This needs to use the finite state machine of parallel-expansion to simulate protocol specification.
Proposed in the present embodiment with streamline extended finite state machine (Pipelined Extended Finite
Machines, referred to as Pi-EFSM) multiple non-communicating concurrent processes in a network entity are described.Flowing water is built first
Line extended finite state machine model, is represented with PL.PL is a four-tuple, PL=(M, ST, C, VS).Each parameter in four-tuple
Implication is as described below.
The set that M is made up of n component state machine, M={ M1,M2,…,Mn, each component state machine is used to describe each association
The specification of view process.Wherein, each component state machine MiRepresent, i=0,1 ..., n, MiIt is eight tuples, Mi=(S, s0,VI,
VSR,VSW I,O,T)。
In eight tuple MiIn, S is MiFinite state set；
s0∈ S, are MiOriginal state；
VI=(Vi1,Vi2,…Vik,…,Vin), wherein VikIt is to be defined with using in MiInternal variable, is referred to as interior
Portion's variable, k=1,2 ..., n, n is positive integer, VIIt is MiThe set of all built-in variables；
Wherein VSRIt is in MiThe set for the shared variable that inside can be read；
Wherein VSWIt is in MiThe set of internal revisable shared variable；
I=(I1,I2,…Ik,…,In), wherein IkIt is MiAn incoming symbol, k=1,2 ..., n, n is positive integer, I
It is MiThe set of all incoming symbols, I is nonempty set；
O=(O1,O2,…Ok,…,On), wherein OkIt is MiAn output symbol, k=1,2 ..., n, n is positive integer, O
It is MiThe set of all output symbols, O is nonempty set；
T=(T1,T2,…Tk,…,Tn) it is MiThe set of all transition, T is nonempty set, wherein TkIt is MiOne change
Move, k=1,2 ..., n, n is positive integer, TkIt is one hexa-atomic group, Tk=(sstart,send,Ik,Ok,P,A)。
In TkHexa-atomic group in, sstart∈ S, are TkOriginal state；send∈ S, are TkLast current state；Ik∈ I, are Tk's
Incoming symbol；Ok∈ O, are TkOutput symbol；P is on VIIn built-in variable, VEIn external variable, input IkAnd some
The predicate expressions of constant, P illustrates TkThe condition of execution；A is TkBehavior sequence during execution, A include variable assignments behavior and
One or more in output behavior, the multinomial behavior in A is performed in order.
In addition, in streamline extended finite state machine model PL, ST is the finite aggregate of flow table level in streamline, root
According to the multilevel flow table in the network switch, each streamline extended finite state machine model can be divided into 1 or multiple flow table layer
Level, each flow table level includes the component state machine in 1 or multiple M.C is the finite aggregate of channel, and each channel is by a group
Part state machine is connected with external environment condition or other state machines.VS is the finite aggregate of shared variable, and shared variable is global change
Amount, is not belonging to specific component state machine.
Fig. 2 is the interchanger model schematic of the OpenFlow agreements described using streamline extended finite state machine.Fig. 2
In do not embody the detail of data package status change.Controller in Fig. 2 is the entity of external environment condition, is not belonging to interchanger
Component；Entrance and exit point are the abstract of interchanger and external environment interface, are not belonging to the component of interchanger；Monitor is
The component of interchanger, is responsible for and controller interactive controlling message；Flow table 0, flow table 1 and flow table 2 represent the multilevel flow in interchanger
Table, the different flow table levels of correspondence streamline extended finite state machine；MM in Fig. 2i(i=0,1,2) it is each flow table of interchanger
In be responsible for carry out Data Matching component；FEi(i=0,1,2) component is the general flow table item in each flow table of interchanger；TMi(i=
0,1,2) component is the mismatch list item in each flow table of interchanger；BUFi(i=0,1,2) is shared variable, represents interchanger and respectively flows
Caching in table, is not belonging to component state machine.Dotted line represents peripheral control unit and exchanges monitor unit, inside interchanger in Fig. 2
The flow direction of the control data of data package, solid line represents the flow direction of interchanger interior business data.
Fig. 3 is general flow table item data package state machine FE in the present embodimentiStatus change schematic diagram, wherein FEiShape
State transition refer to table 1.Fig. 4 is data mismatch component state machine TM in the present embodimentiStatus change schematic diagram, wherein TMiShape
State transition refer to table 2.
Table 1
Input parameter aa values 0 or 1 in table 1, are indicated whether containing output order immediately；Gtab values 0,1 or 2, table
Show different flow tables.
Table 2
Input parameter aa values 0 or 1 in table 2, are indicated whether containing output order immediately；Gtab values 0,1 or 2, table
Show different flow tables.
Referring again to Fig. 1, streamline extended finite state machine model has been built in step s 110, step is then performed
S120, the processing condition data in pipeline system is described according to pipeline state machine model extraction abstract component datagram,
For generating test path and cycle tests.
Specifically, in the step s 120 according to the streamline extended finite state machine model extraction abstract component data
Figure, the abstract component datagram includes representing the summit of the data package, represent the channel set directed edge and
The entrance of the streamline extended finite state machine model and exit point.
Reference picture 5, in the step s 120 including following sub-step.Sub-step S121 is first carried out, ignores data package shape
The transition process of state machine, extracts the abstract component being made up of multiple summits, entrance and exit point that the directed edge is connected
Datagram.Then in sub-step S122, the data package for deleting untreatment data message in abstract component datagram is corresponding
Summit, and the corresponding directed edge of channel that no data message passes through.Sub-step S123 is finally performed, in abstract component datagram
Middle increase shared variable summit is used to represent shared variable data package, and increases shared variable directed edge to represent shared variable
Channel between data package and other data packages.Wherein, shared variable directed edge represent shared variable data package with to
Channel between the data package of shared variable write-in data, and/or the shared variable data package from shared with becoming
Amount reads the channel between the data package of data.
In the present embodiment, module data (Data Graph) is represented with DG, and DG is a directed acyclic graph, with one four
Element group representation is DG=(V, E, Pstart,Pend).Wherein, V is the set on summit in figure, each summit Vertex (Mi) represent,
I=0,1 ..., n, MiIt is a component state machine；E is the set of directed edge in figure, and each directed edge is with Edge={ c | c ∈ C }
Represent, wherein C is the finite aggregate of channel in streamline extended finite state machine model；PstartIt is streamline extended finite state
Thus the entrance of machine model, all data messages input streamline；PendIt is the outlet of streamline extended finite state machine model
Point, all data messages thus viewing pipeline.
Fig. 6 is the abstract component datagram of the interchanger model extraction according to Fig. 2.Monitor group has been deleted in Fig. 6
Part and correlated channels；Cache BUFiFor shared variable summit, shared data component is represented；Increase shared variable directed edge to represent
BUFiWith to BUFiWrite the mismatch list item component TM of dataiConnection between (i=0,1,2), and represent BUFiWith from BUFi
Read the general flow table item component FE of datai(i=0,1,2) connection between.
It should be noted that the method for the generation cycle tests provided in the present embodiment is included in abstract component datagram
Data path generation and the generation of the cycle tests based on data path.First from module data figure, in generation coverage diagram
Then each data paths are based on input and output matching generation cycle tests by the data path on all sides.So that can
To avoid in the prior art for the streamline situation with multiple processes that are mutually related, can only exhaustive multiple processes it is various
Combine and simultaneously model respectively, cause modeling scale excessively huge limitation.
Also, the Self -adaptive based on common mode communicating finite statemachine contributes to the feelings of multiple entity in network in the prior art
Shape, without reference to the situation of multiple processes in single entities, is difficult to describe, Er Qiexiang when shared data in streamline
Mostly there is the state explosion problem that built-up pattern is caused in the method for testing of pass.Abstract component datagram is selected in the present embodiment
Each data package that different data paths comes in ergodic data path, can cover not going the same way for shared data in streamline
Footpath, and produce the cycle tests for each data paths.So as to slow down state explosion problem.
Referring again to Fig. 1, in the step s 120 after completion extraction abstract component datagram, then step S130, base are performed
All directed edges of covering, the entrance in the streamline extended finite state machine model are generated in abstract component datagram
All data paths between exit point.
As shown in fig. 7, being specifically included during step S130 is based on abstract component datagram generation data path
Following sub-step.
Sub-step S131 is first carried out, current vertex parameter is initialized, current vertex is used as using entrance parameter
Initial parameter, i.e., for the module data figure DG, set current vertex Pcurrent=Pstart。
Next in sub-step S132 into S135, the renewal of current vertex parameter is completed.
Whether be exit point or blank spot, such as if next summit in abstract component datagram is judged in sub-step S132
Next summit P in fruit abstract component datagramcurrent.next it is not blank spot and be not exit point Pend, perform sub-step
S133, the parameter of current vertex, i.e. P are updated with the parameter on next summitcurrent=Pcurrent.next；Then repeat sub-step
S132。
If next summit P in abstract component datagramcurrent.next it is exit point Pend, then step is performed
S134, is recorded by PstartTo PendData path, and by PcurrentThe fraternal summit not accessed is set to, is then repeated
Sub-step S132；Wherein, PcurrentIts previous summit of fraternal vertex representation other follow-up summits, illustrate as shown in fig. 6, FE0
With TM0Fraternal summit each other.
If next summit P in module data figurecurrent.next it is blank spot, then performs sub-step S135,
PcurrentThe fraternal summit not accessed is set to, i.e., updates the parameter of current vertex with the parameter on the fraternal summit not accessed, then
Repeat sub-step S132.
Sub-step S132 is so repeated to S135, so that all tops in abstract component datagram DG in step s 130
Point is accessed, and completes data path generation.
Referring again to Fig. 1, step S140 is next performed, traversal full data path generates the access data road respectively
The cycle tests of total data component in footpath.The survey matched in this step based on input and output is discussed in detail hereinafter with reference to Fig. 8
Sequence Generation Algorithm is tried, and is progressively explained in detail.
What the system abstract view based on streamline extended finite state machine model was extracted in abovementioned steps S120 is abstract
Module data figure, the internal state transition details not including data package state machine.Accordingly, generate in step s 130
Data path belongs to system abstract path, in order to carry out actual test, it is necessary to contain data package shape based on data path generation
The cycle tests of guiding path before inside state machine.
As shown in figure 8, including following sub-step in step S140.
A data path is chosen in sub-step S141 first, and the message chosen in the first channel of the data path is
input.Then sub-step S142 is performed, it is output to choose the message in data path in next channel.Then in sub-step
In rapid S143, searched in the data package state machine for connecting two channels using input as input, using output as the change of output
Move t.So, for the testing data component in a selected data paths, according to the pre- of testing data component input channel
If the default output parameter of input parameter and output channel, the algorithm based on input and output matching is in testing data component state machine
Middle lookup status change.
Next in sub-step S144, searched in the data package state machine belonging to t by the starting of original state to t
The preceding guiding path of state is simultaneously connected with t, and the cycle tests of testing data component is determined by status change t and preceding guiding path.Due to
Preceding guiding path inside data package state machine is merely representative of from the starting by the data package from original state to status change
The change of state, this is unrelated with the integrated testability of data path, it is preferred that a most short preceding guiding path can be selected to reduce
Number of calculations.
Sub-step S145 is then performed, the input parameter and output parameter of subsequent channel in data path are set, that is, set
Input=output.Repeat sub-step S143 until in selected data path all data packages be all accessed, it is raw
Into the cycle tests for selected data path；
In sub-step S146, reselect data path, repeat sub-step S141 until all data paths all
It is traversed, ultimately generates whole cycle tests.
The example of the one presented below test generation algorithm based on input and output matching.
INPUT (1) data path set DP (2) streamline extended finite state machine model；
OUTPUT cycle tests set TS；
BEGIN
(1) each data paths DP in For DPj
(2) TS is initializedjFor initial hollow testing sequence
(3)For DPjEach component state machine Mi behind middle entrance
(4)If MiIt is transfer component
(5)Continue
(6)Else
(7) input is putiFor MiMessage in preceding channel
(8) output is putiFor MiThe message in channel afterwards
(9) TR is putiFor MiIn with inputi/outputiFor the transition of input/output
(10) leading path P reamble is putiFor MiIn from original state to the path of TR initial equilibrium states
(11)Pathi:=Preamblei+TRi；
(12) by PathiIt is stored in TSj
(13)End If
(14) by TSjIt is stored in TS
(15)End For
(16)End For
END.
So far, full data path is traveled through in step S140 and generates whole numbers in the access data path respectively
According to the cycle tests of component.
Experimental result
64 for OpenFlow agreement 1.3.0 version interchanger models are generated using above method in this example
Data path and corresponding 64 cycle tests.For example, a data paths of generation are illustrated in figure 9.Its is corresponding
Cycle tests is as shown in table 3.
Table 3
As can be seen here, the embodiment of the present invention has reached expected purpose.
In summary, embodiments of the invention are by introducing streamline extended finite state machine model and module data figure,
The first searching data path during Self -adaptive, regenerate cycle tests, and accurate description carries the network of pipeline organization
Agreement, and slow down state explosion problem using stratification generation.
While it is disclosed that embodiment as above, but described content is only to facilitate understanding the present invention and adopting
Embodiment, is not limited to the present invention.Any those skilled in the art to which this invention pertains, are not departing from this
On the premise of the disclosed spirit and scope of invention, any modification and change can be made in the implementing form and in details,
But the scope of patent protection of the present invention, still should be subject to the scope of the claims as defined in the appended claims.
Claims (5)
1. a kind of method for generating protocol test sequence, it is characterised in that comprise the following steps：
For the network equipment to be tested protocol specification build include data package state machine corresponding with the protocol specification with
And the streamline extended finite state machine model of channel set；
According to the streamline extended finite state machine model extraction abstract component datagram, the abstract component datagram includes
The summit of the data package is represented, the directed edge and the streamline extended finite state machine mould of the channel set is represented
The entrance of type and exit point；
All directed edges of covering are generated based on abstract component datagram, in the streamline extended finite state machine model
All data paths between entrance and exit point；
Traversal full data path generates the cycle tests for accessing total data component in the data path respectively,
Wherein, the data package state machine table is shown as describing the array of multiple parallel protocol process of data package, the array
State set parameter, input parameter, output parameter and status change lumped parameter including data package,
It is shared that the streamline extended finite state machine model further comprises representing that flow table in network under test interchanger is cached
Variable,
It is described to be included according to the streamline extended finite state machine model extraction abstract component datagram：
Ignore the transition process of the data package state machine, extract the multiple summits connected by the directed edge, entrance and
Exit point and the abstract component datagram constituted；
The corresponding summit of data package of untreatment data message in abstract component datagram is deleted, and no data message passes through
The corresponding directed edge of channel；
Increasing shared variable summit in abstract component datagram is used to represent the shared variable data package, and increases shared
Variable directed edge represents the channel between the shared variable data package and other data packages,
It is described that all directed edges of covering are generated based on abstract component datagram, in the streamline extended finite state machine mould
All data paths include between the entrance of type and exit point：
Current vertex parameter initialization, the initial parameter of current vertex is used as using the entrance parameter；
Current vertex parameter is updated, and next summit of current vertex is selected in abstract component datagram, is not on next summit
Exit point and in the case of being not blank spot, the parameter of current vertex is updated with the parameter on next summit；It is sky on next summit
In the case of white point, the parameter of current vertex is updated with the parameter on the fraternal summit not accessed；
Repeat current vertex parameter and update step, in the case of being exit point on next summit, record is by entrance to going out
Mouth point data path,
Generate the cycle tests of total data component in the access data path respectively in the traversal full data path
In step,
Testing data component in a selected data paths, according to the default input parameter of testing data component input channel and
The default output parameter of output channel searches status change in testing data component state machine；
The preceding guiding path of the initial state by original state to the status change is searched in testing data component state machine；
The cycle tests of testing data component is determined by the status change and preceding guiding path.
2. according to the method described in claim 1, it is characterised in that the shared variable directed edge represents the shared variable number
The channel write according to component and to shared variable between the data package of data, and/or
Channel between the shared variable data package and the data package for reading data from shared variable.
3. method according to claim 1 or 2, it is characterised in that the data package includes one in following items
Or it is multinomial：
The monitor of the network switch, the general flow table item in network switch flow table, Data Matching component, data mismatch group
Part.
4. method according to claim 3, it is characterised in that the general flow table item data package state machine includes following
The one or several kinds of various states：
Interpolation data stream and forward data, interpolation data stream and jump to other flow tables, interpolation data stream and abandon data message,
Modification data flow simultaneously forwards data, modification data flow and jumps to other flow tables, changes data flow and abandon data message.
5. method according to claim 3, it is characterised in that the data mismatch component state machine includes following various shapes
The one or several kinds of state：
Interpolation data stream and upload data, interpolation data stream and jump to other flow tables, interpolation data stream and abandon data message,
Modification data flow simultaneously uploads data, modification data flow and jumps to other flow tables, changes data flow and abandon data message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410542685.2A CN104243243B (en) | 2014-10-14 | 2014-10-14 | A kind of method for generating protocol test sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410542685.2A CN104243243B (en) | 2014-10-14 | 2014-10-14 | A kind of method for generating protocol test sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104243243A CN104243243A (en) | 2014-12-24 |
| CN104243243B true CN104243243B (en) | 2017-08-04 |
Family
ID=52230640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410542685.2A Active CN104243243B (en) | 2014-10-14 | 2014-10-14 | A kind of method for generating protocol test sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104243243B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105337801B (en) * | 2015-11-10 | 2018-07-31 | 上海斐讯数据通信技术有限公司 | A kind of method for test examples design based on state machine suitable for switch protocol |
| CN107566098B (en) * | 2017-07-24 | 2019-10-18 | 清华大学 | The generation method and generation system of software defined network application cycle tests |
| CN111934948B (en) * | 2020-07-20 | 2022-04-12 | 浙江理工大学 | EFSM executable test sequence generation method based on Monte Carlo tree search |
| CN112395205B (en) * | 2020-12-03 | 2024-04-26 | 中国兵器工业信息中心 | Software testing system and method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7392509B2 (en) * | 2004-04-13 | 2008-06-24 | University Of Maryland | Method for domain specific test design automation |
| CN101674205A (en) * | 2009-08-27 | 2010-03-17 | 福建星网锐捷网络有限公司 | Method and device for generating network communication protocol test sequence based on finite-state machine |
| CN102176200A (en) * | 2009-09-25 | 2011-09-07 | 南京航空航天大学 | Software test case automatic generating method |
| CN102404167A (en) * | 2011-11-03 | 2012-04-04 | 清华大学 | Protocol test generating method of parallel expansion finite-state machine based on variable dependence |
| CN103391224A (en) * | 2013-07-22 | 2013-11-13 | 清华大学 | Protocol layering test generation method based on parallel expansion finite-state machine |
| CN104077228A (en) * | 2014-07-08 | 2014-10-01 | 浙江理工大学 | EFSM performable test sequence generating method based on predicate dependency graph |
-
2014
- 2014-10-14 CN CN201410542685.2A patent/CN104243243B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7392509B2 (en) * | 2004-04-13 | 2008-06-24 | University Of Maryland | Method for domain specific test design automation |
| CN101674205A (en) * | 2009-08-27 | 2010-03-17 | 福建星网锐捷网络有限公司 | Method and device for generating network communication protocol test sequence based on finite-state machine |
| CN102176200A (en) * | 2009-09-25 | 2011-09-07 | 南京航空航天大学 | Software test case automatic generating method |
| CN102404167A (en) * | 2011-11-03 | 2012-04-04 | 清华大学 | Protocol test generating method of parallel expansion finite-state machine based on variable dependence |
| CN103391224A (en) * | 2013-07-22 | 2013-11-13 | 清华大学 | Protocol layering test generation method based on parallel expansion finite-state machine |
| CN104077228A (en) * | 2014-07-08 | 2014-10-01 | 浙江理工大学 | EFSM performable test sequence generating method based on predicate dependency graph |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104243243A (en) | 2014-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106650789B (en) | Image description generation method based on depth LSTM network | |
| CN108810616B (en) | Object localization method, image display method, device, equipment and storage medium | |
| CN104243243B (en) | A kind of method for generating protocol test sequence | |
| CN111858954A (en) | Task-oriented text-generated image network model | |
| CN101849235A (en) | Method and apparatus for memory abstraction and for word level net list reduction and verification using same | |
| CN104391796B (en) | A kind of test case analytic method | |
| CN115860091B (en) | Depth feature descriptor learning method based on orthogonal constraint | |
| US11017140B1 (en) | Autonomous verification of circuit design for computing devices | |
| CN107003834B (en) | Pedestrian detection device and method | |
| CN103391224B (en) | Protocol hierarchy Self-adaptive method based on parallel-expansion finite state machine | |
| US20210303764A1 (en) | Creating and/or enhancing hardware obscurity via randomization points | |
| CN109709452A (en) | The isolator detecting mthods, systems and devices of transmission line of electricity | |
| Ghosal et al. | Are vision transformers robust to spurious correlations? | |
| Xu et al. | CP3: Unifying point cloud completion by pretrain-prompt-predict paradigm | |
| Gao et al. | Improved YOLOX for pedestrian detection in crowded scenes | |
| CN107566098B (en) | The generation method and generation system of software defined network application cycle tests | |
| CN104123253B (en) | A kind of method and apparatus for realizing chip interconnection to be verified | |
| CN109614682A (en) | A kind of method, apparatus and storage medium of the FPGA pin exchange based on Expedition PCB | |
| US20120290282A1 (en) | Reachability analysis by logical circuit simulation for providing output sets containing symbolic values | |
| US20210303268A1 (en) | Autonomous pseudo-random seed generator for computing devices | |
| CN115984949B (en) | Low-quality face image recognition method and equipment with attention mechanism | |
| CN113391992A (en) | Test data generation method and device, storage medium and electronic equipment | |
| CN107872441A (en) | The method and apparatus for generating device attribute configuration file | |
| Liu et al. | Spatiotemporal fusion networks for video action recognition | |
| A. Vasilakis et al. | Pose partitioning for multi‐resolution segmentation of arbitrary mesh animations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |