CN111723008A - Test path generation method based on state transition diagram - Google Patents

Abstract

The invention provides a test path generation method based on a state transition diagram, which comprises the following steps: judging whether a coverage state transfer pair is needed; generating a first set of test paths covering each intermediate state without covering state transition pairs; generating a test path covering each transfer and obtaining a second test path set by taking a union set with the first test path set; determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set; under the condition that the state transition pairs need to be covered, generating a fourth test path set covering each state transition pair; and determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set. The invention can solve the technical problems of low efficiency and insufficient coverage of the method for generating the test path in the prior art.

Description

Test path generation method based on state transition diagram

Technical Field

The invention relates to the technical field of software testing, in particular to a test path generation method based on a state transition diagram.

Background

The flight control software runs on the missile-borne computer, mainly completes control on aspects such as guidance, attitude, time sequence and the like of the missile, and is a neural center of a missile-borne flight control system. The safety and reliability requirements of missile-borne flight control software are high, and if the software fails, catastrophic losses can result. As real-time embedded multi-task scheduling management software, the software is large in scale and complex in operating environment, and has the characteristics of strong inter-task coupling, strict time sequence control, time constraint, random event driving and the like. In the test process, a method for forming a state transition diagram by performing state modeling on the flight task state is generally performed, so that the generation of a test case is guided.

At present, in engineering, a testing person generally derives a testing path according to self understanding and experience, and the method is not only tedious and low in efficiency, but also difficult to ensure effective and sufficient coverage of states and paths.

Disclosure of Invention

The invention provides a test path generation method based on a state transition diagram, which can solve the technical problems of low efficiency and insufficient coverage of a test path generation method in the prior art.

According to an aspect of the present invention, a method for generating a test path based on a state transition diagram is provided, the method including:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each intermediate state without covering state transition pairs in the state transition graph;

generating a test path covering each transfer and obtaining a second test path set by taking a union set with the first test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

Preferably, generating the first set of test paths covering each intermediate state comprises:

s11, selecting the intermediate state S to be covered in the state transition diagram_a；

S12, acquiring the state from the initial state to the intermediate state S_aFirst shortest path P_a′；

S13, acquiring the intermediate state S_aSecond shortest path to termination state_a″；

S14 based on the first shortest path P_a' and second shortest path P_a"obtaining intermediate State S_aTest path P_a；

S15, judging the intermediate state S_aTest path P_aRepeating the existing intermediate state test path, if yes, turning to S16, otherwise, turning to S17;

s16, deleting the intermediate state S_aTest path P_aAnd go to S18;

s17, keeping intermediate state S_aTest path P_aAnd go to S18;

s18, judging whether all the intermediate states in the state transition diagram are completely covered, if so, turning to S19, otherwise, returning to S11;

s19, the generated test paths covering all intermediate states are used as a first test path set.

Preferably, generating the test path covering each transition and merging the test path with the first test path set to obtain the second test path set includes:

s21, selecting the transition C needing to be covered in the state transition diagram_bTransfer of C_bFrom the c-th intermediate state S_cTo d-th intermediate state S_dThe transfer of (2);

s22, obtainingThe initial state reaches the c-th intermediate state S_cFirst shortest path P_b′；

S23, acquiring the d-th intermediate state S_dSecond shortest path to termination state_b″；

S24 based on the first shortest path P_b' and second shortest path P_b"obtaining transfer C_bTest path P_b；

S25, judging transition C_bTest path P_bRepeating with the first set of test paths, if yes, proceeding to S26, otherwise, proceeding to S27;

s26, delete transition C_bTest path P_bAnd go to S28;

s27, transfer C_bTest path P_bUpdating the first test path set to obtain an updated first test path set, and turning to S28;

s28, judging whether all transitions in the state transition diagram are covered completely, if so, turning to S29, otherwise, returning to S21;

and S29, collecting and collecting the generated test paths covering all the transitions and the first test path set to obtain a second test path set.

Preferably, determining the number of cycles of the first cycle sub-path, generating a test path covering each first cycle sub-path, and obtaining a third test path set by taking a union of the test path and the second test path set includes:

s31, selecting the first circulation sub-path to be covered in the state transition diagram (S)_k,...,S_l) And determining the preset cycle times;

s32, acquiring the state from the initial state to the k intermediate state S_kFirst shortest path P_k；

S33, acquiring the I intermediate state S_lSecond shortest path to termination state_l；

S34 based on the first shortest path P_kAnd the second shortest path P_lAcquiring a first cyclic sub-path (S)_k,...,S_l) Test path P_k+l；

S35, judging the first circulation sub-path (S)_k,...,S_l) Test path P_k+lRepeating with the second set of test paths, if yes, proceeding to S36, otherwise, proceeding to S37;

s36, deleting the first circulation sub path (S)_k,...,S_l) Test path P_k+lAnd go to S38;

s37, using the first circulation sub-path (S)_k,...,S_l) Test path P_k+lUpdating the second test path set to obtain an updated second test path set, and turning to S38;

s38, judging whether all the first circulation sub paths in the state transition diagram are completely covered, if so, turning to S39, otherwise, returning to S31;

and S39, collecting and collecting the generated test paths covering all the first circulation sub-paths and the second test path set to obtain a third test path set.

Preferably, generating the fourth set of test paths covering each state transition pair comprises:

s41, determining the highest order number N of the state transition pair to be covered in the state transition diagram;

s42, setting the order n of the state transition pair as 1;

s43, selecting the state transition pair to be covered in the state transition diagram (S)_i,...,S_j)；

S44, acquiring the state from the initial state to the ith intermediate state S_iFirst shortest path P_i；

S45, acquiring the j intermediate state S_jSecond shortest path to termination state_j；

S46 based on the first shortest path P_iAnd the second shortest path P_jObtaining a state transition pair (S)_i,...,S_j) Test path P_i+j；

S47, judging the state transition pair (S)_i,...,S_j) Test path P_i+jRepeating the test path with the existing state transition, if yes, going to S48, otherwise, going to S49;

s48, delete state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s49, reserving state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s410, judging whether the coverage of the n-order state transfer pair is finished, if so, turning to S411, otherwise, returning to S43;

s411, adding 1 to the order n of the state transition pair;

s412, judging whether the order N of the current state switching pair is greater than the highest order N, if so, switching to S413, otherwise, returning to S43;

s413, taking all generated test paths covering the first order to the N order as a fourth test path set;

wherein N is more than or equal to 1 and is an integer, and the N-order state switching pair consists of N +1 intermediate states and N transitions.

Preferably, determining the number of times of the second cyclic sub-paths, generating a test path covering each second cyclic sub-path, and obtaining a fifth test path set by taking a union set of the test paths and the fourth test path set includes:

s51, selecting a second circulation sub-path to be covered in the state transition diagram (S)_s,...,S_t) And determining the preset cycle times;

s52, acquiring the state from the initial state to the S intermediate state S_sFirst shortest path P_s；

S53, acquiring the t intermediate state S_tSecond shortest path to termination state_t；

S54 based on the first shortest path P_sAnd the second shortest path P_tAcquiring a second cyclic sub-path (S)_s,...,S_t) Test path P_s+t；

S55, judging the second circulation sub path (S)_s,...,S_t) Test path P_s+tRepeating with the fourth set of test paths, if yes, proceeding to S56, otherwise, proceeding to S57;

s56, deleting the second circulation sub path (S)_s,...,S_t) Test path P_s+tAnd go to S58;

s57, using the second circulation sub-path (S)_s,...,S_t) Test path P_s+tUpdating the fourth test path set to obtain an updated fourth test path set, and turning to S58;

s58, judging whether all the second circulation sub paths in the state transition diagram are completely covered, if so, turning to S59, otherwise, returning to S51;

and S59, collecting and collecting the generated test paths covering all the second circulation sub-paths and the fourth test path set to obtain a fifth test path set.

According to another aspect of the present invention, there is provided a test path generation method based on a state transition diagram, the method including:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each transition without covering the state transition pairs in the state transition graph;

generating a test path covering each intermediate state and taking a union set with the first test path set to obtain a second test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

By applying the technical scheme of the invention, under the condition that the state transition pair in the state transition diagram is not required to be covered, all the test path sets are generated through the intermediate state covering, the transition covering and the circulation sub-path covering, and under the condition that the state transition pair in the state transition diagram is required to be covered, all the test path sets are generated through the state transition pair covering and the circulation sub-path covering, so that the requirement of the sufficiency coverage of the test requirement of the flight control software is met, and the effectiveness of the software test is improved. The invention can help the tester to generate an effective test path in the test process, thereby guiding the high-efficiency generation of the test case.

Drawings

The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.

Fig. 1 is a flowchart illustrating a test path generation method based on a state transition diagram according to an embodiment of the present invention;

FIG. 2 illustrates a flow diagram for overlaying an intermediate state provided in accordance with a specific embodiment of the present invention;

FIG. 3 illustrates a flow diagram of an overlay transfer provided in accordance with a specific embodiment of the present invention;

FIG. 4 illustrates a flow diagram provided in accordance with a specific embodiment of the present invention covering a first loop sub-path;

FIG. 5 illustrates a flow diagram of an overlay state transition pair provided in accordance with a specific embodiment of the present invention;

FIG. 6 illustrates a flow diagram provided in accordance with a specific embodiment of the present invention covering a second loop sub-path;

fig. 7 illustrates an airplane control software state transition diagram provided according to a specific embodiment of the present invention.

Detailed Description

It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.

The relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise. Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description. Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate. In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

Fig. 1 is a flowchart illustrating a test path generation method based on a state transition diagram according to an embodiment of the present invention. As shown in fig. 1, the present invention provides a test path generating method based on a state transition diagram, including:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each intermediate state without covering state transition pairs in the state transition graph;

generating a test path covering each transfer and obtaining a second test path set by taking a union set with the first test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

By applying the technical scheme of the invention, under the condition that the state transition pair in the state transition diagram is not required to be covered, all the test path sets are generated through the intermediate state covering, the transition covering and the circulation sub-path covering, and under the condition that the state transition pair in the state transition diagram is required to be covered, all the test path sets are generated through the state transition pair covering and the circulation sub-path covering, so that the requirement of the sufficiency coverage of the test requirement of the flight control software is met, and the effectiveness of the software test is improved. The invention can help the tester to generate an effective test path in the test process, thereby guiding the high-efficiency generation of the test case.

To facilitate understanding of the present invention, the state transition diagram, the n-order state transition pairs and the test paths are now represented in a set form, as follows:

a state transition diagram is denoted by SD (S, Λ, E), where S is the set of start states, E is the set of end states, Λ is ∑Λ_i＝∑(S_i,C_i,S_i+1) Is a collection of intermediate states and transitions, S_iIs an intermediate state, S_i+1Is another intermediate state, C_iIs a condition for making a transition between two adjacent intermediate states, i.e. a transition.

By T_n＝((S_m,C_m,S_m+1),...,(S_m+i,C_m+i,S_m+i+1),...,(S_m+n,C_m+n,S_m+n+1) Represents an n-order state transition pair, wherein S_m、S_m+1、S_m+i、S_m+i+1、S_m+n、S_m+n+1Are all in an intermediate state, C_m、C_m+i、C_m+nAre all transitions, the n-order state transition pair T_nThe n +1 intermediate states and n transitions involved are taken as a whole.

With P being ∑Λ_i＝((S_p,C_p,S_p+1),…,(S_i,C_i,S_i+1),…,(S_q-1,C_q-1,S_q) From an initial state S)_pTo a termination state S_qOne path of (2), Num (Λ)_i) Is the length of path P. Wherein, if satisfy

Has S_r1≠S_r2If yes, the path P is said to be a path not including the cyclic sub-path; if it satisfies

S_r1＝S_r2If so, the path P is called a test path including a cyclic sub-path; if P_r＝((S_r1,C_r1,S_r1+1),…,(S_i,C_i,S_i+1)，…,(S_r2-1,C_r2,S_r2) ∈ P, with and only with S_r1＝S_r2Then P is_rIs a cyclic sub-path.

FIG. 2 illustrates a flow diagram for overlaying intermediate states provided in accordance with a specific embodiment of the present invention. According to an embodiment of the invention, as shown in FIG. 2, generating the first set of test paths to cover each of the intermediate states comprises:

s11, selecting the intermediate state S to be covered in the state transition diagram_a；

S12, acquiring the state from the initial state to the intermediate state S_aFirst shortest path P_a′；

S13, acquiring the intermediate state S_aSecond shortest path to termination state_a″；

S14 based on the first shortest path P_a' and second shortest path P_a"obtaining intermediate State S_aTest path P_a；

S15, judging the intermediate state S_aTest path P_aRepeating the existing intermediate state test path, if yes, turning to S16, otherwise, turning to S17;

s16, deleting the intermediate state S_aTest path P_aAnd go to S18;

s17, keeping intermediate state S_aTest path P_aAnd go to S18;

s18, judging whether all the intermediate states in the state transition diagram are completely covered, if so, turning to S19, otherwise, returning to S11;

s19, the generated test paths covering all intermediate states are used as a first test path set.

One or more termination states may be provided, and a case where there are a plurality of termination states will be described below.

For example, in the case of two end states, if the intermediate state S is present_aThe path lengths to the first and second end states are the same, the intermediate state S_aThe paths reaching the first termination state and the second termination state are both the second shortest path, and at the moment, two intermediate states S are obtained_aTest path P_a(ii) a If the intermediate state S_aIf the path lengths to the first end state and the second end state are different, the intermediate state S is obtained_aThe shorter of the paths to the first end state or the second end state is taken as the second shortest path, and an intermediate state S is obtained_aTest path P_a。

In addition, the intermediate state overrides in the manner described above ensure that each state in the state transition diagram is accessed at least once.

FIG. 3 illustrates a flow diagram of an overlay transfer provided in accordance with a specific embodiment of the present invention. According to an embodiment of the present invention, as shown in fig. 3, generating a test path covering each transition and merging with the first test path set to obtain a second test path set includes:

s21, selecting the transition C needing to be covered in the state transition diagram_bTransfer of C_bFrom the c-th intermediate state S_cTo d-th intermediate state S_dThe transfer of (2);

s22, acquiring the state from the initial state to the c intermediate state S_cFirst shortest path P_b′；

S23, acquiring the d-th intermediate state S_dSecond shortest path to termination state_b″；

S24 based on the first shortest path P_b' and second shortest path P_b"obtaining transfer C_bTest path P_b；

S25, judging transition C_bTest path P_bRepeating with the first set of test paths, if yes, proceeding to S26, otherwise, proceeding to S27;

s26, delete transition C_bTest path P_bAnd go to S28;

s27, transfer C_bTest path P_bUpdating the first test path set to obtain an updated first test path set, and turning to S28;

s28, judging whether all transitions in the state transition diagram are covered completely, if so, turning to S29, otherwise, returning to S21;

and S29, collecting and collecting the generated test paths covering all the transitions and the first test path set to obtain a second test path set.

The transition coverage is carried out in the above mode, and each transition in the state transition diagram can be ensured to be activated at least once.

Fig. 4 illustrates a flow diagram of an overlay loop sub-path provided in accordance with a specific embodiment of the present invention. According to an embodiment of the present invention, as shown in fig. 4, determining the number of cycles of the first cycle sub-path, generating a test path covering each first cycle sub-path, and merging the test path with the second test path set to obtain a third test path set includes:

s31, selecting the first circulation sub-path to be covered in the state transition diagram (S)_k,...,S_l) And determining the preset cycle times;

s32, acquiring the state from the initial state to the k intermediate state S_kFirst shortest path P_k；

S33, acquiring the I intermediate state S_lSecond shortest path to termination state_l；

S34 based on the first shortest path P_kAnd the second shortest path P_lAcquiring a first cyclic sub-path (S)_k,...,S_l) Test path P_k+l；

S35, judging the first circulation sub-path (S)_k,...,S_l) Test path P_k+lRepeating with the second set of test paths, if yes, proceeding to S36, otherwise, proceeding to S37;

s36, deleting the first circulation sub path (S)_k,...,S_l) Test path P_k+lAnd go to S38;

s37, using the first circulation sub-path (S)_k,...,S_l) Test path P_k+lUpdating the second test path set to obtain an updated second test path set, and turning to S38;

s38, judging whether all the first circulation sub paths in the state transition diagram are completely covered, if so, turning to S39, otherwise, returning to S31;

and S39, collecting and collecting the generated test paths covering all the first circulation sub-paths and the second test path set to obtain a third test path set.

The method is adopted for covering the circulation sub-paths, so that each circulation sub-path in the state transition diagram can be repeatedly executed for M times, and the value of M is determined according to the measured object.

Fig. 5 illustrates a flow diagram of an overlay state transition pair provided in accordance with a specific embodiment of the present invention. According to an embodiment of the invention, as shown in FIG. 5, generating a fourth set of test paths covering each state transition pair comprises:

s41, determining the highest order number N of the state transition pair to be covered in the state transition diagram;

s42, setting the order n of the state transition pair as 1;

s43, selecting the state transition pair to be covered in the state transition diagram (S)_i,...,S_j)；

S44, acquiring the state from the initial state to the ith intermediate state S_iFirst shortest path P_i；

S45, acquiring the j intermediate state S_jSecond shortest path to termination state_j；

S46 based on the first shortest path P_iAnd the second shortest path P_jObtaining a state transition pair (S)_i,...,S_j) Test path P_i+j；

S47, judging the state transition pair (S)_i,...,S_j) Test path P_i+jRepeating the test path with the existing state transition, if yes, going to S48, otherwise, going to S49;

S48、delete state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s49, reserving state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s410, judging whether the coverage of the n-order state transfer pair is finished, if so, turning to S411, otherwise, returning to S43;

s411, adding 1 to the order n of the state transition pair;

s412, judging whether the order N of the current state switching pair is greater than the highest order N, if so, switching to S413, otherwise, returning to S43;

s413, taking all generated test paths covering the first order to the N order as a fourth test path set;

wherein N is more than or equal to 1 and is an integer, and the N-order state switching pair consists of N +1 intermediate states and N transitions.

The state transition pair covering is carried out in the mode, each state transition pair of the previous N orders in the state transition diagram can be ensured to pass through once, and the value of N is determined according to the measured object. A value of 2 will generally suffice for the coverage requirement.

Fig. 6 illustrates a flow chart for covering the second loop sub-path provided in accordance with a specific embodiment of the present invention. According to an embodiment of the present invention, as shown in fig. 6, determining the number of times of the second loop sub-path is looped, generating a test path covering each second loop sub-path, and merging the test path with the fourth test path set to obtain a fifth test path set includes:

s51, selecting a second circulation sub-path to be covered in the state transition diagram (S)_s,...,S_t) And determining the preset cycle times;

s52, acquiring the state from the initial state to the S intermediate state S_sFirst shortest path P_s；

S53, acquiring the t intermediate state S_tSecond shortest path to termination state_t；

S54 based on the first shortest path P_sAnd the second shortest path P_tObtainingSecond cyclic sub-path (S)_s,...,S_t) Test path P_s+t；

S55, judging the second circulation sub path (S)_s,...,S_t) Test path P_s+tRepeating with the fourth set of test paths, if yes, proceeding to S56, otherwise, proceeding to S57;

s56, deleting the second circulation sub path (S)_s,...,S_t) Test path P_s+tAnd go to S58;

s57, using the second circulation sub-path (S)_s,...,S_t) Test path P_s+tUpdating the fourth test path set to obtain an updated fourth test path set, and turning to S58;

s58, judging whether all the second circulation sub paths in the state transition diagram are completely covered, if so, turning to S59, otherwise, returning to S51;

and S59, collecting and collecting the generated test paths covering all the second circulation sub-paths and the fourth test path set to obtain a fifth test path set.

The method is adopted for covering the circulation sub-paths, so that each circulation sub-path in the state transition diagram can be repeatedly executed for M times, and the value of M is determined according to the measured object.

In the present invention, in the case that the state transition pair in the overlay state transition diagram is not required, the above embodiment provides an example of overlay first intermediate state and overlay second transition, and the following provides an embodiment of overlay first intermediate state and overlay second intermediate state, and the method is specifically as follows:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each transition without covering the state transition pairs in the state transition graph;

generating a test path covering each intermediate state and taking a union set with the first test path set to obtain a second test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

In the present invention, when the state transition pair in the state transition diagram is not required to be covered, the intermediate state may be covered after the coverage transition, or the intermediate state may be covered before the coverage transition. When the state transition pair in the overlay state transition diagram is needed, the overlay transition and the overlay intermediate state operation are already included in the process of performing the overlay state transition pair, so that only the overlay state transition pair is required.

Fig. 7 illustrates an airplane control software state transition diagram provided according to a specific embodiment of the present invention.

The present invention will be described in detail below by taking a certain type of flight control software as an example. In the embodiment, 13 states (a0, a1, a2, a., a12) and 24 transitions (1,2,3, a., 24) are defined, it is set that the flight control software state transition diagram needs to cover a state transition pair, the highest order N of the covered state transition pair is 2-order, and the preset number of loop times of the loop sub-path is 1, where a0 is a start state, A3 and a9 are end states, and the rest are intermediate states, the defined 13 states are function states of the flight control software, and the defined 24 transitions are state transitions of the flight control software.

The method of the present invention is adopted to generate the test paths for the flight control software state transition diagram in fig. 7, and 32 test paths are generated in total, as shown in table 1.

TABLE 1 test Path

Spatially relative terms, such as "above … …," "above … …," "above … …," "above," and the like, may be used herein for ease of description to describe one device or feature's spatial relationship to another device or feature as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if a device in the figures is turned over, devices described as "above" or "on" other devices or configurations would then be oriented "below" or "under" the other devices or configurations. Thus, the exemplary term "above … …" can include both an orientation of "above … …" and "below … …". The device may be otherwise variously oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly.

It should be noted that the terms "first", "second", and the like are used to define the components, and are only used for convenience of distinguishing the corresponding components, and the terms have no special meanings unless otherwise stated, and therefore, the scope of the present invention should not be construed as being limited.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (7)

1. A test path generation method based on a state transition diagram is characterized by comprising the following steps:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each intermediate state without covering state transition pairs in the state transition graph;

generating a test path covering each transfer and obtaining a second test path set by taking a union set with the first test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

2. The method of claim 1, wherein generating the first set of test paths to cover each intermediate state comprises:

s11, selecting the intermediate state S to be covered in the state transition diagram_a；

S12, acquiring the state from the initial state to the intermediate state S_aFirst shortest path P_a′；

S13, acquiring the intermediate state S_aSecond shortest path to termination state_a″；

S14 based on the first shortest path P_a' and second shortest path P_a"obtaining intermediate State S_aTest path P_a；

S15, judging the intermediate state S_aTest path P_aRepeating the existing intermediate state test path, if yes, turning to S16, otherwise, turning to S17;

s16, deleting the intermediate state S_aTest path P_aAnd go to S18;

s17, keeping intermediate state S_aTest path P_aAnd go to S18;

s18, judging whether all the intermediate states in the state transition diagram are completely covered, if so, turning to S19, otherwise, returning to S11;

s19, the generated test paths covering all intermediate states are used as a first test path set.

3. The method of claim 1, wherein generating a test path that covers each transition and merging with the first set of test paths to obtain a second set of test paths comprises:

s21, selecting the transition C needing to be covered in the state transition diagram_bTransfer of C_bFrom the c-th intermediate state S_cTo d-th intermediate state S_dThe transfer of (2);

s22, acquiring the state from the initial state to the c intermediate state S_cFirst shortest path P_b′；

S23, acquiring the d-th intermediate state S_dSecond shortest path to termination state_b″；

S24 based on the first shortest path P_b' and second shortest path P_b"obtaining transfer C_bTest path P_b；

S25, judging transition C_bTest path P_bRepeating with the first set of test paths, if yes, proceeding to S26, otherwise, proceeding to S27;

s26, delete transition C_bTest path P_bAnd go to S28;

s27, transfer C_bTest path P_bUpdating the first test path set to obtain an updated first test path set, and turning to S28;

s28, judging whether all transitions in the state transition diagram are covered completely, if so, turning to S29, otherwise, returning to S21;

and S29, collecting and collecting the generated test paths covering all the transitions and the first test path set to obtain a second test path set.

4. The method of claim 1, wherein determining a number of cycles for a first cycle sub-path, generating a test path that covers each first cycle sub-path and pooling the test path with a second set of test paths to obtain a third set of test paths comprises:

s31, selecting the first circulation sub-path to be covered in the state transition diagram (S)_k,...,S_l) And determining the preset cycle times;

s32, acquiring the state from the initial state to the k intermediate state S_kFirst shortest path P_k；

S33, acquiring the I intermediate state S_lSecond shortest path to termination state_l；

S34 based on the first shortest path P_kAnd the second shortest path P_lAcquiring a first cyclic sub-path (S)_k,...,S_l) Test path P_k+l；

S35, judging the first circulation sub-path (S)_k,...,S_l) Test path P_k+lRepeating with the second set of test paths, if yes, proceeding to S36, otherwise, proceeding to S37;

s36, deleting the first circulation sub path (S)_k,...,S_l) Test path P_k+lAnd go to S38;

s37, using the first circulation sub-path (S)_k,...,S_l) Test path P_k+lUpdating the second test path set to obtain an updated second test path set, and turning to S38;

s38, judging whether all the first circulation sub paths in the state transition diagram are completely covered, if so, turning to S39, otherwise, returning to S31;

and S39, collecting and collecting the generated test paths covering all the first circulation sub-paths and the second test path set to obtain a third test path set.

5. The method of claim 1, wherein generating a fourth set of test paths covering each state transition pair comprises:

s41, determining the highest order number N of the state transition pair to be covered in the state transition diagram;

s42, setting the order n of the state transition pair as 1;

s43, selecting the state transition pair to be covered in the state transition diagram (S)_i,...,S_j)；

S44, acquiring the state from the initial state to the ith intermediate state S_iFirst shortest path P_i；

S45, acquiring the j intermediate state S_jSecond shortest path to termination state_j；

S46 based on the first shortest path P_iAnd the second shortest path P_jObtaining a state transition pair (S)_i,...,S_j) Test path P_i+j；

S47, judging the state transition pair (S)_i,...,S_j) Test path P_i+jRepeating the test path with the existing state transition, if yes, going to S48, otherwise, going to S49;

s48, delete state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s49, reserving state transition pair (S)_i,...,S_j) Test path P_i+jAnd go to S410;

s410, judging whether the coverage of the n-order state transfer pair is finished, if so, turning to S411, otherwise, returning to S43;

s411, adding 1 to the order n of the state transition pair;

s412, judging whether the order N of the current state switching pair is greater than the highest order N, if so, switching to S413, otherwise, returning to S43;

s413, taking all generated test paths covering the first order to the N order as a fourth test path set;

wherein N is more than or equal to 1 and is an integer, and the N-order state switching pair consists of N +1 intermediate states and N transitions.

6. The method of claim 1, wherein determining a number of cycles of the second-cycle sub-paths, generating a test path that covers each of the second-cycle sub-paths and merging with the fourth set of test paths to obtain a fifth set of test paths comprises:

s51, selecting a second circulation sub-path to be covered in the state transition diagram (S)_s,...,S_t) And determining the preset cycle times;

s52, acquiring the state from the initial state to the S intermediate state S_sFirst shortest path P_s；

S53, acquiring the t intermediate state S_tSecond shortest path to termination state_t；

S54 based on the first shortest path P_sAnd the second shortest path P_tAcquiring a second cyclic sub-path (S)_s,...,S_t) Test path P_s+t；

S55, judging the second circulation sub path (S)_s,...,S_t) Test path P_s+tRepeating with the fourth set of test paths, if yes, proceeding to S56, otherwise, proceeding to S57;

s56, deleting the second circulation sub path (S)_s,...,S_t) Test path P_s+tAnd go to S58;

s57, using the second circulation sub-path (S)_s,...,S_t) Test path P_s+tUpdating the fourth test path set to obtain an updated fourth test path set, and turning to S58;

s58, judging whether all the second circulation sub paths in the state transition diagram are completely covered, if so, turning to S59, otherwise, returning to S51;

and S59, collecting and collecting the generated test paths covering all the second circulation sub-paths and the fourth test path set to obtain a fifth test path set.

7. A test path generation method based on a state transition diagram is characterized by comprising the following steps:

judging whether a state transition pair in a state transition diagram needs to be covered or not;

generating a first set of test paths covering each transition without covering the state transition pairs in the state transition graph;

generating a test path covering each intermediate state and taking a union set with the first test path set to obtain a second test path set;

determining the cycle times of the first cycle sub-paths, generating a test path covering each first cycle sub-path, and collecting and combining the test path with the second test path to obtain a third test path set;

under the condition that the state transition pairs in the state transition diagram need to be covered, generating a fourth test path set covering each state transition pair;

determining the cycle times of the second cycle sub-paths, generating a test path covering each second cycle sub-path, and collecting and combining the test path with the fourth test path to obtain a fifth test path set;

wherein the state transition diagram comprises a start state, at least one intermediate state and at least one end state, the start state and each intermediate state having a transition to a certain end state, the state transition pair consisting of any two or more transferable intermediate states and transitions between transferable intermediate states.

Images