CN107977314A - A kind of method that process task block dependence is obtained based on matrix - Google Patents

A kind of method that process task block dependence is obtained based on matrix Download PDF

Info

Publication number
CN107977314A
CN107977314A CN201711216919.4A CN201711216919A CN107977314A CN 107977314 A CN107977314 A CN 107977314A CN 201711216919 A CN201711216919 A CN 201711216919A CN 107977314 A CN107977314 A CN 107977314A
Authority
CN
China
Prior art keywords
mtd
mrow
matrix
mtr
mtable
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711216919.4A
Other languages
Chinese (zh)
Other versions
CN107977314B (en
Inventor
曲明成
陈蛟龙
王冠楠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Heilongjiang Yitong Intelligent Education Technology Co ltd
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201711216919.4A priority Critical patent/CN107977314B/en
Publication of CN107977314A publication Critical patent/CN107977314A/en
Application granted granted Critical
Publication of CN107977314B publication Critical patent/CN107977314B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3668—Software testing
    • G06F11/3672—Test management
    • G06F11/3684—Test management for test design, e.g. generating new test cases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3668—Software testing
    • G06F11/3672—Test management
    • G06F11/3688—Test management for test execution, e.g. scheduling of test suites

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Hall/Mr Elements (AREA)
  • For Increasing The Reliability Of Semiconductor Memories (AREA)
  • Debugging And Monitoring (AREA)

Abstract

A kind of method that process task block dependence is obtained based on matrix, the present invention relates to the acquisition process task block dependence method based on matrix.The purpose of the present invention is to solve the search of the existing method of exhaustion to need to travel through all orders being likely to occur, while also needs to constantly build test case, it is time-consuming and laborious the problem of.One input test use-case；Two are converted into relational matrix；Three work as α >=β, turn four；As α ＜ β, turn nine；Four determine it is correct in have that several places and mistake are different, turns five；Five as α ＞ β, turn six；As α=β, turn seven；Six obtain relation consistent matrix, turn eight；Seven obtain dependence matrix, turn 13；Eight obtain dependence matrix, turn 13；9th, determine it is correct in have several places and the mistake different；Perform ten；Tenth, supplementary set relational matrix is obtained；Turn 11；11 obtain new supplementary set relational matrix；12, dependence matrix is obtained；Turn 13；13 obtain dependence and export.The present invention determines field for task block dependence.

Description

A kind of method that process task block dependence is obtained based on matrix
Technical field
The present invention relates to the acquisition process task block dependence method based on matrix.
Background technology
Several concurrently performing for tasks, priority is identical, and each task can be split into several blocks, be associated in task The concurrent execution sequence of block (having an impact each other) can impact final result, it is assumed that can produce some test cases to this Some built-up sequences of a little associated blocks are tested, and obtain result correctly or incorrectly.According to the execution sequence of associated block and As a result mistake is made inferences, infers the execution sequence of associated block.Need to travel through all be likely to occur using method of exhaustion search Sequentially, while also need to constantly build test case.Therefore, this method is time-consuming and laborious, should not synchronously be asked for Optimization Progress Topic.Therefore, it is necessary to a healthy and strong algorithm to find out different task crucial execution sequence in the block.
The content of the invention
The purpose of the present invention is to solve the search of the existing method of exhaustion to need to travel through all orders being likely to occur, at the same time also Need constantly to build test case, it is time-consuming and laborious the problem of, and propose it is a kind of process task block obtained based on matrix rely on close The method of system.
It is a kind of based on matrix obtain process task block dependence method detailed process be：
Step 1: input is correct and error checking use-case, test case include all process task blocks；
Step 2: convert test cases to relational matrix；
Relational matrix includes correct relation matrix, fault relationships matrix, relation consistent matrix, dependence matrix；
In relational matrix matrix, 1 represents prior to performing, and 0 representative is not considered after execution, -1；
Correct relation matrix：By the matrix of correct test case sequence construct；
Fault relationships matrix：By the matrix of the test case sequence construct of mistake；
Relation consistent matrix：The subtask block of different task does not have the matrix of precedence relationship；
Dependence matrix：There is definite dependence between the subtask block of different task；
Step 3: as α >=β, step 4 is performed；As α ＜ β, step 9 is performed；α is correct test case number, β For error checking use-case number；
Step 4: new matrix B 1 ' is obtained into row matrix reducing to β correct relation matrix and fault relationships matrix And B2 ', according to B1 ' and B2 ' determine to have in correct test case several places and error checking use-case different；Perform step 5；
Step 5: as α ＞ β, step 6 is performed；As α=β, step 7 is performed；
Operated Step 6: being handed over into row matrix alpha-beta correct relation matrix, obtain relation consistent matrix；Perform step 8；
Step 7: the new matrix B 1 ' and B2 ' that are obtained to step 4 are handed over into row matrix and operated, dependence matrix is obtained； Perform 13；
Step 8: the relation consistent matrix that the new matrix B 1 ' and B2 ' and step 6 that are obtained to step 4 obtain Hand over and operate into row matrix, obtain dependence matrix；Perform step 13；
Step 9: new matrix B 1 ' is obtained into row matrix reducing to α correct relation matrix and fault relationships matrix And B2 ', according to B1 ' and B2 ' determine to have in correct test case several places and error checking use-case different；Perform step 10；
Step 10: carrying out matrix supplement operation to-α correct relation matrixes of β, supplementary set relational matrix b1 and b2 are obtained；Hold Row step 11；
Step 11: carrying out friendship operation to supplementary set relational matrix b1 and b2, new supplementary set relational matrix b1 ' is obtained；
Step 12: the new supplementary set relation that the new matrix B 1 ' and B2 ' and step 11 that are obtained to step 9 obtain Matrix b1 ' is handed over into row matrix and operated, and obtains dependence matrix；Perform step 13；
Step 13: according to the dependence matrix of acquisition, obtain dependence and export.
Beneficial effects of the present invention are：
The present invention proposes that a kind of Process Synchronization intermodule dependence obtains method for generating test case, if according to existing Dry correct and mistake test case, generates new test case and verification, obtains the dependence of intermodule.
A set of relationship search algorithm based on set is provided, realizes that the present invention provides one kind for the ease of computer Dependence set is realized based on the method for matrix.For these matrixes, specification of the present invention is defined with set characteristic Matrix manipulation is matrix reducing, matrix respectively and is operated, the friendship operation of matrix supplement and matrix, and time complexity is extremely low, saves Shi Shengli, and its crucial execution sequence can be found out according to different process schedulings.This method only needs Ergodic Matrices, therefore Its time complexity is n2, and the exhaustive search method of brute-force is n！, therefore, the method for the present invention can greatly reduce method and hold The capable time.
The priority execution sequence relation between different task sub-block is built in a manner of set；Use a matrix to represent set Ordinal relation between middle task sub-block, is realized easy to computer；Matrix is defined according to the thought specification of set yojan and subtracts behaviour Make, different test cases are associated；It is proposed matrix and operate, hand over operation and matrix supplement to carry out all test cases Unified calculation；The key task block execution sequence of output is represented with matrix, easy to express.
Brief description of the drawings
Fig. 1 is dependence flow chart of the present invention.
Embodiment
Embodiment one：Illustrate stupid embodiment with reference to Fig. 1, one kind of present embodiment is based on matrix and obtains process The method detailed process of task block dependence is：
Step 1: input is correct and error checking use-case, test case include all process task blocks；
Step 2: convert test cases to relational matrix；
The relation between two task blocks is stored using matrix, matrix correspond to the set of relationship of each test case； In matrix, it is -1,0,1 respectively to share three values.
" -1 " not discusses that " 0 " represents i-th of task block execution sequence and lags behind j-th of task block, and " 1 " represents i-th Prior to j-th task block of task block execution sequence；I.e.：
" 0 " represents that the execution sequence of i lags behind j；
" 1 " represents the execution sequence of i prior to j；
The lower triangle of order matrix is set to -1 including diagonal；Therefore, the value of upper triangle is only considered in the present invention；
Assuming that sharing m task, task is a respectively1, a2..., ai..., am；Each task can be divided into n block, such as ai1, ai2..., aij..., ain, wherein 1≤i≤m, 1≤j≤n, m, n value are positive integer；
The matrix of (m+n) * (m+n) is built according to these task block precedence relationships；
Each test case is the sequence being made of (m*n) a task block, what which was ordered into；Therefore used according to test Example sequence construct relational matrix；
Relational matrix includes correct relation matrix, fault relationships matrix, relation consistent matrix, dependence matrix；
In relational matrix matrix, 1 represents prior to performing, and 0 representative is not considered after execution, -1；
Correct relation matrix：By the matrix of correct test case sequence construct；
Fault relationships matrix：By the matrix of the test case sequence construct of mistake；
Relation consistent matrix：There is no the matrix of precedence relationship between the subtask block of different task；
Dependence matrix：There is definite dependence between the subtask block of different task.
Step 3: as α >=β, step 4 is performed；As α ＜ β, step 9 is performed；α is correct test case number, β For error checking use-case number；
Step 4: new matrix B 1 ' is obtained into row matrix reducing to β correct relation matrix and fault relationships matrix And B2 ', according to B1 ' and B2 ' determine to have in correct test case several places and error checking use-case different；Perform step 5；
Step 5: as α ＞ β, step 6 is performed；As α=β, step 7 is performed；
Operated Step 6: being handed over into row matrix alpha-beta correct relation matrix；Obtain relation consistent matrix；Perform step 8；
Step 7: the new matrix B 1 ' and B2 ' (β (α=β)) that are obtained to step 4 are handed over into row matrix and operated, obtain according to Rely relational matrix；Perform 13；
Step 8: the relation consistent matrix that the new matrix B 1 ' and B2 ' and step 6 that are obtained to step 4 obtain Hand over and operate into row matrix, obtain dependence matrix；Perform step 13；
Step 9: new matrix B 1 ' is obtained into row matrix reducing to α correct relation matrix and fault relationships matrix And B2 ', according to B1 ' and B2 ' determine to have in correct test case several places and error checking use-case different；Perform step 10；
Step 10: matrix supplement operation is carried out to-α correct relation matrixes of β；Obtain supplementary set relational matrix b1 and b2；Hold Row step 11；
Step 11: carrying out friendship operation to supplementary set relational matrix b1 and b2, new supplementary set relational matrix b1 ' is obtained；
Step 12: the new supplementary set relation that the new matrix B 1 ' and B2 ' and step 11 that are obtained to step 9 obtain Matrix b1 ' is handed over into row matrix and operated, and obtains dependence matrix；Perform step 13；Step 13: closed according to the dependence of acquisition It is matrix, obtains dependence and export.
Embodiment two：The present embodiment is different from the first embodiment in that：Will test in the step 2 Use-case is converted into relational matrix；Detailed process is：
Relational matrix includes correct relation matrix, fault relationships matrix, relation consistent matrix, dependence matrix；
A1 task blocks have A, B subtasks block；A2 task blocks have C, D subtasks block；
Wherein correct test case has A, B, C, D；A, C, B, D, the test case of mistake have ACDB, CDAB；
Correct relation matrix A 1, A2 is built according to correct test case；
According to the test case of mistake structure fault relationships matrix B 1, B2；
Drawn at the same time according to two correct test cases：There is no precedence relationship between two task blocks of C and B, build relation Consistent matrix C1；
According to A1, A2, C1 matrixes show that the B in a1 tasks must be before the D in a2 tasks, therefore build dependence square Battle array D1；
It is as follows respectively：
Other steps and parameter are identical with embodiment one.
Embodiment three：The present embodiment is different from the first and the second embodiment in that：To β in the step 4 A correct relation matrix and fault relationships matrix obtain new matrix B 1 ' and B2 ', according to B1 ' and B2 into row matrix reducing ' Determine to have in correct test case several places and error checking use-case different；Detailed process is：
After dependence is converted into expression matrix, the mathematical operation in set theory can be utilized, to numerous matrixes Operated, carry out simplification matrix quantity, obtain the dependence matrix needed to the end.
Matrix reducing
Matrix reducing is the core of matrix manipulation.The present invention utilizes subtracting in set theory according to the thought of yojan Computing, subtracts fault relationships matrix by correct relation matrix, obtains new matrix；
Under the operation, if the value of two matrix respective items is identical, output -1；If the value phase of two matrix respective items Instead, then the value in correct relation matrix is exported.In the present invention, the calculating symbol of matrix reducing is '-'；
Process is：
Correct relation matrix A 1 is subtracted into fault relationships matrix B 1, new matrix B 1 ' is obtained, correct relation matrix A 2 is subtracted Fault relationships matrix B 2 is gone, obtains new matrix B 2 '；As：
Wherein, in B1 ' matrixes, the value that the row of the second rows of B1 ' the 3rd and the second rows of B1 ' the 4th arrange is 1, remaining is -1, It is different with error checking use-case at two to illustrate that correct test case only has；
In B2 ' matrixes, the value that the row of B2 ' the first rows the 3rd, the row of B2 ' the first rows the 4th and the second rows of B2 ' the 4th arrange is 1, Remaining is -1, and it is different with error checking use-case at three to illustrate that correct test case only has.
Other steps and parameter are the same as one or two specific embodiments.
Embodiment four：Unlike one of present embodiment and embodiment one to three：The step 6 In to alpha-beta correct relation matrix into row matrix hand over operate；Obtain relation consistent matrix；Detailed process is：
Correct relation matrix hands over operation
In above it has been already mentioned that when correct relation matrix number α is more than fault relationships matrix number β, it should to alpha-beta A correct relation matrix is handed over into row matrix and operated, and obtains relation consistent matrix；
In the present invention, these relational matrix are carried out to ship calculation using the calculation of shipping in set theory.But with set theory Unlike, the opposite data item output -1 of value.In the present invention, the operation is used tricks operator number ' ∩ ' to represent.
If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is not Become；
After i.e. 0 and 1,1 and 0 does friendship operation, export as -1；After 1 and 1 matrix does friendship operation, export as 1；0 and 0 is friendship behaviour After work, export as 0.
Process is：
Using A1 and A2 matrixes, C1 is obtained；Wherein, it is all mutually 1, difference takes -1, is：
Obtain in two correct matrixes only have one differ, and by its value output be -1.
Other steps and parameter are identical with one of embodiment one to three.
Embodiment five：Unlike one of present embodiment and embodiment one to four：The step 7 In the new matrix B 1 ' that is obtained to step 4 and B2 ' (β (α=β)) hand over and operate into row matrix, obtain dependence matrix；Tool Body process is：
Obtain dependence matrix
After new matrix B 1 ' and B2 ' matrixes is obtained, it is also necessary to B1 ' and B2 ' matrix carry out friendship operation, export according to Rely relational matrix.In the present invention, matrix hands over operation still to use tricks operator number ' ∩ ' to represent.
Under the operation,
If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which not examines Consider；
If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is not Become；
0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1.
Obtained matrix B 1 ' and B2 ' is handed over into row matrix and is operated, obtains dependence matrix；Output
Other steps and parameter are identical with one of embodiment one to four.
Embodiment six：Unlike one of present embodiment and embodiment one to five：The step 8 In the obtained relation consistent matrix of the new matrix B 1 ' that is obtained to step 4 and B2 ' and step 6 hand over and grasp into row matrix Make, obtain dependence matrix；Detailed process is：
If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which not examines Consider；
If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is not Become；
0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1.
Matrix B 1 ', B2 ' and C1 ' are handed over into row matrix and operated, obtains dependence matrix；Output
Other steps and parameter are identical with one of embodiment one to five.
Embodiment seven：Unlike one of present embodiment and embodiment one to six：The step 9 In to α correct relation matrix and fault relationships matrix into row matrix reducing, new matrix B 1 ' and B2 ' are obtained, according to B1 ' And B2 ' determines to have in correct test case several places and error checking use-case different；Detailed process is：
Matrix reducing is the core of matrix manipulation.The present invention utilizes subtracting in set theory according to the thought of yojan Computing, subtracts fault relationships matrix by correct relation matrix, obtains new matrix；
Under the operation, if the value of two matrix respective items is identical, output -1；If the value phase of two matrix respective items Instead, then the value in correct relation matrix is exported.In the present invention, the calculating symbol of matrix reducing is '-'.Process is：
Correct relation matrix A 1 is subtracted into fault relationships matrix B 1, new matrix B 1 ' is obtained, correct relation matrix A 2 is subtracted Fault relationships matrix B 2 is gone, obtains new matrix B 2 '；As：
Wherein, in B1 ' matrixes, the value that the row of the second rows of B1 ' the 3rd and the second rows of B1 ' the 4th arrange is 1, remaining is -1, It is different with error checking use-case at two to illustrate that correct test case only has；
In B2 ' matrixes, the value that the row of B2 ' the first rows the 3rd, the row of B2 ' the first rows the 4th and the second rows of B2 ' the 4th arrange is 1, Remaining is -1, and it is different with error checking use-case at three to illustrate that correct test case only has.
Other steps and parameter are identical with one of embodiment one to six.
Embodiment eight：Unlike one of present embodiment and embodiment one to seven：The step 10 In matrix supplement operations are carried out to β-α correct relation matrixes；Obtain supplementary set relational matrix；Detailed process is：
When fault relationships matrix number β is more than correct relation matrix number α, it should to β-α fault relationships matrixes into Row matrix supplement operates；In the present invention, the matrix E for 1 being all using upper triangle subtracts-α fault relationships matrixes of β, obtains mistake The supplementary set of relational matrix, i.e. supplementary set relational matrix by mistake；
Process is：
Under the operation, 1 in fault relationships matrix, which is changed into 0,0, is changed into 1；
That is,
E-B1=b1, is
E-B2=b2, is
Other steps and parameter are identical with one of embodiment one to seven.
Embodiment nine：Unlike one of present embodiment and embodiment one to eight：The step 10 Friendship operation is carried out to supplementary set relational matrix b1 and b2 in one, obtains new supplementary set relational matrix；Detailed process is：
Supplementary set relational matrix hands over operation
When fault relationships matrix number β is more than correct relation matrix number α, it should to β-α supplementary set relational matrix into Row matrix hands over operation, obtains new supplementary set relational matrix；
The operation is used tricks operator number ' ∩ ' to represent.
If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is not Become；
After i.e. 0 and 1,1 and 0 does friendship operation, export as -1；After 1 and 1 matrix does friendship operation, export as 1；0 and 0 is friendship behaviour After work, export as 0.
Process is：
Using b1 and b2 matrixes, b1 ' is obtained；Wherein, it is all mutually 1, difference takes 0, is：
A new supplementary set relational matrix is obtained, new supplementary set relational matrix replaces-α supplementary set relational matrix of β.
Other steps and parameter are identical with one of embodiment one to eight.
Embodiment ten：Unlike one of present embodiment and embodiment one to nine：The step 10 The new supplementary set relational matrix b1 ' that the new matrix B 1 ' and B2 ' and step 11 obtained in two to step 9 obtains carries out square Battle array hands over operation, obtains dependence matrix；Perform step 13；Detailed process is：
If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which not examines Consider；
If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is not Become；
0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1.
That is, matrix B 1 ', B2 ' and b1 ' are handed over into row matrix and operated, obtain dependence matrix；Output
Other steps and parameter are identical with one of embodiment one to nine.
It is described to verify beneficial effects of the present invention using following embodiments：
Embodiment one：
A kind of method that process task block dependence is obtained based on matrix of the present embodiment is specifically according to following steps system Standby：
The present embodiment is the correct test case of known portions and error checking use-case, and according to above-mentioned implementation steps, verification is It is no to obtain prediction result, specifically prepared according to following steps：
1. initial information：
Assuming that now with three task C (C0, C1, C2), D (D0, D1, D2), E (E0, E1, E2), it is necessary to concurrently perform.This The concurrent execution sequence of a little task blocks can impact final result.These three concurrently perform the priority that task is hidden and perform pass System is C1>>D1>>E0>>D2.It is as follows now to give test case：
A：C0,D0,C1,C2,D1,E0,E1,D2,E2 Yes
B：D0,C0,C1,D1,C2,E0,E1,E2,D2 Yes
C：C0,C1,D0,C2,D1,E0,E1,D2,E2 Yes
D：C0,C1,D0,D1,E0,E1,D2,E2,C2 Yes
E：C0,C1,C2,D0,D1,E0,D2,E1,E2 Yes
F：C0,C1,C2,D0,D1,D2,E0,E1,E2 No
G：D0,D1,C0,C1,E0,E1,D2,E2,C2 No
H：C0,D0,C1,E0,E1,D1,C2,D2,E2 No
2. verification step
First, these test cases are built with corresponding matrix, matrix row and column all in accordance with (C0, C1, C2, D0, D1, D2, E0, E1, E2) arrangement, matrix A, B, C, D, E, F, G, H can be built.It is as follows respectively：
Wherein, correct relation matrix has five matrixes of ABCDE；Fault relationships matrix has tri- matrixes of FGH.As can be seen that 5 More than 3.So using three correct relation matrixes and three fault relationships matrixes into row matrix reducing, and two just True relational matrix is handed over into row matrix to be operated, and is finally handed over operation to carry out normalization using matrix in all obtained matrixes, is obtained Last matrix and output.The matrix that Concurrency is output is made, then its mathematic(al) representation is
Concurrency=(A-F) ∩ (B-G) ∩ (C-H) ∩ D ∩ E
Wherein, '-' homography reducing, " homography friendship operation.
Therefore A-F can obtain matrix A ', its value is
Therefore B-G can obtain matrix B ', its value is
Therefore C-H can obtain Matrix C ', its value is
Then Matrix C oncurrency ' is tried to achieve using matrix and operation to these three matrixes, its value is
Then two correct relation matrix Ds and E are handed over into row matrix and operated, try to achieve D ', its value is
Finally again to Matrix C oncurrency ' and matrix D ' operated into row matrix friendship, Concurrency " is obtained, its value For
Therefore precedence relationship R can be parsed according to the matrix：C0>>D1, C1>>D1, D1>>E0, D1>>E1, D2<<E0 again by In having fixed task block execution sequence, i.e. C0 in same task>>C1>>C2, D0>>D1>>D2, E0>>E1>>E2.
Therefore according to mathematical theorem, R ' can be expanded to precedence relationship R：C0>>C1>>D1>>E0>>E1>>D2 either C0>> C1>>D1>>E0>>D2>>E1.The task block precedence relationship in same task need not be exported due to the present invention again, therefore can be reduced to： C1>>D1>>E0>>D2。
Comply fully with, therefore verify correct from the foregoing, it will be observed that the precedence relationship sets hiding relation with topic.
The present invention can also have other various embodiments, in the case of without departing substantially from spirit of the invention and its essence, this area Technical staff makes various corresponding changes and deformation in accordance with the present invention, but these corresponding changes and deformation should all belong to The protection domain of appended claims of the invention.

Claims (10)

  1. A kind of 1. method that process task block dependence is obtained based on matrix, it is characterised in that：The method detailed process is：
    Step 1: input is correct and error checking use-case, test case include all process task blocks；
    Step 2: convert test cases to relational matrix；
    Relational matrix includes correct relation matrix, fault relationships matrix, relation consistent matrix and dependence matrix；
    In relational matrix, 1 represents prior to performing, and 0 representative is not considered after execution, -1；
    Correct relation matrix：By the matrix of correct test case sequence construct；
    Fault relationships matrix：By the matrix of the test case sequence construct of mistake；
    Relation consistent matrix：The subtask block of different task does not have the matrix of precedence relationship；
    Dependence matrix：There is definite dependence between the subtask block of different task；
    Step 3: as α >=β, step 4 is performed；As α ＜ β, step 9 is performed；α is correct test case number, and β is mistake Test case number by mistake；
    Step 4: to β correct relation matrix and fault relationships matrix into row matrix reducing, obtain new matrix B 1 ' and B2 ', according to B1 ' and B2 ' determines to have in correct test case several places and error checking use-case different；Perform step 5；
    Step 5: as α ＞ β, step 6 is performed；As α=β, step 7 is performed；
    Operated Step 6: being handed over into row matrix alpha-beta correct relation matrix, obtain relation consistent matrix；Perform step 8；
    Step 7: the new matrix B 1 ' and B2 ' that are obtained to step 4 are handed over into row matrix and operated, dependence matrix is obtained；Perform 13；
    Step 8: the relation consistent matrix that the new matrix B 1 ' and B2 ' and step 6 that are obtained to step 4 obtain carries out Matrix hands over operation, obtains dependence matrix；Perform step 13；
    Step 9: to α correct relation matrix and fault relationships matrix into row matrix reducing, obtain new matrix B 1 ' and B2 ', according to B1 ' and B2 ' determines to have in correct test case several places and error checking use-case different；Perform step 10；
    Step 10: carrying out matrix supplement operation to-α correct relation matrixes of β, supplementary set relational matrix b1 and b2 are obtained；Perform step Rapid 11；
    Step 11: carrying out friendship operation to supplementary set relational matrix b1 and b2, new supplementary set relational matrix b1 ' is obtained；
    Step 12: the new supplementary set relational matrix that the new matrix B 1 ' and B2 ' and step 11 that are obtained to step 9 obtain B1 ' is handed over into row matrix and operated, and obtains dependence matrix；Perform step 13；
    Step 13: according to the dependence matrix of acquisition, obtain dependence and export.
  2. A kind of 2. method that process task block dependence is obtained based on matrix according to claim 1, it is characterised in that：Institute State and relational matrix is converted test cases in step 2；Detailed process is：
    Relational matrix includes correct relation matrix, fault relationships matrix, relation consistent matrix and dependence matrix；
    A1 task blocks have A, B subtasks block；A2 task blocks have C, D subtasks block；
    Wherein correct test case has A, B, C, D；A, C, B, D, the test case of mistake have ACDB, CDAB；
    Correct relation matrix A 1, A2 is built according to correct test case；
    According to the test case of mistake structure fault relationships matrix B 1, B2；
    Drawn at the same time according to two correct test cases：There is no precedence relationship between two task blocks of C and B, structure relation is compatible Matrix C 1；
    According to A1, A2, C1 matrixes show that the B in a1 tasks must be before the D in a2 tasks, therefore build dependence matrix D1；
    It is as follows respectively：
    <mrow> <mi>A</mi> <mn>1</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow></mrow> </mtd> <mtd> <mi>A</mi> </mtd> <mtd> <mi>B</mi> </mtd> <mtd> <mi>C</mi> </mtd> <mtd> <mi>D</mi> </mtd> </mtr> <mtr> <mtd> <mi>A</mi> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mi>B</mi> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mi>C</mi> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mi>D</mi> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> <mi>A</mi> <mn>2</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow>
    <mrow> <mi>B</mi> <mn>1</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> <mi>B</mi> <mn>2</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow>
    <mrow> <mi>C</mi> <mn>1</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> <mi>D</mi> <mn>1</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
  3. A kind of 3. method that process task block dependence is obtained based on matrix according to claim 2, it is characterised in that：Institute State in step 4 to β correct relation matrix and fault relationships matrix into row matrix reducing, obtain new matrix B 1 ' and B2 ', According to B1 ' and B2 ' determine to have in correct test case several places and error checking use-case different；Detailed process is：
    Correct relation matrix is subtracted into fault relationships matrix, obtains new matrix；
    If the value of two matrix respective items is identical, output -1；If two matrix respective items value on the contrary, if export correct relation Value in matrix；
    That is,
    Correct relation matrix A 1 is subtracted into fault relationships matrix B 1, obtains new matrix B 1 ', correct relation matrix A 2 is subtracted into mistake Relational matrix B2 by mistake, obtains new matrix B 2 '；As：
    <mrow> <mi>B</mi> <msup> <mn>1</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> <mi>B</mi> <msup> <mn>2</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow>
    Wherein, in B1 ' matrixes, the value that the row of the second rows of B1 ' the 3rd and the second rows of B1 ' the 4th arrange is 1, remaining is -1, explanation Correct test case only has different with error checking use-case at two；
    In B2 ' matrixes, the value that the row of B2 ' the first rows the 3rd, the row of B2 ' the first rows the 4th and the second rows of B2 ' the 4th arrange is 1, remaining For -1, it is different with error checking use-case at three to illustrate that correct test case only has.
  4. A kind of 4. method that process task block dependence is obtained based on matrix according to claim 3, it is characterised in that：Institute State to hand over alpha-beta correct relation matrix into row matrix in step 6 and operate, obtain relation consistent matrix；Detailed process is：
    If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is constant；
    After i.e. 0 and 1,1 and 0 does friendship operation, export as -1；After 1 and 1 matrix does friendship operation, export as 1；After 0 and 0 does friendship operation, Export as 0；
    I.e.：
    Using A1 and A2 matrixes, C1 is obtained；Wherein, it is all mutually 1, difference takes -1, is：
    <mrow> <mi>C</mi> <msup> <mn>1</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Obtain in two correct matrixes only have one differ, and by its value output be -1.
  5. A kind of 5. method that process task block dependence is obtained based on matrix according to claim 4, it is characterised in that：Institute State the new matrix B 1 ' obtained in step 7 to step 4 and B2 ' and hand over operation into row matrix, obtain dependence matrix；Perform 13；Detailed process is：
    If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which does not consider；
    If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is constant；
    0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1；
    That is,
    To matrix B 1 ' and B2 ' operated into row matrix friendship, obtain dependence matrix；Output
    <mrow> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
  6. A kind of 6. method that process task block dependence is obtained based on matrix according to claim 5, it is characterised in that：Institute State the new matrix B 1 ' obtained in step 8 to step 4 and B2 ' and a relation consistent matrix that step 6 obtains carries out Matrix hands over operation, obtains dependence matrix；Perform step 13；Detailed process is：
    If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which does not consider；
    If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is constant；
    0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1；
    That is,
    Matrix B 1 ', B2 ' and C1 ' are handed over into row matrix and operated, obtains dependence matrix；Output
    <mrow> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
  7. A kind of 7. method that process task block dependence is obtained based on matrix according to claim 6, it is characterised in that：Institute State in step 9 to α correct relation matrix and fault relationships matrix into row matrix reducing, are obtained new matrix B 1 ' and B2 ', according to B1 ' and B2 ' determines to have in correct test case several places and error checking use-case different；Perform step 10；Specifically Process is：
    Correct relation matrix is subtracted into fault relationships matrix, obtains new matrix；
    If the value of two matrix respective items is identical, output -1；If two matrix respective items value on the contrary, if export correct relation Value in matrix；Process is：
    Correct relation matrix A 1 is subtracted into fault relationships matrix B 1, obtains new matrix B 1 ', correct relation matrix A 2 is subtracted into mistake Relational matrix B2 by mistake, obtains new matrix B 2 '；As：
    <mrow> <mi>B</mi> <msup> <mn>1</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> <mi>B</mi> <msup> <mn>2</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow>
    Wherein, in B1 ' matrixes, the value that the row of the second rows of B1 ' the 3rd and the second rows of B1 ' the 4th arrange is 1, remaining is -1, explanation Correct test case only has different with error checking use-case at two；
    In B2 ' matrixes, the value that the row of B2 ' the first rows the 3rd, the row of B2 ' the first rows the 4th and the second rows of B2 ' the 4th arrange is 1, remaining For -1, it is different with error checking use-case at three to illustrate that correct test case only has.
  8. A kind of 8. method that process task block dependence is obtained based on matrix according to claim 7, it is characterised in that：Institute State in step 10 and matrix supplement operation is carried out to-α correct relation matrixes of β；Obtain supplementary set relational matrix b1 and b2；Perform step 11；Detailed process is：
    The matrix E that 1 is all using upper triangle subtracts-α fault relationships matrixes of β, obtains the supplementary set of fault relationships matrix, i.e. supplementary set Relational matrix；
    I.e.
    1 in fault relationships matrix, which is changed into 0,0, is changed into 1；
    E-B1=b1, is
    <mrow> <mi>b</mi> <mn>1</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    E-B2=b2, is
    <mrow> <mi>b</mi> <mn>2</mn> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
  9. A kind of 9. method that process task block dependence is obtained based on matrix according to claim 8, it is characterised in that：Institute State in step 11 and friendship operation is carried out to supplementary set relational matrix b1 and b2, obtain new supplementary set relational matrix b1 '；Detailed process For：
    If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is constant；
    After i.e. 0 and 1,1 and 0 does friendship operation, export as -1；After 1 and 1 matrix does friendship operation, export as 1；After 0 and 0 does friendship operation, Export as 0；
    Process is：
    Using b1 and b2 matrixes, b1 ' is obtained；Wherein, it is all mutually 1, difference takes 0, is：
    <mrow> <mi>b</mi> <msup> <mn>1</mn> <mo>,</mo> </msup> <mo>=</mo> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    A new supplementary set relational matrix is obtained, new supplementary set relational matrix replaces-α supplementary set relational matrix of β.
  10. A kind of 10. method that process task block dependence is obtained based on matrix according to claim 9, it is characterised in that： The new supplementary set relation square that the new matrix B 1 ' and B2 ' and step 11 obtained in the step 12 to step 9 obtains Battle array b1 ' is handed over into row matrix and operated, and obtains dependence matrix；Perform step 13；Detailed process is：
    If it is still -1 to have -1, -1 to intersect with any value in any of two matrixes matrix, which does not consider；
    If the value of two matrix respective items is different, output -1；If the value of two matrix respective items is identical, output valve is constant；
    0 with 1 intersect be also -1, which does not consider；0 intersect with 0 after be still 0,1 intersect with 1 after be also 1；
    That is,
    Matrix B 1 ', B2 ' and b1 ' are handed over into row matrix and operated, obtains dependence matrix；Output
    <mrow> <mfenced open = "(" close = ")"> <mtable> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> <mtd> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
CN201711216919.4A 2017-11-28 2017-11-28 Method for acquiring process task block dependency relationship based on matrix Active CN107977314B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711216919.4A CN107977314B (en) 2017-11-28 2017-11-28 Method for acquiring process task block dependency relationship based on matrix

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711216919.4A CN107977314B (en) 2017-11-28 2017-11-28 Method for acquiring process task block dependency relationship based on matrix

Publications (2)

Publication Number Publication Date
CN107977314A true CN107977314A (en) 2018-05-01
CN107977314B CN107977314B (en) 2021-05-04

Family

ID=62012121

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711216919.4A Active CN107977314B (en) 2017-11-28 2017-11-28 Method for acquiring process task block dependency relationship based on matrix

Country Status (1)

Country Link
CN (1) CN107977314B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112783757A (en) * 2019-11-11 2021-05-11 北京沃东天骏信息技术有限公司 Test system, test method, computer system, and computer-readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100100874A1 (en) * 2008-10-22 2010-04-22 Ajikumar Thaitharanikarthu Narayanan Complexity dependency change impact system and method
CN103226513A (en) * 2013-04-25 2013-07-31 中国人民解放军信息工程大学 Dependence measuring method for nonlinear subscript expression based on quadratic programming model
CN103473100A (en) * 2013-09-17 2013-12-25 中国科学院软件研究所 Dependence-relationship-based Web service replacing method
CN105022661A (en) * 2015-08-06 2015-11-04 四川大学 Multiprocessor system schedulability verification method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100100874A1 (en) * 2008-10-22 2010-04-22 Ajikumar Thaitharanikarthu Narayanan Complexity dependency change impact system and method
CN103226513A (en) * 2013-04-25 2013-07-31 中国人民解放军信息工程大学 Dependence measuring method for nonlinear subscript expression based on quadratic programming model
CN103473100A (en) * 2013-09-17 2013-12-25 中国科学院软件研究所 Dependence-relationship-based Web service replacing method
CN105022661A (en) * 2015-08-06 2015-11-04 四川大学 Multiprocessor system schedulability verification method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
马良荔、刘杰生、李娟: "构造基于构建依赖关系矩阵的元数据模型", 《计算机科学》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112783757A (en) * 2019-11-11 2021-05-11 北京沃东天骏信息技术有限公司 Test system, test method, computer system, and computer-readable storage medium
CN112783757B (en) * 2019-11-11 2024-03-01 北京沃东天骏信息技术有限公司 Test system, method, computer system, and computer-readable storage medium

Also Published As

Publication number Publication date
CN107977314B (en) 2021-05-04

Similar Documents

Publication Publication Date Title
Cortese et al. Loading classical data into a quantum computer
Chamberland et al. Deep neural decoders for near term fault-tolerant experiments
US20220415452A1 (en) Method and apparatus for determining drug molecule property, and storage medium
Phien et al. Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment
CN108416436A (en) The method and its system of neural network division are carried out using multi-core processing module
CN104750945B (en) A kind of quantum circuit emulation platform
CN110516810B (en) Quantum program processing method and device, storage medium and electronic device
WO2022001141A1 (en) Gpu communication method and device, and medium
CN114764549B (en) Quantum circuit simulation calculation method and device based on matrix product state
CN111915011B (en) Single-amplitude quantum computing simulation method
CN107798385A (en) Recognition with Recurrent Neural Network partially connected method based on block tensor resolution
CN103971328A (en) Storage, design and implementation method for multi-dimensional quantum gray image and multi-dimensional quantum colorful image
CN105190632B (en) Construct the Polynomial Method of uncertainty (NP) Turing machine
CN105913063A (en) Sparse expression acceleration method for image data set and device
CN109063264A (en) A kind of phased mission systems Reliability modeling and analysis method
CN107977314A (en) A kind of method that process task block dependence is obtained based on matrix
Zheng et al. Design of a quantum convolutional neural network on quantum circuits
CN103631714A (en) Method for generating minimum combination testing cases based on matrix multiplicity
CN105893332B (en) A kind of computational methods suitable for assembled state spatial model transfer rate matrix
CN116128019A (en) Parallel training method and device for transducer model
Huang et al. Braids and periodic solutions
Li et al. Memory saving method for enhanced convolution of deep neural network
Li et al. Reducing consistency checks in generating corrective explanations for interactive constraint satisfaction
CN113836174A (en) Asynchronous SQL connection query optimization method based on reinforcement learning DQN algorithm
Garcia et al. GPU-accelerated Poincaré map method for harmonic-oriented analyses of power systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20210415

Address after: 150001 No. 434, postal street, Nangang District, Heilongjiang, Harbin

Applicant after: Harbin University of technology Yitong Intelligent Robot Technology Co.,Ltd.

Address before: 130 Flourishing Street, Nangang District, Harbin City, Heilongjiang Province

Applicant before: Qu Mingcheng

GR01 Patent grant
GR01 Patent grant
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: Room 735-6, Building 9, No. 1616, Chuangxin Road, Harbin, Heilongjiang, 150000

Patentee after: Harbin Zhongluozhi Technology Co.,Ltd.

Address before: 150001 No. 434, postal street, Nangang District, Heilongjiang, Harbin

Patentee before: Harbin University of technology Yitong Intelligent Robot Technology Co.,Ltd.

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230915

Address after: Room 735-5, Building 9, No. 1616 Chuangxin Road, Songbei District, Harbin City, Heilongjiang Province, 150000

Patentee after: Heilongjiang Yitong Intelligent Education Technology Co.,Ltd.

Address before: Room 735-6, Building 9, No. 1616, Chuangxin Road, Harbin, Heilongjiang, 150000

Patentee before: Harbin Zhongluozhi Technology Co.,Ltd.