CN1680936A - Lawful testing method of cocurrent unit of flow chart - Google Patents
Lawful testing method of cocurrent unit of flow chart Download PDFInfo
- Publication number
- CN1680936A CN1680936A CN 200410021269 CN200410021269A CN1680936A CN 1680936 A CN1680936 A CN 1680936A CN 200410021269 CN200410021269 CN 200410021269 CN 200410021269 A CN200410021269 A CN 200410021269A CN 1680936 A CN1680936 A CN 1680936A
- Authority
- CN
- China
- Prior art keywords
- node
- concurrent
- traversal
- next adjacent
- reverse
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000012360 testing method Methods 0.000 title 1
- 238000000034 method Methods 0.000 claims abstract description 61
- 238000010586 diagram Methods 0.000 claims description 24
- 238000010845 search algorithm Methods 0.000 abstract 1
- 238000012795 verification Methods 0.000 description 10
- 238000007689 inspection Methods 0.000 description 3
- 238000013507 mapping Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A method for calibrating legality of work flow flowchart concurrent unit utilizes advanced search algorithm of chart to calibrate illegal exit, and illegal entry of concurrent unit as well as jump - over between concurrent branches through flexible combination. The method uses forward adjacent table to calibrate illegal exit and uses backward adjacent table to calibrate illegal entry as well as uses two tables to calibrate jump - over between concurrent branches separately.
Description
Technical field
The invention belongs to the Workflow system technology, the legitimacy method of inspection of the concurrent unit of specifically a kind of work process flow figure.
Technical background
In the graphic process defining tool of Workflow system, defined process flow diagram must be legal, and illegal works stream engine can't be explained, thereby also with regard to the operation of uncontrollable flow instance, unpredictable mistake can occur in the circulation process.Flow instance can not just can not be realized user's intended target according to user's expection operation.People can make all restrictions and guarantee its correctness when drawing process flow diagram, but it is impossible sometimes making such restriction, and it is random being figure usually, and the legitimacy of process flow diagram just can not guarantee like this.Prior art is often come the correctness of inspection process by dry run, but the simulation need expend plenty of time and resource, and exhaustive all possible ruuning situation be very the difficulty, so need carry out verification to the legitimacy of process flow diagram.
The legitimacy verification of concurrent unit is the important ring in the legitimacy verification of process flow diagram.The verification of concurrent unit mainly contains two aspects: the one, and the closure of concurrent unit, promptly can only there be outlet of an inlet a concurrent unit; The one, the alternative between each concurrent branch promptly can not enter another concurrent branch by a concurrent branch.Check the legitimacy of concurrent unit must be able to check out redirect between illegal outlet, illegal entry and each concurrent branch of concurrent unit.Legitimacy verification to concurrent unit has been arranged, guaranteed the correctness of concurrent unit in the process flow diagram, could guarantee the expectation true(-)running of flow instance according to the user.Yet the legitimacy verification to concurrent unit does not at present also appear in the newspapers.
Summary of the invention
The purpose of this invention is to provide a kind of correctness that can guarantee concurrent unit in the process flow diagram, flow instance the legitimacy method of inspection according to the concurrent unit of work process flow figure of user's expectation true(-)running.
To achieve these goals, technical solution of the present invention is as follows:
By make up flexibly utilization figure the dark searching algorithm of elder generation check redirect between illegal outlet, illegal entry and each concurrent branch of concurrent unit; Be specially: its data structure adopts forward, reverse two adjacency lists; Wherein: when the illegal outlet of check, use the forward adjacency list, when the check illegal entry, use reverse adjacency list, when the redirect of checking between concurrent branch, use two adjacency lists respectively, use the forward adjacency list during forward lookup, use reverse adjacency list during reverse search.
When illegal outlet of check and illegal entry, each node needs corresponding Search Flags, when the redirect of checking between concurrent branch, each node needs corresponding two Search Flags, and use forward sign is represented forward lookup and used reverse sign to represent reverse search.
The algorithm of the illegal outlet of check is: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carry out the dark search of elder generation from concurrent start node, to corresponding concurrent end node, when before arriving concurrent end node, just having arrived leaf node (not going out the limit) or having got back to concurrent start node, show that there is illegal outlet in concurrent unit; Be specially: 1) whole process flow diagram is created an adjacency list; 2) each concurrent start node V carries out following steps in the adjacency list:
A) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
B) by concurrent start node V set out call the traversal subalgorithm travel through.
Described traversal subalgorithm is: at first the traversal sign f of traversal start node V0 is made as 1; Judge then whether traversal start node V0 also has next adjacent node; If any next adjacent node, if the next adjacent node of traversal start node V0 is V2, again described next adjacent node V2 is made the following judgment:, continue to judge whether traversal start node V0 also has next adjacent node 1) if the next adjacent node V2 of traversal start node V0 is the concurrent end node V1 of concurrent start node V correspondence; 2), continue to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1; 3) if the next adjacent node V2 of traversal start node V0 is concurrent start node V, there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node; 4) if the next adjacent node V2 of traversal start node V0 is leaf node (not going out the limit), there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node; 5) other situation recursive call traversal subalgorithm is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
The algorithm of check illegal entry is: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carrying out reverse elder generation from concurrent end node searches for deeply, to arriving corresponding concurrent start node, if before arriving concurrent start node, just arrived root node (not going into the limit) or got back to concurrent end node, shown that then there is illegal entry in concurrent unit; Specific algorithm is: at first whole process flow diagram is created a reverse adjacency list; Then each concurrent end node V in the adjacency list is carried out following steps:
1) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
2) set out by concurrent end node V and call reverse traversal subalgorithm and travel through.
Described reverse traversal subalgorithm is: at first the traversal sign f of traversal start node V0 is made as 1; Judge again whether traversal start node V0 also has next adjacent node; If any words, if the next adjacent node of traversal start node V0 is V2, described next adjacent node V2 is made the following judgment:, continue then to judge whether traversal start node V0 also has next adjacent node 1) if the next adjacent node V2 of traversal start node V0 is the concurrent start node V1 of concurrent end node V correspondence; 2), continue then to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1; 3) if the next adjacent node V2 of traversal start node V0 is concurrent end node V, there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node; 4) if the next adjacent node V2 of traversal start node V0 is root node (not going into the limit), there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node; 5) other situation reverse traversal subalgorithm of recursive call is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
Check the algorithm of redirect between concurrent branch to be: to travel through from concurrent start node, when running into the node that a plurality of inlets are arranged, oppositely travel through from this node,, have redirect between then concurrent branch if can just can get back to concurrent start node without the node of the traversal of forward; Its algorithm: 1) whole process flow diagram is created a forward adjacency list, a reverse adjacency list; 2) each concurrent start node V in the adjacency list is carried out following steps:
1) forward of each node correspondence in adjacency list traversal sign f is made as 0;
2) set out by concurrent start node V and call forward traversal subalgorithm and travel through.
Described forward traversal subalgorithm is: at first forward traversal sign f, the reverse traversal sign f1 of traversal start node V0 are made as 1; Judge then whether traversal start node V0 also has next adjacent node, if any words, if the next adjacent node of traversal start node V0 is V2, to described next adjacent node V2 execution in step be again: 1) if next adjacent node V2 and concurrent start node V direct neighbor are made as 0 to the reverse traversal sign f1 of each node correspondence in the adjacency list; 2) if the reverse traversal sign f1 of next adjacent node V2 is 0, and next adjacent node V2 is not concurrent start node V, concurrent end node V1 that neither concurrent start node V correspondence, and next adjacent node V2 goes into the limit number greater than 1, is set out by next adjacent node V2 and calls reverse traversal subalgorithm and carry out reverse traversal; 3) next adjacent node V2 is made the following judgment:, then whether also have next adjacent node V2 to continue to carry out and judge traversal start node V0 if the next adjacent node V2 of a. is concurrent start node V; If b. next adjacent node V2 is the concurrent end node V1 of concurrent start node V correspondence, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; If the forward of c. next adjacent node V2 traversal sign f is 1, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; If d. next adjacent node V2 is leaf node (not going out the limit), then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; E. other situation (not being four kinds of a～d) recursive call forward traversal subalgorithm is then set out by next adjacent node V2 and to be proceeded traversal.
Described reverse traversal subalgorithm is: the reverse traversal sign f1 that at first will travel through start node V0 is made as 1; Judge again whether traversal start node V0 also has next adjacent node, if any words, if the next adjacent node of traversal start node V0 is V3, again the reverse adjacent node V3 of this next one is judged:, then continue to judge next reverse adjacent node 1) if reverse adjacent node V3 is the concurrent end node V1 of concurrent start node V correspondence; 2), then continue to judge next reverse adjacent node if reverse adjacent node V3 is root node (not going into the limit); 3) if the reverse traversal sign f1 of reverse adjacent node V3 is 1, then continue to judge next reverse adjacent node; 4) if reverse adjacent node V3 is concurrent start node V, there is redirect between then concurrent branch, prints traverse path, continue to judge next reverse adjacent node again; 5) other situation reverse traversal subalgorithm of recursive call is then set out by reverse adjacent node V3 and to be proceeded reverse traversal.
The present invention has following advantage:
1. the present invention can check out the redirect between illegal outlet, illegal entry and each concurrent branch of concurrent unit by the dark searching algorithm of the elder generation that makes up utilization figure flexibly, realized legitimacy verification to concurrent unit, thereby guaranteed the correctness of concurrent unit in the process flow diagram, made the flow instance can be according to user's expectation true(-)running.
2. the present invention has guaranteed the true(-)running of flow instance to a great extent by when defining process flow diagram being carried out verification, has reduced the possibility of makeing mistakes.
3. the present invention carries out verification by after finishing at process flow diagram to its legitimacy, has removed from when mapping and has made all restrictions, makes the user more flexible when mapping, and is convenient to revise.
4. the present invention is by the verification to process flow diagram in when definition, removed to the correctness that guarantees flow process and carried out dry run, for the user has saved resource.
5. the inventive method is simple, and is reliable.
Description of drawings
Fig. 1 checks the process flow diagram of the forward traversal subalgorithm of illegal outlet for the present invention.
Fig. 2 checks the reverse traversal subalgorithm process flow diagram of illegal entry for the present invention.
Fig. 3 checks the forward traversal subalgorithm process flow diagram of redirect between branch for the present invention.
Fig. 4 checks the reverse traversal subalgorithm process flow diagram of redirect between branch for the present invention.
Fig. 5 has the concurrent unit example of illegal outlet for the present invention.
Fig. 6 has the concurrent unit example of illegal entry for the present invention.
Fig. 7 is for existing the concurrent unit example of redirect between branch of the present invention.
Embodiment
Below in conjunction with drawings and Examples the present invention is described in further detail.
Data structure of the present invention adopts adjacency list.Need two adjacency lists, the adjacency list of a forward, a reverse adjacency list.When checking illegal outlet, use the forward adjacency list, when the check illegal entry, use reverse adjacency list, when the redirect of checking between concurrent branch, use two adjacency lists respectively.When illegal outlet of check and illegal entry, each node needs corresponding Search Flags, when the redirect of checking between concurrent branch, each node needs corresponding two Search Flags, represents forward lookup (using the forward adjacency list) and reverse search (using reverse adjacency list) respectively.
The algorithm of the illegal outlet of check: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carry out the dark search of elder generation from concurrent start node like this, necessarily can arrive corresponding concurrent end node, if before arriving concurrent end node, just arrived leaf node (not going out the limit) or got back to concurrent start node, just show that there is illegal outlet in concurrent unit.
Algorithm steps is as follows:
1. whole process flow diagram is created an adjacency list.
2. each concurrent start node V in the adjacency list is carried out following steps:
1) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
2) by concurrent start node V set out call the traversal subalgorithm travel through.
Wherein: as shown in Figure 1, described traversal subalgorithm is described below:
1. the traversal sign f of traversal start node V0 is made as 1;
2. judge whether traversal start node V0 also has next adjacent node; If any next adjacent node, the next adjacent node of establishing traversal start node V0 is V2, then this next one adjacent node V2 is made the following judgment:
1), continues to judge whether traversal start node V0 also has next adjacent node if the next adjacent node V2 of traversal start node V0 is the concurrent end node V1 of concurrent start node V correspondence;
2), continue to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1;
3) if the next adjacent node V2 of traversal start node V0 is concurrent start node V, there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node;
4) if the next adjacent node V2 of traversal start node V0 is leaf node (not going out the limit), there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node;
5) other situation when four kinds of situations (be not above-mentioned) recursive call traversal subalgorithm is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
The algorithm of check illegal entry: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carrying out reverse elder generation from concurrent end node like this searches for deeply, necessarily can arrive corresponding concurrent start node, if before arriving concurrent start node, just arrived root node (not going into the limit) or got back to concurrent end node, just shown that there is illegal entry in concurrent unit.
Algorithm steps is as follows:
1. whole process flow diagram is created a reverse adjacency list;
2. each concurrent end node V in the adjacency list is carried out following steps:
1) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
2) set out by concurrent end node V and call reverse traversal subalgorithm and travel through.
Wherein said reverse traversal subalgorithm is described below (referring to Fig. 2):
1. the traversal sign f of traversal start node V0 is made as 1.
2. judge whether traversal start node V0 also has next adjacent node, if any, the next adjacent node of establishing traversal start node V0 is V2, this next one adjacent node V2 is made the following judgment again:
1), continues then to judge whether traversal start node V0 also has next adjacent node if the next adjacent node V2 of traversal start node V0 is the concurrent start node V1 of concurrent end node V correspondence.
2), continue then to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1.
3) if the next adjacent node V2 of traversal start node V0 is concurrent end node V, there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node.
4) if the next adjacent node V2 of traversal start node V0 is root node (not going into the limit), there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node.
5) other situation (not being above-mentioned four kinds of situations) reverse traversal subalgorithm of recursive call is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
Check the algorithm of redirect between concurrent branch: owing to should not have redirect between each concurrent branch, so can not there be two disjoint paths in the arbitrary node in from concurrent start node to concurrent unit; The present invention travels through from concurrent start node, runs into the node that a plurality of inlets are arranged, and promptly oppositely travels through from this node, if can just can get back to concurrent start node without the node of the traversal of forward, has redirect between then concurrent branch.
Algorithm steps is as follows:
1. whole process flow diagram is created a forward adjacency list, a reverse adjacency list.
2. each concurrent start node V in the adjacency list is carried out following steps:
1) forward of each node correspondence in adjacency list traversal sign f is made as 0;
2) set out by concurrent start node V and call forward traversal subalgorithm and travel through.
As shown in Figure 3, forward traversal subalgorithm is described below:
1. forward traversal sign f, the reverse traversal sign f1 of traversal start node are made as 1.
2. judge whether V0 also has next adjacent node, if any, the next adjacent node of establishing V0 is V2, again this next one adjacent node V2 is carried out following steps:
1) if next adjacent node V2 and concurrent start node V direct neighbor (having a limit from concurrent start node V to next adjacent node V2) are made as 0 to the reverse traversal sign f1 of each node correspondence in the adjacency list;
2) if the reverse traversal sign f1 of next adjacent node V2 is 0, and next adjacent node V2 is not concurrent start node V, concurrent end node V1 that neither concurrent start node V correspondence, and next adjacent node V2 goes into the limit number greater than 1, is set out by next adjacent node V2 and calls reverse traversal subalgorithm and carry out reverse traversal;
3) next adjacent node V2 is made the following judgment:
If a. next adjacent node V2 is concurrent start node V, then whether also has next adjacent node to continue to carry out and judge traversal start node V0;
If b. next adjacent node V2 is the concurrent end node V1 of concurrent start node V correspondence, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0;
If the forward of c. next adjacent node V2 traversal sign f is 1, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0;
If d. next adjacent node V2 is leaf node (not going out the limit), then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0;
E. other situation (not being four kinds of a～d) recursive call forward traversal subalgorithm is then set out by next adjacent node V2 and to be proceeded traversal.
3) next adjacent node V2 is made the following judgment:
As shown in Figure 4, reverse traversal subalgorithm is described below:
1. the reverse traversal sign f1 that will travel through start node V0 is made as 1;
2. judge whether traversal start node V0 also has next adjacent node, if any, the next adjacent node of establishing traversal start node V0 is V3, the more reverse adjacent node V3 of this next one is carried out to judge:
1), then continues to judge next reverse adjacent node if reverse adjacent node V3 is the concurrent end node V1 of concurrent start node V correspondence;
2), then continue to judge next reverse adjacent node if reverse adjacent node V3 is root node (not going into the limit);
3) if the reverse traversal sign f1 of reverse adjacent node V3 is 1, then continue to judge next reverse adjacent node;
4) if reverse adjacent node V3 is concurrent start node V, there is redirect between then concurrent branch, prints traverse path, continue to judge next reverse adjacent node again;
5) other situation (not being 1)～5) content) the reverse traversal subalgorithm of recursive call is then set out by reverse adjacent node V3 and to be proceeded reverse traversal.
Illustrate legitimacy how to use this method to check concurrent unit below.
As shown in Figure 5, concurrent unit that illegal outlet arranged can directly arrive behavior node A3 outside the concurrent unit by the behavior node A2 in the concurrent unit.Adopt the present invention to check the method for the illegal outlet in concurrent unit, set out by concurrent start node V and to travel through, the order of traversal is V, A1, A2, A3, E successively, so just exist one to set out by concurrent start node V, concurrent end node V1 without its correspondence, can arrive the path of leaf node, illustrate that there is illegal outlet in this concurrent unit.
As shown in Figure 6, concurrent unit that illegal entry arranged can directly arrive behavior node A2 in the concurrent unit by the behavior node A3 outside the concurrent unit.Adopt the present invention to check the method for concurrent unit illegal entry, set out by concurrent end node V and to carry out reverse traversal, the order of traversal is V, A1, A2, A3, S successively, so just exist one to set out by concurrent end node V, concurrent start node V1 without its correspondence, can arrive the inverse path of root node, illustrate that there is illegal entry in this concurrent unit.
As shown in Figure 7, exist the concurrent unit of redirect to have two paths that do not overlap fully can arrive behavior node A1 between a branch by concurrent start node.Adopt the present invention to check the method for redirect between concurrent cell branch, set out by concurrent start node V earlier and carry out the forward traversal, the order of traversal is V, A1, when arriving A1, find that it has two inlets, set out by A1 and to carry out reverse traversal, the order of traversal is A1, A2, V, like this from concurrent start node V, there are two paths that do not overlap fully to arrive behavior node A1, illustrate between this concurrent cell branch to have redirect.
Claims (10)
1. the legitimacy method of calibration of the concurrent unit of work process flow figure is characterized in that: by make up flexibly utilization figure the dark searching algorithm of elder generation check redirect between illegal outlet, illegal entry and each concurrent branch of concurrent unit; Be specially: its data structure adopts forward, reverse two adjacency lists.
2. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 1, it is characterized in that: when the illegal outlet of check, use the forward adjacency list, when the check illegal entry, use reverse adjacency list, when the redirect of checking between concurrent branch, use two adjacency lists respectively, use the forward adjacency list during forward lookup, use reverse adjacency list during reverse search.
3. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 2, it is characterized in that: when illegal outlet of check and illegal entry, each node needs corresponding Search Flags, when the redirect of checking between concurrent branch, each node needs corresponding two Search Flags, uses forward lookup sign expression forward lookup and uses reverse search sign expression reverse search.
4. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 3, it is characterized in that: the algorithm of the illegal outlet of check is: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carry out the dark search of elder generation from concurrent start node, to corresponding concurrent end node, when before arriving concurrent end node, just having arrived leaf node or having got back to concurrent start node, show that there is illegal outlet in concurrent unit; Be specially: 1) whole process flow diagram is created an adjacency list; 2) each concurrent start node V carries out following steps in the adjacency list:
A) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
B) by concurrent start node V set out call the traversal subalgorithm travel through.
5. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 4, it is characterized in that: described traversal subalgorithm is: at first the traversal sign f of traversal start node V0 is made as 1; Judge then whether traversal start node V0 also has next adjacent node; If any next adjacent node, if the next adjacent node of traversal start node V0 is V2, again described next adjacent node V2 is made the following judgment:, continue to judge whether traversal start node V0 also has next adjacent node 1) if the next adjacent node V2 of traversal start node V0 is the concurrent end node V1 of concurrent start node V correspondence; 2), continue to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1; 3) if the next adjacent node V2 of traversal start node V0 is concurrent start node V, there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node; 4) if the next adjacent node V2 of traversal start node V0 is a leaf node, there is illegal outlet then concurrent unit, prints traverse path, continues to judge whether traversal start node V0 also has next adjacent node; 5) other situation recursive call traversal subalgorithm is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
6. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 3, it is characterized in that: the algorithm of check illegal entry is: a concurrent unit has only outlet of an inlet, concurrent start node is its inlet, concurrent end node is its outlet, carrying out reverse elder generation from concurrent end node searches for deeply, to arriving corresponding concurrent start node, if before arriving concurrent start node, just arrived root node or got back to concurrent end node, shown that then there is illegal entry in concurrent unit; Specific algorithm is: at first whole process flow diagram is created a reverse adjacency list; Then each concurrent end node V in the adjacency list is carried out following steps:
1) the Search Flags f of each node correspondence in the adjacency list is changed to 0;
2) set out by concurrent end node V and call reverse traversal subalgorithm and travel through.
7. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 6, it is characterized in that: described reverse traversal subalgorithm is: at first the traversal sign f of traversal start node V0 is made as 1; Judge again whether traversal start node V0 also has next adjacent node; If any words, if the next adjacent node of traversal start node V0 is V2, described next adjacent node V2 is made the following judgment:, continue then to judge whether traversal start node V0 also has next adjacent node 1) if the next adjacent node V2 of traversal start node V0 is the concurrent start node V1 of concurrent end node V correspondence; 2), continue then to judge whether traversal start node V0 also has next adjacent node if the traversal sign f of the next adjacent node V2 of traversal start node V0 is 1; 3) if the next adjacent node V2 of traversal start node V0 is concurrent end node V, there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node; 4) if the next adjacent node V2 of traversal start node V0 is a root node, there is illegal entry then concurrent unit, prints traverse path, continues then to judge whether traversal start node V0 also has next adjacent node; 5) other situation reverse traversal subalgorithm of recursive call is then set out by the next adjacent node V2 of traversal start node V0 and to be proceeded traversal.
8. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 3, it is characterized in that: check the algorithm of redirect between concurrent branch to be: to travel through from concurrent start node, when running into the node that a plurality of inlets are arranged, oppositely travel through from this node, if can just can get back to concurrent start node without the node of the traversal of forward, have redirect between then concurrent branch; Its algorithm: 1) whole process flow diagram is created a forward adjacency list, a reverse adjacency list; 2) each concurrent start node V in the adjacency list is carried out following steps:
1) forward of each node correspondence in adjacency list traversal sign f is made as 0;
2) set out by concurrent start node V and call forward traversal subalgorithm and travel through.
9. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 8, it is characterized in that: forward traversal subalgorithm is: at first forward traversal sign f, the reverse traversal sign f1 of traversal start node V0 are made as 1; Judge then whether traversal start node V0 also has next adjacent node, if any words, if the next adjacent node of traversal start node V0 is V2, to described next adjacent node V2 execution in step be again: 1) if next adjacent node V2 and concurrent start node V direct neighbor are made as 0 to the reverse traversal sign f1 of each node correspondence in the adjacency list; 2) if the reverse traversal sign f1 of next adjacent node V2 is 0, and next adjacent node V2 is not concurrent start node V, concurrent end node V1 that neither concurrent start node V correspondence, and next adjacent node V2 goes into the limit number greater than 1, is set out by next adjacent node V2 and calls reverse traversal subalgorithm and carry out reverse traversal; 3) next adjacent node V2 is made the following judgment:, then whether also have next adjacent node V2 to continue to carry out and judge traversal start node V0 if the next adjacent node V2 of a. is concurrent start node V; If b. next adjacent node V2 is the concurrent end node V1 of concurrent start node V correspondence, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; If the forward of c. next adjacent node V2 traversal sign f is 1, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; If d. next adjacent node V2 is a leaf node, then whether also has next adjacent node V2 to continue to carry out and judge traversal start node V0; E. other situation recursive call forward traversal subalgorithm is then set out by next adjacent node V2 and to be proceeded traversal.
10. according to the legitimacy method of calibration of the concurrent unit of the described work process flow figure of claim 8, it is characterized in that: reverse traversal subalgorithm is: the reverse traversal sign f1 that at first will travel through start node V0 is made as 1; Judge again whether traversal start node V0 also has next adjacent node, if any words, if the next adjacent node of traversal start node V0 is V3, again the reverse adjacent node V3 of this next one is judged:, then continue to judge next reverse adjacent node 1) if reverse adjacent node V3 is the concurrent end node V1 of concurrent start node V correspondence; 2), then continue to judge next reverse adjacent node if reverse adjacent node V3 is a root node; 3) if the reverse traversal sign f1 of reverse adjacent node V3 is 1, then continue to judge next reverse adjacent node; 4) if reverse adjacent node V3 is concurrent start node V, there is redirect between then concurrent branch, prints traverse path, continue to judge next reverse adjacent node again; 5) other situation reverse traversal subalgorithm of recursive call is then set out by reverse adjacent node V3 and to be proceeded reverse traversal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100212694A CN100382077C (en) | 2004-04-09 | 2004-04-09 | Lawful testing method of cocurrent unit of flow chart |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100212694A CN100382077C (en) | 2004-04-09 | 2004-04-09 | Lawful testing method of cocurrent unit of flow chart |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1680936A true CN1680936A (en) | 2005-10-12 |
| CN100382077C CN100382077C (en) | 2008-04-16 |
Family
ID=35067530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100212694A Expired - Fee Related CN100382077C (en) | 2004-04-09 | 2004-04-09 | Lawful testing method of cocurrent unit of flow chart |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100382077C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101826103A (en) * | 2010-04-06 | 2010-09-08 | 山东高效能服务器和存储研究院 | Method for reversely searching packet depended relationship in unix operating system |
| CN101876900A (en) * | 2009-11-24 | 2010-11-03 | 恒生电子股份有限公司 | Method for automatically adjusting and distributing flow chart and device thereof |
| CN106446417A (en) * | 2016-09-27 | 2017-02-22 | 东软集团股份有限公司 | Method, device and terminal for processing concurrent body |
| CN107704235A (en) * | 2017-09-22 | 2018-02-16 | 深圳航天科技创新研究院 | The analytic method of data flowchart, system and storage medium in mathematics library |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6202192B1 (en) * | 1998-01-09 | 2001-03-13 | International Business Machines Corporation | Distributed static timing analysis |
-
2004
- 2004-04-09 CN CNB2004100212694A patent/CN100382077C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101876900A (en) * | 2009-11-24 | 2010-11-03 | 恒生电子股份有限公司 | Method for automatically adjusting and distributing flow chart and device thereof |
| CN101876900B (en) * | 2009-11-24 | 2014-01-08 | 恒生电子股份有限公司 | Method for automatically adjusting and distributing flow chart and device thereof |
| CN101826103A (en) * | 2010-04-06 | 2010-09-08 | 山东高效能服务器和存储研究院 | Method for reversely searching packet depended relationship in unix operating system |
| CN101826103B (en) * | 2010-04-06 | 2015-06-10 | 浪潮电子信息产业股份有限公司 | Method for reversely searching packet depended relationship in unix operating system |
| CN106446417A (en) * | 2016-09-27 | 2017-02-22 | 东软集团股份有限公司 | Method, device and terminal for processing concurrent body |
| CN106446417B (en) * | 2016-09-27 | 2023-05-12 | 东软集团股份有限公司 | Processing method, device and terminal of concurrency body |
| CN107704235A (en) * | 2017-09-22 | 2018-02-16 | 深圳航天科技创新研究院 | The analytic method of data flowchart, system and storage medium in mathematics library |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100382077C (en) | 2008-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101055535A (en) | Parallel computer and method for locating hardware faults in a parallel computer | |
| CN101035131A (en) | Protocol recognition method and device | |
| CN101047670A (en) | MAC address table ageing, operation method and process system thereof | |
| CN1492361A (en) | Processing method for embedded data bank searching | |
| CN1173682A (en) | Online character recognition system for recognizing input characters using standard strokes | |
| CN101039253A (en) | Method for realizing prefix extension of range matching of ternary content addressable memory | |
| CN101079890A (en) | A method and device for generating characteristic code and identifying status machine | |
| CN1680936A (en) | Lawful testing method of cocurrent unit of flow chart | |
| CN1741499A (en) | Virtual circuit exchanging method based on MAC studying | |
| CN1815997A (en) | Group classifying method based on regular collection division for use in internet | |
| CN1967500A (en) | Resource using method in automatic testing process | |
| CN1207878C (en) | Routing table compression method | |
| CN1549670A (en) | Method and apparatus for examining uniformity | |
| CN1889059A (en) | Automatic excavating method for integer overflow loophole | |
| CN1859019A (en) | Method and device for realizing automatic frequency control | |
| CN1852238A (en) | Fast indexing method | |
| CN1885888A (en) | Call ticket sorting method and system | |
| CN1859268A (en) | Method and system for backward-forward analytic message at background | |
| CN1645809A (en) | Method for accelerating packing filter | |
| CN1604564A (en) | Policy tree based packet filtering and management method | |
| CN1859222A (en) | Message forming method | |
| CN1534905A (en) | Intelligent business testing method based on structural unit | |
| CN1067783C (en) | Transfering generation tech. based on Sc grammar | |
| CN1809001A (en) | Method of testing transmission performance of HSDPA channel | |
| CN1784120A (en) | Method for realizing reutilization in printed circuit board design |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: SHENYANG NEUSOFT SOFTWARE CO., LTD. Free format text: FORMER OWNER: DONGRUAN GROUP CO., LTD. Effective date: 20080620 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20080620 Address after: Lane 3, Lane 11, Wenhua Road, Heping District, Shenyang Patentee after: Shenyang Dongruan Software Co., Ltd. Address before: Liaoning city of Shenyang Province Hunnan hi tech Industrial Development Zone, East Software Park Patentee before: Dongruan Group Co., Ltd. |
|
| C56 | Change in the name or address of the patentee |
Owner name: NEUSOFT GROUP CO., LTD. Free format text: FORMER NAME OR ADDRESS: SHENYANG NEUSOFT SOFTWARE CO., LTD. |
|
| CP03 | Change of name, title or address |
Address after: Hunnan rookie street Shenyang city Liaoning province 2 No. Patentee after: Neusoft Group Corporation Address before: Lane 3, Lane 11, Wenhua Road, Heping District, Shenyang Patentee before: Shenyang Dongruan Software Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080416 Termination date: 20170409 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |