CN1761216A - Protocol description and method for creating test sequence thereof based on algebra of structure classes - Google Patents

Abstract

Protocol description and method for creating test sequence thereof based on algebra of structure classes are a kind of methods that is used for the unification of communication protocol test, the communication protocol describing method is: determine data division and control section in the version of an agreement, with it as entity object to be described; To certain entity object, description according to version of an agreement, to certain entity object, described the generating run of this object in the agreement,, defined various operations in the agreement this object to certain entity object, to certain entity object, defined restriction and requirement to this object in the agreement, the cycle tests production method is: according in the test environment to the operation of measured body with observe interface, its counterpart in protocol description is defined as observing function; To each equation axiom in the sorted algebra standard, rewrite according to the mode of rule match; Constructed fuction is wherein replaced with the operation that measured body is carried out, can observe function and replace with the observation operation of carrying out, thereby generate cycle tests.

Description

Protocol description and method for creating test sequence thereof based on algebra of structure classes

Technical field

The present invention is a kind of method that is used for the unification of communication protocol test, belongs to communication protocol describing method and method for creating test sequence technical field.

Background technology

The unification of communication protocol test is whether the work behavior of test communications software is consistent with communication protocol.Conventional method to the communication protocol test is at first communication protocol to be carried out formalized description at present, generates cycle tests then, uses these cycle testss to test at last.

At present, the formalized description mode of the most frequently used communication protocol is Bell System Technical Journal (BellSystem Technical Journal, 34 (5), pp.1045-1079,1955) and " Control Study automatically " (Automata Studies of publishing of Princeton University publishing house, C.E.Shannon andJ.McCarthy (ed.), pp.129-153,1956) middle finite state machine (FSM) modelling technique that proposes.When adopting said method communicates protocol description, the process symbol of protocol system is turned to a series of states; Incident in the protocol system is represented with the input and output of finite state machine; Relation between process and the incident is represented with the transformational relation between state and input, the output.When using the finite state machine technology to generate cycle tests, at first make tested realization (IUT by homing sequence (homing sequence), implementation undertest) arrives a transition of this conversion, apply the incoming event of this conversion then to tested realization, and whether the outgoing event of check and correction IUT mates with the described outgoing event of protocol specification, verifies by the checking sequence whether the shape of tail attitude of this conversion is correct at last.In the method, because the degree of depth exponent function relation of status number and State Tree, thereby exist the state explosion problem, and can not be described the data flow object.

Summary of the invention

Technical problem: the objective of the invention is to propose a kind of communication protocol formalized description method and method for creating test sequence thereof based on algebra of structure classes, be used to solve the cycle tests generation problem of unification of communication protocol test, to communicate protocol test work better.

Technical scheme: the present invention is applicable to Internet engineering duty group (IETF, InternetEngineering Task Force) the various Request for Comment (RFC that provide of tissue, Request for Comment) text, and the communication protocol related text of international Telephone and Telegraph Consultative Committee (CCITT, Consultative Committee onInternational Telephone and Telegraph).

Communication protocol describing method of the present invention is:

1) analyze the communication protocol text that measured body is realized, determine data division and control section in the version of an agreement, with it as entity object to be described;

2), according to the description of version of an agreement, determine that those entity objects are associated, with these entity object sets definitions finite aggregate S that is the class name of this object to certain entity object;

3) to certain entity object, the generating run of this object has been described in the agreement, these operations are expressed in the mode of function, be called constructed fuction, thereby form the finite aggregate C of this object constructed fuction;

4) to certain entity object, defined various operations in the agreement to this object, comprise and observe operation and control operation, express in the mode of function, be called the continuation function, thereby form the finite aggregate E of this object continuation function:

5) to certain entity object, restriction and requirement have been defined in the agreement to this object, these requirements are expressed with the mode of equation axiom, only comprised constructed fuction and continuation function in this equation axiom, these equation axioms have constituted the finite aggregate E of this object equation axiom;

Cycle tests production method of the present invention is:

1) according in the test environment to the operation of measured body with observe interface, its counterpart in protocol description is defined as observing function;

2) to each equation axiom in the sorted algebra standard, rewrite (Rewrite) according to the mode of rule match, be transformed into the formal Specification that constitutes by constructed fuction and observable function of equal value;

3) formal Specification that previous step is obtained replaces with the operation that measured body is carried out with constructed fuction wherein, can observe function and replace with the observation operation of carrying out, thereby generate cycle tests.

Carry out the formalized description of agreement based on the algebra of structure classes theory:

Described algebra of structure classes is a four-tuple, be A=(S, C, E, Q), S is the finite aggregate of class name, C is the finite aggregate of the constructed fuction of the represented set of all types name among the S, E is the finite aggregate of continuation function, and these functions all are finally can be defined by the constructed fuction among the C, and Q is the equation axiom that function should satisfy among C and the E.

In our describing method,, be described as the form of algebra of structure classes according to following mode to the various entity objects that relate in the agreement.

Entity object A

The generating mode constructed fuction C of entity object

Operation continuation function E to entity object

Requirement and restriction equation axiom Q to entity object

By this description, the protocol specification with natural language description in the version of an agreement is carried out formalization, be converted into the form of describing with algebra of structure classes.This formalized description method can give full expression to the every content in the version of an agreement on the one hand, has the good mathematical form on the other hand, is convenient to further processing.

When protocol test, a test macro often comprises a main test cell and zero or a plurality of concurrent testings unit, and a test cell can be communicated by letter with protocol module to be measured with control point (PCOs) by one or more observations.

If regard protocol module to be measured as a data structure, then can use algebra of structure classes that its standard is described.Its observation and control point (PCOs) are represented as constructed fuction or continuation function in the algebraically standard, and the axiom in the algebraically standard is that constructed fuction and continuation function are limited, and protocol module to be measured is observed and the standard of control point (PCOs) so the axiom in the algebraically standard has also constituted simultaneously.

A finite state machine M can define with following five-tuple: and M=(S, S1, I, O, T) wherein, S is the non-NULL state set of M, S1 is the initial state of M.I, 0 is respectively the nonempty set of all possible input and output of agreement.Transfer function T is defined as T:S * I → S * O.T (Si, a)=(Sj, physical significance o) is: finite state machine M receives input a when being in state Si, and M will transfer to state Sj and produce an output o.

Finite state machine M equally also can (V E) represents with the directed graph G=of a tape label.Here, S=V, each conversion T of FSM (Si, a)=(sj is o) corresponding to one among the E limit that is labeled as a/o from state Si to state Sj.So (si, Sj can be used in the limit among the E; A/o) such tlv triple is represented.

(RIP, Routing Information Protocol) is example with routing information protocol, has the situation of 0～2 route to be described below with the FSM five-tuple in the routing table of RIP agreement router:

S＝{V1，V2，V3，V4}

S1＝V1

I＝{Req，Resp[r1]，Resp[r2]，Resp[r1，r2]}

0＝{Resp[]，Resp[r1]，Resp[r2]，Resp[r1，r2]}

T can be with following form description:

Condition		The result
				Current state	Input	Output	Last current state
V1	Req	Resp[]	V1
				V1	Resp[r1]	-	V2
V1	Resp[r2]	-	V3
				V1	Resp[r1，r2]	-	V4
V2	Req	Resp[r1]	V2
				V2	Resp[r2]	-	V4
V3	Req	Resp [r2]	V3
				V3	Resp[r1]	-	V4
V4	Req	Resp[r1，r2]	V4

Wherein, state V1 represents empty routing table, and V2 represents the routing table route r1 that merely hit, and V3 represents to have only in the routing table route r2, and V4 represents to have in the routing table two routes { r1, r2}.

The possible input of each state is to respond (Response) message and request (Request) message, Resp[r1] expression carries the Response message of routing iinformation r1.Here only described special Request message (address entries is 0.0.0.0).

And in the description of sorted algebra, having following two equation axioms, its description has comprised the description that top FSM method is done.

Equation axiom 1: described the variation GetRouteList that router receives routing table behind the Response message (AcceptResponse (e, p))=

Union (GetRouteList (e), GetResponseList (p)) (equation axiom 1)

Equation axiom 2: described the routing iinformation GetResponseList (AcceptRequest (e that router receives the Response message that sends behind the Request message (comprise common with special), create (A)))=if Match (A, Add (Empty, 0.0.0.0)) (e=create (Add (L, r)))

Add(GetResponseList(AcceptRequest(Create(L)，create(Add(Empty，0.0.0.0)

Create(0，HostAddress，GetAddress(r)，GetSubnetMask(r)，0，GetMetric(r)))

else(A＝Add(A1，a))

GetResponseList(AcceptRequest(e，create(A1)))

+ MatchRouteList (a, GetRouteList (e)) (equation axiom 2)

(1) conversion of the second among the FSM { V1, V2; Resp[r1]/-be described below with equation axiom 1

GetRouteList(AcceptResponse(create(Empty)，create(Add(Empty，r1))))

＝Union(GetRouteList(create(Empty))，

GetResponseList(create(Add(Empty，r1)))

＝Union(Empty，Add(Empty，r1))

＝AddReplace(Union(Empty，Empty)，r1)

＝AddReplace(Empty，r1)

＝r1

Here, we have ignored some difference on message routing and the router routing infrastructure, and some special situations, and for example the distance (Metric) of top r1 is not if value 16 is then write routing table entry etc.What the equation of releasing was above described is that a routing table is that empty router receives a new routing iinformation r1, then comprises this routing iinformation r1 in its new routing table.This FSM conversion just { V1, V2; Resp[r1]/-described, the V1 state is the routing table that router has comprised, and receives input Resp[r1] be transformed into new state V2, V2 promptly is the state that routing table comprises a routing iinformation r1 in the router.

(2) the 5th conversion { V2, V2 during FSM describes; Req/Resp[r1] } be described below with equation axiom 2

GetResponseList(AcceptRequest(create(Add(Empty，r1))，

create(Add(Empty，0.0.0.0))))

＝Add(GetResponseList(AcceptRequest(Create(Empty)，

create(Add(Empty，0.0.0.0))))，

Create(0，HostAddress，GetAddress(r1)，GetSubnetMask(r1)，0，GetMetric(r1)))

＝Add(Empty，

Create(0，HostAddress，GetAddress(r1)，GetSubnetMask(r1)，0，GetMetric(r1))

From then on example as can be seen, the description of FSM method and sorted algebra method is of equal value.

Beneficial effect: compare with the description form of existing communication agreement and the method for generation cycle tests, advantage of the present invention is:

This formalized description method can give full expression to the every content in the version of an agreement on the one hand, has the good mathematical form on the other hand, is convenient to further processing.

Because the present invention has used and can observe function, the needs of the more realistic test environment of cycle tests that obtains; In the present invention, those are used to represent that the function of observing with the control point (constructed fuction or continuation function) is commonly referred to as and can observes function.And rewrite by the equation axiom, the axiom in the algebraically standard is converted to restriction to constructed fuction and observable function, thereby is convenient to observe and control in the test.

Help solving the state explosion problem:

If the time marquis that the state in the protocol specification is a lot of owing to state explosion occurs, makes UI0 etc. be difficult to use based on the method for creating test sequence of FSM based on the method for testing of finite state machine.But, still can generate cycle tests based on the method for testing of algebra of structure classes.So, when status number is very big in the described agreement, have certain advantage based on the method for testing of algebra of structure classes.

Equally for the RIP agreement, when in considering routing table, the situation of 0～n bar route being arranged, if be described then " the individual state that needs 2 with FSM.When n was big, it is very huge that the state in the FSM method also becomes thereupon, and until can not describing, this point is because the FSM method is to be that object is described with a route, and can not be that object is described with whole routing table.Different with it is be that object is described based on the sorted algebra method with whole routing table, so it all to be suitable for all routing tables.Therefore the method for testing based on algebra of structure classes helps solving the state explosion problem.

Description of drawings

Fig. 1 is concrete implementing procedure figure of the present invention.

Embodiment

In the protocol description and method for creating test sequence thereof based on algebra of structure classes of the present invention, the communication protocol describing method is:

1) analyze the communication protocol text that measured body is realized, determine data division and control section in the version of an agreement, with it as entity object to be described;

2), according to the description of version of an agreement, determine that those entity objects are associated, with these entity object sets definitions finite aggregate S that is the class name of this object to certain entity object;

3) to certain entity object, the generating run of this object has been described in the agreement, these operations are expressed in the mode of function, be called constructed fuction, thereby form the finite aggregate C of this object constructed fuction;

4) to certain entity object, defined various operations in the agreement to this object, comprise and observe operation and control operation, express in the mode of function, be called the continuation function, thereby form the finite aggregate E of this object continuation function;

5) to certain entity object, restriction and requirement have been defined in the agreement to this object, these requirements are expressed with the mode of equation axiom, only comprised constructed fuction and continuation function in this equation axiom, these equation axioms have constituted the finite aggregate E of this object equation axiom;

The cycle tests production method is:

1) according in the test environment to the operation of measured body with observe interface, its counterpart in protocol description is defined as observing function;

2) to each equation axiom in the sorted algebra standard, rewrite (Rewrite) according to the mode of rule match, be transformed into the formal Specification that constitutes by constructed fuction and observable function of equal value;

3) formal Specification that previous step is obtained replaces with the operation that measured body is carried out with constructed fuction wherein, can observe function and replace with the observation operation of carrying out, thereby generate cycle tests.

Embodiment 1 (is example with the RIP agreement)

The agreement that will carry out formalized description in this example is routing information protocol (RIP, RoutingInformation Protocol), associated content reference RFC1058.

Concrete implementing procedure figure as shown in Figure 1, each step is described in detail as follows:

1) determines that agreement always need carry out the entity object of formalized description

Analyze version of an agreement, needing in the agreement to obtain the entity object described as follows:

● the IP address (Address) of communication message

● subnet mask (SubnetMask)

● IP address, the next stop (NextHop)

● the gateway of message process (GateWay)

● arrive the distance (Metric) of destination, the metric field of corresponding message.Metric field comprises the tolerance counter of message, and counter constantly increases progressively counting with the router of this message process.The effective range of this field tolerance is 1 to 15,16 to be used for representing invalid route.

● the Boolean quantity (Flag) whether the expression routing iinformation is modified

● timer (Timer) comprises overtime timer and refuse collection timer

● the routing iinformation clauses and subclauses (ResponseRoute) of carrying in the response message

● the routing table of carrying in the response message (ResponseList)

● response message (Response), comprise can with the Route Selection table record of other RIP nodes sharing in the network, it can generate as to the application response or spontaneous renewal

● request message (Request) is used to ask the other side's server to send its all or part of routing table

● the routing information in the router routing table (Route)

● the routing table of router (RouteList)

● router (Router)

Be the formalized description that example is carried out agreement with routing information (Route) below.

2) the class name finite aggregate S of description entity object

In version of an agreement was described, the entity object relevant with routing information comprised: the Boolean quantity (Flag) whether the gateway (GateWay) of the routing iinformation clauses and subclauses (ResponseRoute) of carrying in the response message, the IP address (Address) of communication message, message process, the distance (Metric) that arrives the destination, subnet mask (SubnetMask), timer (Timer), expression routing iinformation are modified.

Therefore the class name finite aggregate S of routing information (Route) is defined as follows:

Route: the standard of routing iinformation in the // router routing table

S：

Route，ResponseRoute，Address，Gateway，Metric，SubnetMask，Timer，

Flag

3) the finite aggregate C of the constructed fuction of description entity object

In agreement, a routing information is made of following member's list item:

● the IP address of Address main frame or network

● Gateway first gateway to the path of target

● Metric indicates the distance that arrives the destination

● the SubnetMask subnet mask

● the Timer timer

● the flag bit whether the Flag route is modified

Thus, it is as follows that we define the constructed fuction finite aggregate C of routing information (Route):

Route: the standard of routing iinformation in the // router routing table

C：

Create：Address，Gateway，Metric，SubnetMask，Timer，Flag：->Route

4) the continuation function finite aggregate E of description entity object

In agreement, comprise following content with the routing information associative operation:

● reading of member's list item, from a routing information, read Address, information such as Gateway.

● matching operation, relatively whether the routing iinformation (ResponseRoute) that carries in routing information (Route) in the routing table and the response message mates.

● the updating route information operation, router receives a Response message, and after detecting validity, router will use the routing table of Response message that the routing table of router self is upgraded.With the routing iinformation that carries in the response message (ResponseRoute) routing iinformation (Route) in the routing table (RouteList) of router is upgraded.

● the ineffective treatment operation, time is up for the overtime device of the route in routing table, and the routing iinformation (Route) in the routing table (RouteList) is set to invalid route.

● overtime operation, the Timer item of route information (Route) is done the operation that adds up.

Thus, it is as follows that we can define the continuation function finite aggregate E of routing information (Route):

Route: the standard of routing iinformation in the // router routing table

E：

Reading of // member list item

GetGateway：Route->Gateway

GetAddress：Route->Address

GetMetri c：Route->Metric

GetSubnetMask：Route->SubnetMask

GetTimer：Route->Timer

GetFlag：Route->Flag

// matching operation

If // two routes all are the information descriptions to same destination address, then coupling is worth and is true

// otherwise functional value is false

Match：Route ResponseRoute->Boolean

The operation of // updating route information

Replace：Route ResponseRoute->Route

The operation of // ineffective treatment

NotValidRoute：Route->Route

// overtime operation

TimeOut：Route->Route

5) the equation axiom finite aggregate Q that entity object need satisfy is described

In agreement, as follows to the restriction of routing information associative operation:

● reading of member's list item, the result who reads should be the corresponding list item in the routing information.

● matching operation, if the Address of two routing iinformations is identical, think that then they mate.

● upgrade operation, if the Metric value of the route (ResponseRoute) of newly arriving in the Response message little than former routing iinformation (Route) then replaced.In addition, if being first gateway from former routing iinformation (Route) path, sends the Response message, and when new Metric is 16, to start deletion process, if start but former routing iinformation (Route) Metric has been 16 expression deletion process, then should not restart deletion process.

● the ineffective treatment operation if the overtime timer time of certain routing iinformation arrives, then is changed to 16 with its Metric item, and starts the rubbish timer.Be true with the Flag position simultaneously, start " trigger and upgrade " process.

● overtime operation, added 30 for the Timer item of routing iinformation every 30 seconds.

Thus, it is as follows that we can define the equation axiom finite aggregate E of routing information (Route):

Route: the standard of routing iinformation in the // router routing table

Q：

for all r1，r2∈Route

for all rr1，rr2∈ResponseRoute

for all a1，a2∈Address

for all g1，g2∈Gateway

for all m1，m2∈Metric

for all sm1，sm2∈SubnetMask

for all t1，t2∈Timer

for all f1，f2∈Flag

The definition of corresponding 6 the continuation functions of // following 6 axioms

GetAddress(Create(a1，g1，m1，sm1，t1，f1))＝a1

GetGateway(Create(a1，g1，m1，sm1，t1，f1))＝g1

GetMetric(Create(a1，g1，m1，sm1，t1，f1))＝m1

GetSubnetMask(Create(a1，g1，m1，sm1，t1，f1))＝sm1

GetTimer(Create(a1，g1，m1，sm1，t1，f1))＝t1

GetFlag(Create(a1，g1，m1，sm1，t1，f1))＝f1

// matching operation:

If what // r1 and rr1 described is the routing iinformation of same destination node,

// we just say that r1 and rr1 mate.

Match(GetAddress(r1)，GetAddress(rr1))->Match(r1，rr1)

// upgrade and operate

// to annotate: the RIPv2 agreement has increased the NextHop item in the routing iinformation of message,

This information of // increase is to be used for avoiding packet through unnecessary attached routers

Replace(r1，rr1)＝

if(GetNextHop(rr1)＝0.0.0.0)

The NextHop of { //item is 0.0.0.0

if(GetMetric(r1)>GetMetric(rr1)+1)

The Metric value of { // new route is little, does replacement

create(GetAddress(rr1)，GetSourceAddress(rr1)，

GetMetric(rr1)+1，GetSubnetMask(rr1)，0，1)

}

else

{

if(GetGateway(r1)＝GetSourceAddress(rr1)&&

！(GetMetric(r1)＝16 && GetMetric(rr1)+1＝16))

If { // message is that first gateway from the r1 routed path sends

// when new metric is 16, will start deletion process

If the Metric of r1 route has been 16, oneself starts the expression process

// then should not restart deletion process

create(GetAddress(rr1)，GetSourceAddress(rr1)，

GetMetric(rr1)+1，GetSubnetMask(rr1)，0，1)

}

else

The route r1 of { // originally is more excellent, does not do replacement

r1

Else{ //NextHop is effective, if when then the rr1 route is replaced the r1 route,

//r1 to destination node first gateway address of process should be the value of NextHop

// all the other are the same

if(GetMetric(r1)>GetMetric(rr1)+1)

The Metric value of { // new route is little, does replacement

create(GetAddress(rr1)，GetNextHop(rr1)，

GetMetric(rr1)+1，GetSubnetMask(rr1)，0，1)

}

else

{

if(GetGateway(r1)＝GetSourceAddress(rr1)

||GetGateway(r1)＝GetNextHop(rr1))

&&！(GetMetric(r1)＝16 && GetMetric(rr1)+1＝16))

If { // message is that first gateway from the r1 routed path sends

// when new metric is 16, will start deletion process

If the Metric of r1 route has been 16, the expression process starts

// then should not restart deletion process

create(GetAddress(rr1)，GetNextHop(rr1)，

GetMetric(rr1)+1，GetSubnetMask(rr1)，0，1)

}

else

The route r1 of { // originally is more excellent, does not do replacement

r1

// if overtime timer time of ineffective treatment operation // r1 arrives, // then its Metric item is changed to 16, and start the rubbish timer, // be true with the Flag position, start " trigger and upgrade " process NotValidRoute (r1)=if (GetMetric (r1)＜16) ﹠amp; ﹠amp; { // overtime timer the time arrives (GetTimer (r1)=180)

create(GetAddress(r1)，GetGateway(r1)，

16, GetSubnetMask (r1), 0,1) } else{ // overtime timer time does not arrive, preservation initial value r1} // overtime operation // add 30Timeout (r1)=Create (GetAddress (r1) for the Timer item of route r1 every 30 seconds Timeout functions, GetGateway (r1), GetMetric (r1)

GetSubnetMask(r1)，GetTimer(r1)+30，GetFlag(r1))

6) determine the function observed in the protocol description

In our description to the RIP agreement, observable function is meant GetRouteList function and GetResponseList function, and the former effect is the routing table of taking out a router, and latter's effect is the routing table of taking out response message.In reality test, we can see, and to have only message, the routing table of router be to obtain by the response message that the Request message of sending out special for observed router obtains comprising its whole routes.So also regard GetRouteLi st function as can observe function here.

Being defined as follows of two functions:

●GetRouteList

Router: the standard of // router

// all the other contents slightly

E：

// from router, obtain its routing table

GetRouteList：Router->RouterList

● GetResponseList

Response: the standard of // response message

// all the other contents slightly

E：

// from a Response message, obtain its ResponseList

GetResponseList：Response->ResponseList

7) the equation axiom in the sorted algebra standard is rewritten (Rewrite), be transformed into the formal Specification that constitutes by constructed fuction and observable function of equal value, thereby generate cycle tests.

Be that example produces cycle tests so that its routing table of router reception Response message is changed below.

● need the equation axiom of rewriting:

GetRouteList(AcceptResponse(e，p))＝

Union(GetRouteList(e)，GetResponseList(p))

The variation of its routing table is finished description by the Union function that defines behind response message p of this equation axiomatic specification router e acceptance in classification RouteList.Router e receives routing table behind the response message p and be equivalent to the result that the routing table of former e and the routing table that obtains are merged from p.

In this equation axiom, the Union operation is not to observe function, and we need replace it with the mode of rule match.Be below and the relevant rule of Union operation:

Rule 1: routing table L and empty table merging still obtain L

Union(L，Empty)＝L

Rule 2: merge with routing table L after adding routing iinformation rr among the routing table RL, this operation is equivalent to and merges L and RL earlier, adds rr again

Union(L.Add(L1，rr))＝AddReplace(Union(L.L1)，rr)

A) service regeulations 1 are carried out conversion:

Union(L.Empty)＝L

1. carry out rule match, then have

GetResponseList(p)＝Empty

2. make p=create (RL), then have

GetResponseList(create(RL))＝Empty

3. applicable equations axiom: GetResponseList (create (RL))=RL then has

RL＝Empty

→p＝create(Empty)

4. the original axiom of substitution gets

GetRouteList(AcceptResponse(e，create(Emmpty)))＝

GetRouteList (e) (transformation results I)

The physical significance of this cycle tests is:

The Response message that router has received, the routing table of router do not make change.

B) service regeulations 2 are carried out conversion:

Union(L.Add(L1，rr))＝AddReplace(Union(L.L1)，rr)

1. make p=create (Add (RL.rr), then according to rule 2 just like down-conversion process:

Union(GetRouteList(e)，GetRoutelist(create(Add(RL，rr)))

→

AddReplace(Union(GetRouteList(e)，

GetResponselist(create(RL))，rr)

→

AddReplace(GetRouteList(AcceptResponse(e，create(RL)))，rr)

Union(GetRouteList(e)，GetRoutelist(p))

→

Union(GetRouteList(e)，GetResponselist(Create(Add(RL，rr))))

→

GetRouteList(AcceptResponse(e，Create(Add (RL，rr)))

2. cancellation Union gets:

GetRouteList(AcceptResponse(e，Create(Add(RL，rr)))＝

AddReplace(GetRouteList(AcceptResponse(e，Create(RL)))，rr)

In this transformation results, exist these two of AddReplace and AcceptResponse can not observe operation, can further use its dependency rule to mate variation to this, these two can not be observed replacing, thereby produce cycle tests.As space is limited, no longer narration here.

Claims (2)

1, a kind of method of the protocol description based on algebra of structure classes is characterized in that the communication protocol describing method is:

1) analyze the communication protocol text that measured body is realized, determine data division and control section in the version of an agreement, with it as entity object to be described;

2), according to the description of version of an agreement, determine that those entity objects are associated, with these entity object sets definitions finite aggregate S that is the class name of this object to certain entity object;

3) to certain entity object, the generating run of this object has been described in the agreement, these operations are expressed in the mode of function, be called constructed fuction, thereby form the finite aggregate C of this object constructed fuction;

4) to certain entity object, defined various operations in the agreement to this object, comprise and observe operation and control operation, express in the mode of function, be called the continuation function, thereby form the finite aggregate E of this object continuation function;

5) to certain entity object, restriction and requirement have been defined in the agreement to this object, these requirements are expressed with the mode of equation axiom, only comprised constructed fuction and continuation function in this equation axiom, these equation axioms have constituted the finite aggregate E of this object equation axiom;

2, a kind of method for creating test sequence of the protocol description based on algebra of structure classes is characterized in that the cycle tests production method is:

1) according in the test environment to the operation of measured body with observe interface, its counterpart in protocol description is defined as observing function;

2) to each equation axiom in the sorted algebra standard, rewrite (Rewrite) according to the mode of rule match, be transformed into the formal Specification that constitutes by constructed fuction and observable function of equal value;

3) formal Specification that previous step is obtained replaces with the operation that measured body is carried out with constructed fuction wherein, can observe function and replace with the observation operation of carrying out, thereby generate cycle tests.

Images