CN101650799A - Discovery method of mismatched interaction between operation flows - Google Patents
Discovery method of mismatched interaction between operation flows Download PDFInfo
- Publication number
- CN101650799A CN101650799A CN200910092802A CN200910092802A CN101650799A CN 101650799 A CN101650799 A CN 101650799A CN 200910092802 A CN200910092802 A CN 200910092802A CN 200910092802 A CN200910092802 A CN 200910092802A CN 101650799 A CN101650799 A CN 101650799A
- Authority
- CN
- China
- Prior art keywords
- mutual
- alternately
- operation flow
- contradiction
- operation flows
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a discovery method of mismatched interaction between operation flows. The discovery method comprises the following steps: selecting two operation flows from a plurality of operation flows to be processed; based on the relationship of two activities participating in interaction in either selected operation flow, determining the relationship of the interaction pair which the activities belong to in the operation flow so as to obtain the relationship set between the interactive interaction pairs contained in the two selected operation flows, wherein the relationship set between the interaction pairs includes the relationship of the interaction pairs in the two selected operation flows; and determining the incompatible interaction pairs in the two selected operation flows based on the relationship between the incompatible interaction pairs contained in the relationship set between the interaction pairs so as to generate an integrated incompatible interaction set of the two selected operation flows. The discovery method has the advantages of high speed, high efficiency and easy implementation, and can find out the different types of mismatching interactions, can accurately find out the mismatching interaction between the two operation flows, which is causes by which interactions, and can find out the mismatching interaction caused by run time errors.
Description
Technical field
The present invention relates to computer software modeling field, particularly the discover method of the mismatched interaction between operation flow.
Background technology
Operation flow is a kind of form of expression of business demand, and it is met the back in user's request and finishes from user's demand.It is early stage that the notion of operation flow appears at the nineties the earliest, thereby the motivation that its produces derives from the flow process redesign is promoted Enterprises'Competitiveness to adapt to new variation, and as the expansion to workflow, BPM is then more emphasized the meter of reseting of operation flow.Operation flow and workflow can both make operation flow robotization and collaborative work and increase work efficiency.
Along with the progress of infotech, specific business function is no longer realized by single enterprise or tissue, but by finishing with working in coordination with alternately between the existing business flow process, this development mode can greatly shorten the development time, save cost of development.Operation flow can adopt Process Modeling Notation, and (Business Process Model Notation BPMN) comes modeling.BPMN is the standard of the operation flow modeling of being organized to set up by OMG, and it is made up of a series of standard icons that are used for making up operation flow, and not with any realization technology close-coupled.BPMN not only can realize single operation flow modeling, and can realize multipaths and mutual modeling between them.BPMN is the first operation flow modeling language that is used to stride the open standard of organization business flow process modeling, and it can be read by the high-level business personnel at an easy rate and understand and be convenient to interchange between the different enterprises.
Have a lot of benefits though adopt BPMN to carry out the operation flow modeling, also exist a lot of not enoughly, wherein the very important point is when adopting BPMN to carry out between multi-service flow interactive modeling, to cause mutual not matching between operation flow easily.Mutual not matching is meant that operation flow can't correctly finish mutual between them between so-called operation flow, just exists unmatched mutual.Operation flow exists unmatched mutual profound reason to be to have contradiction between the expressed business demand of operation flow.From technical standpoint, cause the mutual unmatched reason of operation flow can be divided into three kinds: interaction syntax mistake, static structure mistake, run time error.
Existed at present and much be devoted to find unmatched method mutual between operation flow.Formalization methods such as Petri net and finite-state automata all can be used to verify the matching between flow process.Using the method for Petri net is that each operation flow is converted to a Petri net, to be converted into storehouse institute (place) alternately between flow process then, at last mutual unmatched the pinpointing the problems between the multipaths is converted to the correctness problem of the big flow process inside after a multipaths merges.The method of finite-state automata always can correctly be finished once being used as alternately between flow process, but mutual transmission messaging activity success when the operation of flow process, may occur once, but receive messaging activity because the operation context environmental of flow process is not ready for causing the situation of current mutual failure.
In a word, method of the prior art all comes with some shortcomings separately, is listed below: at first, they find that mutual unmatched process is loaded down with trivial details, consuming time between operation flow; Secondly, the feature when these methods are not considered process flow operation, and this can cause empirical tests to mate operation flow mutually mutual not matching takes place when operation; At last, which existing method can not provide exactly and cause mutual not matching between flow process alternately.
Summary of the invention
It is loaded down with trivial details, consuming time to the objective of the invention is to overcome between existing operation flow mismatched interaction discover method process, can not find operation flow at the mismatched interaction in when operation and can not point out accurately which has caused mutual defective such as do not match between flow process alternately, thereby a kind of discover method of mismatched interaction of easy, efficient, complete function is provided.
The invention provides the discover method of the mismatched interaction between a kind of operation flow, comprising:
Step 1), from a plurality of pending operation flows, choose two operation flows;
Step 2), determine movable place alternately to the relation in this operation flow, and then to obtain two selected operation flows contained mutual alternately to a set of relationship according to the relation that participates in selected arbitrary operation flow between two mutual activities; Wherein,
Described alternately a set of relationship is comprised described mutual to the relation in two selected operation flows; Relation between described activity comprises preceding, back, parallel, mutual exclusion and the part mutual exclusion fully in proper order of order;
Step 3), according to described alternately to comprised in the set of relationship exist contradiction alternately a relation is determined to have the right alternately of contradiction in two selected operation flows, thereby the complete contradiction that generates two selected operation flows is gathered alternately.
In the technique scheme, in described step 1), selected operation flow is to not participating in the operation flow after yojan is carried out in activity mutual between operation flow.
In the technique scheme, do not participate in activity mutual between operation flow in the described selected operation flow and comprise:
A, do not send message or accept the activity of the task type of message;
The activity of b, intermediate event type;
C, content are that the gateway of sky is right.
In the technique scheme, also comprise:
Step 4), gather alternately according to described complete contradiction and to calculate minimum and clear up set; Described minimum is cleared up set and can be derived described complete contradiction and gather alternately, and the mutual right number minimum of the contradiction that is comprised.
In the technique scheme, described step 4) comprises:
Step 4-1), initialization minimum is cleared up set for empty;
Step 4-2), select in the mutual set of contradiction one alternately to (i1, i2);
Step 4-3), if there is mutual x, make that the relation between i1 and the x is before the order or simultaneously for after the order or simultaneously for parallel simultaneously, and alternately to (i2, x) Already in minimum is cleared up in the set, then alternately to (i1, i2) do not add described minimum and clear up set, clear up set otherwise add described minimum;
Step 4-4), from step 4-2) begin to repeat, all in the mutual set of the complete contradiction of traversal are right alternately.
In the technique scheme, also comprise:
Step 5), two operation flows of merging, operation flow after will merging then and other operation flow are as two selected operation flows, re-execute the operation after the step 1), until no longer including undressed operation flow, thereby realize the discovery of mismatched interaction between a plurality of operation flows.
In the technique scheme, in described step 5), two operation flows of described merging comprise that two operation flows that will obtain the mutual set of complete contradiction merge.
In the technique scheme, described two operation flows that will obtain the mutual set of complete contradiction merge and comprise:
Step 5-1), select one of them as the target flow process, the another one operation flow as the input flow process;
Step 5-2), with in the described input flow process except come into play, each activity movable in ending activity and the mutual Already in described target flow process of the other side all is added in the described target flow process;
Step 5-3), with come into play except connection in the described input flow process and the migration of ending activity each migration add in the described target flow process, if the activity that initiate migration connected does not join in the described target flow process, then will move the mutual the other side who connects former activity.
In the technique scheme, in described step 3), describedly there be alternately a relation being comprised of contradiction:
"Before the order " and " mutual exclusion fully ", " order back " and " mutual exclusion fully ",
"Before the order " and " part mutual exclusion ", " order back " and " part mutual exclusion ", " walk abreast " and " part mutual exclusion ", " order is preceding " and " in proper order ", " complete mutual exclusion " and " walking abreast ".
In the technique scheme, when being one of following to a pass alternately, described alternately to " deadlock " takes place: " before the order " and " mutual exclusion fully ", " order back " and " complete mutual exclusion ",
"Before the order " and " part mutual exclusion ", " order back " and " part mutual exclusion ", " walk abreast " and " part mutual exclusion ", " preceding in proper order " and " in proper order ";
When alternately a pass being " mutual exclusion fully " and " walking abreast ", described alternately to " lacking synchronously " takes place.
The present invention also provides the discovery device of the mismatched interaction between a kind of operation flow, comprises operation flow selection module, alternately a set of relationship generation module, complete contradiction is gathered generation module alternately; Wherein,
Described operation flow selects module to be used for choosing two operation flows from a plurality of pending operation flows;
Describedly alternately a set of relationship generation module is used for determining movable place alternately to the relation in this operation flow according to the relation that participates between two mutual activities in selected arbitrary operation flow, and then it is contained mutual alternately to a set of relationship to obtain two selected operation flows; Wherein,
Described alternately a set of relationship is comprised described mutual to the relation in two selected operation flows; Relation between described activity comprises preceding, back, parallel, mutual exclusion and the part mutual exclusion fully in proper order of order;
Described complete contradiction is gathered generation module alternately and is used for alternately the mutual of contradiction that exist that set of relationship comprised being determined to have the right alternately of contradiction in two selected operation flows to a relation according to described, thereby the complete contradiction that generates two selected operation flows is gathered alternately.
In the technique scheme, also comprise operation flow yojan module, this module is used for carrying out yojan to not participating in activity mutual between operation flow.
In the technique scheme, comprise that also minimum clears up the set computing module; This module is used for gathering the calculating minimum alternately according to described complete contradiction and clears up set; Described minimum is cleared up set and can be derived described complete contradiction and gather alternately, and the mutual right number minimum of the contradiction that is comprised.
In the technique scheme, comprise that also operation flow merges module; This module is used to merge two operation flows.
The invention has the advantages that:
1, the present invention have fast, efficient, realize simple advantage.
2, the present invention can find out dissimilar unmatched mutual.
3, which the present invention can find out exactly and cause mutual not matching between flow process alternately.
Description of drawings
Fig. 1 is the process flow diagram of the discover method of the mismatched interaction between operation flow of the present invention;
Fig. 2 is the synoptic diagram of five kinds of control flow relations between the interior activity of operation flow;
Fig. 3 is for existing a mutual right example of contradiction in the operation flow;
Fig. 4 is deadlock situation and the exemplary plot that lacks synchronia;
Fig. 5 is for calculating the minimum example of set of clearing up in operation flow;
Fig. 6 is for merging an example of operation flow.
Embodiment
The present invention will be described below in conjunction with the drawings and specific embodiments.
Before method of the present invention is elaborated, at first some related in the inventive method notions are described.
Movable: the working cell of subdivisible minimum not in the operation flow modeling, for example one section program of operation automatically.
Gateway is right: occur bifurcated (split) and merging (join) to realize movable execution route in pairs, whether concurrent according to movable execution route, gateway is to being divided into the mutual exclusion gateway to right with parallel gateway.For example, among Fig. 2 (c), Fig. 2 (d) movable a, b two ends, be used to represent that the beginning of branch and the prismatic of end are exactly that described gateway is right, wherein the gateway among Fig. 2 (c) to for parallel gateway right, and the gateway among Fig. 2 (d) to for the mutual exclusion gateway right.
Alternately: the transmission of a message is called as once mutual between operation flow between any two operation flows, can be expressed as that (a, b), a wherein, b belong to different operation flows respectively.
Complete contradiction is gathered alternately: the mutual set between two operation flows is by mutual compositions all between them, and the mutual set of the complete contradiction between them comprises that all are conflicting right alternately, and is the subclass of mutual set cartesian product between them.
Minimum is cleared up set: by eliminating the mutual to just eliminating the mutual mismatch problem between operation flow of part contradiction in the mutual set of complete contradiction, this part contradiction is cleared up set to having constituted minimum alternately.
Related related notion is done on the basis of above-mentioned explanation in to the present invention, below specific implementation process of the present invention is described.The present invention will do be in mutual mutually a plurality of operation flows, find out unmatched mutual.Therefore, the present invention to be processed to as if having a plurality of operation flows of incidence relation.Described a plurality of operation flow can also can adopt other flow process modeling language modeling with the BPMN modeling of being mentioned in the background technology.One comprise a plurality of operation flows and between them the BPMN model of message transmission be expressed as follows with two tuples:
package＝(processes，interactions)
Wherein, processes represents the set of operation flow, and interactions represents the mutual set of whole model.
Operation flow can further be expressed as:
process＝{Start，End，activities，gateways?transitions}
Wherein, activities represents active set, and transitions represents the set of moving between the activity, and Start represents coming into play of flow process, and End represents the ending activity of flow process.
After the relevant information of a plurality of operation flows that obtain having incidence relation, just can find out wherein unmatched mutual by method of the present invention.Because searching unmatched in two operation flows is the operation on basis alternately, therefore, is example with two operation flows at first,, the implementation procedure of the inventive method is described with reference to figure 1.
From a plurality of operation flows, choose two operation flows arbitrarily, represent with Q and P respectively with incidence relation.In general, only account for the part of operation flow in the operation flow with relevant alternately activity, other in the operation flow is movable and mutual irrelevant.Difficulty for relation between reducing is alternately obtained in the present embodiment, as a kind of preferred implementation, can not participate in activity mutual between operation flow in the yojan operation flow.But meanwhile,, need in this preferred implementation, need can be divided into 3 classes to being limited by the scope of yojan activity by the activity of yojan in order the mutual discovery that has contradiction between operation flow not to be impacted:
1, do not send message or accept the activity of the task type of message;
2, the activity of intermediate event (InmediateEvent) type;
3, content is that empty gateway is right.After 1,2 above-mentioned class activities are fallen in yojan, if the right bifurcated of gateway and merge between without any task activity, perhaps bifurcated and merge between only comprise the situation of a branch, then to be considered as content right for empty gateway for this gateway, need be with its yojan.
Though in the present embodiment two operation flows having chosen have been done the yojan operation, in other embodiments, also can omit this yojan operation, the calculated amount that is follow-up associative operation can become big.
After above-mentioned selected operation flow Q, P being done the yojan operation, just can judge the relation between mutual.Relevant knowledge according to those skilled in the art can be known: if comprise conflicting alternately between two operation flows, these two operation flows are exactly unmatched so, otherwise, mate between two operation flows.Whether and exist contradiction to depend between mutual whether have conflicting control flow relation between the distinct interaction, further can think, the relation between depends on the relation between the operation flow internal activity alternately.Therefore, judge that matching relationship between operation flow need at first know the relation between the operation flow internal activity.
Relevant knowledge according to this area, control flow relation (hereinafter to be referred as " relation ") between inner any two activities of operation flow can be summarized as following five kinds, be respectively: (S_Pre), order back (S_Post), parallel (Parallel), mutual exclusion (Com_E) fully, part mutual exclusion (Part_E) before the order.Shown in Fig. 2 (a), if movable a always is performed prior to movable b, the pass between then movable a and the movable b can be recorded as aS_Preb before being order.Opposite, shown in Fig. 2 (b), if movable a always is performed in movable b the back, the pass between then movable a and the movable b can be recorded as aS_Postb after being order.Shown in Fig. 2 (c), if movable a and movable b (are that movable a and movable b need executed in parallel in two right branches of parallel gateway, and the execution of an activity does not impact another activity), the pass between so movable a and the movable b is parallel, can be recorded as aPb.Shown in Fig. 2 (d), if movable a and movable b (being that movable a and movable b can only select one of them execution) in two right branches of mutual exclusion gateway, the pass between so movable a and the movable b is complete mutual exclusion, can be recorded as aCom_Eb.Shown in Fig. 2 (e), in a right branch of mutual exclusion gateway, movable a is before the right order of this mutual exclusion gateway or after the order, the pass between so movable a and the movable b is the part mutual exclusion, can be recorded as aPart_Eb as if movable b.
From the angle of set theory, the relation between the flow process internal activity can be regarded the binary relation on the active set as, so the above-mentioned five kinds of relations between activity satisfy following character:
● these five kinds of relations all are disjoint and their union equates with the cartesian product of active set;
● S_Pre is that the reverse-power of S_Post and they all are transferable;
● in single operation flow is under well-formed's the situation, and Com_E and Parallel can transmit equally.
After obtaining movable above-mentioned five kinds of relationship types, will be sorted out the relation that operation flow inside participates between the activity mutual between operation flow.This classification process can obtain by using the depth-first traversal algorithm.At first utilize the depth-first traversal algorithm discovery of digraph right with all gateways from all paths that come into play ending activity of single flow process, any two relations that participate between mutual activity can obtain by following rule in this flow process like this:
● if two activities and do not have unpaired gateway activity between them in this paths under same paths, then the relation between them be before the order or in proper order according to the front and back position in the path;
● if two activities and have unpaired gateway activity between them in this paths under same paths, and the type of this gateway activity is mutual exclusion, and then the pass between them is the part mutual exclusion;
● gateway between different branches on two activities between relation, be divided into parallel or mutual exclusion fully according to the difference of gateway type (parallel or mutual exclusion).
Mention in the explanation in front, the relation between mutual depends on the relation between the operation flow internal activity, therefore, knows the relation in same operation flow between just can knowing alternately after the relation that participates between mutual activity by mentioned above principle.The relation that participates between mutual activity in relation between mutual in same operation flow and this operation flow is identical, and the relation between mutual should comprise alternately the relation in different operation flows.With Fig. 3 is example, and the activity that participates in mutual i1, mutual i2 among the operation flow P is respectively movable a, movable b, and the pass between them is aS_Preb, so i1 and the pass of i2 in P are i1S_Prei2.Similarly, can obtain i1, the i2 relation in flow process Q, i1, the i2 pass in operation flow Q is i1S_Posti2.The form that concerns usable set between mutual represents, is { i1S_Prei2, i1S_Posti2} as the set of the mutual relationship of mutual i1, mutual i2.
Can obtain any two relations between mutual between two operation flows by aforesaid operations.From above-mentioned explanation as can be seen, specific mutual a kind of definite mutual relationship is arranged in an operation flow for two, in two different operation flows, then have two kinds of different mutual relationships.And the relation object between the flow process internal activity is seemingly, mutual between relation also can regard the binary relation in the mutual set between operation flow as, the character that concerns between the operation flow internal activity can be suitable for equally and alternately between relation.
Obtaining between two operation flows just can between alternately, whether existing contradiction to judge after any two relations between mutual.In addition, can also unmatched mutual particular type be described according to the type of contradiction.Mention in background technology, the generation of mismatched interaction may be because the static structure mistake, also may be because the mistake during operation.The criterion of the mismatched interaction that respectively two big class mistakes is produced describes below.
For the static structure mistake, two kinds of mutual unmatched types have been proposed again in the present invention, they are " deadlocks " and " lacking synchronously ".So-called " deadlock " is meant the state that is in circular wait between mutual, shown in Fig. 4 (a), has deadlock situation alternately between movable a and the movable b.So-called " lacking synchronously " is meant owing to lack the synchronous gateway of the execution route of running simultaneously and causes mutual repeatedly repeating, shown in figure (b), exist between movable a and the movable b to lack synchronous phenomenon.When the relation between mutual in the different business flow process satisfies following standard, can think to have " deadlock " or " lacking synchronously " between mutual.
Deadlock: when alternately between relation in the different business flow process satisfy one of followingly, just think to have deadlock between mutual.Before " order before " and " mutual exclusion fully ", " order back " and " mutual exclusion fully ", the order " and " part mutual exclusion ", " order back " and " part mutual exclusion ", " walking abreast " and " part mutual exclusion ", " preceding in proper order " and " in proper order ".
Lack synchronously: when alternately between relation in the different business flow process when satisfying " mutual exclusion fully " and " walk abreast ", think alternately to existing shortage synchronous.
Also above-mentioned standard is illustrated in the table 1 below, in this table, two mutual relations in an operation flow of first line display, two mutual relations in the another one operation flow are shown in first tabulation, "Yes" represents that two is conflicting alternately, "No" represents that two is not conflicting alternately, and * represents if the condition of mutual exclusion gateway satisfies particular data to be relied on when requiring, alternately to can being reconcilable.
Table 1
It more than is the explanation of the particular type of mismatched interaction that the static structure mistake is produced.For because for the mismatched interaction that mistake produced in when operation, its criterion is comparatively simple, in operational process, when alternately between relation in the different business flow process when satisfying " before the order " and " after the order ", just think alternately to there being run time error.For example, the mutual i1 that in Fig. 3, is mentioned, the pass between the i2 is that { i1S_Prei2, i1S_Posti2} can know mutual i1 thus, have contradiction between the i2, and mutual i1, and the contradiction between the i2 produces when operation.
After any two relations between mutual are all done above-mentioned judgement in two operation flows, can obtain one and include the contradictory complete contradiction alternately of institute and gather alternately.After obtain described complete contradiction set, can think the discovery of having finished mismatched interaction in two operation flows substantially.But in the present embodiment,, can also on the basis of the mutual set of complete contradiction, further ask for minimum and clear up set as preferred implementation.Minimum is cleared up set can provide guidance for mutual unmatched elimination between flow process, by only eliminate minimum clear up in the set conflicting alternately to guaranteeing to be coupling mutually alternately between two operation flows.
Minimum is cleared up asking for based on following character of set:
Mutual i1, i2, i3 between 1: two operation flow of character, if two relations between i1 and the i2 are before the order or simultaneously for the order back or simultaneously for parallel simultaneously, and i2 and i3 do not match, then i1 and i3 are unmatched.
For example, in operation flow Q shown in Figure 5 and operation flow P, before mutual i2, the i3 pass in flow process P was order, their passes in flow process Q were the part mutual exclusion, and it is conflicting can judging mutual i2, i3 according to table 1.Before mutual i1, the i2 pass in flow process P was order, before their passes in flow process Q were order, it was conflicting can drawing mutual i1, i3 according to character 1.Before mutual i1, the i3 pass in flow process P was order, their passes in flow process Q were the part mutual exclusion, and it is conflicting can drawing mutual i1, i3 equally according to table 1.Thus, the mutual set of the complete contradiction between operation flow Q and the operation flow P is: (i2, i3), (i2, i4), (i3, i4), (i1, i3), (i1, i4) }, and the minimum between them is cleared up set and only is: (i2, i3), (i2, i4), (i3, i4) }.Clear up set by calculating minimum, the mutual right quantity of the contradiction of need eliminating has been dwindled greatly, and mutual between the operation flow after eliminating also is coupling mutually.
Minimum is cleared up to be integrated into and should be satisfied following two conditions in logic:
1), using aforesaid character 1 can derive complete contradiction gathers alternately;
2), satisfy condition 1) prerequisite under the mutual right number minimum of the contradiction that comprises.
It is as follows to calculate the minimum method of clearing up set on the basis of the mutual set of complete contradiction:
A, initialization minimum are cleared up set for empty;
B, select in the mutual set of contradiction one alternately to (i1, i2);
C, if there is mutual x, make relation between i1 and the x simultaneously for before the order or, and alternately to (i2 simultaneously for the order back or simultaneously for parallel, x) Already in minimum is cleared up in the set, then alternately to (i1 i2) does not add minimum and clears up set, clears up set otherwise add minimum;
D, begin to repeat from step b, all in the mutual set of the complete contradiction of traversal are right alternately.
More than be to searching unmatched mutual entire flow in two operation flows.On the basis of two operation flows, can further obtain unmatched mutual in all the other operation flows.Clear up set in mutual set of the complete contradiction that obtains two operation flows and minimum, these two operation flows of having handled are merged into an operation flow, certain remaining in the operation flow after will merging then and the operation flow of finding that need not match alternately operation flow repeats aforesaid yojan flow process, ask for relation between mutual in the operation flow, calculate complete contradiction gathers, calculates minimum alternately and clear up operations such as set, and the complete contradiction that obtains these two operation flows gathers alternately and minimum is cleared up set.If also there is not processed operation flow, then continue to carry out merge operation flow, yojan flow process, ask for relation between mutual in the operation flow, calculate complete contradiction and gather, calculate minimum alternately and clear up operations such as set, until undressed never again operation flow.Though finish the merging of operation flow in the present embodiment according to said sequence, in other embodiments, also can finish the merging of operation flow in proper order according to other.
In said process, the merging operation flow of being mentioned is meant: when merging two operation flows, at first select one of them as the target flow process, the another one operation flow is as the input flow process.Except come into play, ending activity and mutual the other side activity in the target flow process Already in, each activity in the input flow process all is added in the target flow process.Each migration (being the straight line in the business process map) in the input flow process all is added in the target flow process, and what remove the non-migrating connection is the beginning or the ending activity of input flow process.If the activity that initiate migration connected does not join in the target flow process, then will move the mutual the other side who connects former activity.
In Fig. 6, provided an example that merges two operation flows.If flow process P is taken as the target flow process, flow process Q is taken as the input flow process, then all activities among the flow process Q all do not add flow process P, all migrations among the flow process Q come into play except connection and the migration of ending activity, all be added among the flow process Q, and these activities of being connected of migration all are reset the mutual the other side into the connection activity of original institute.
The invention provides and the corresponding operation flow of said method between the discovery device of mismatched interaction, comprise that operation flow selects module, alternately a set of relationship generation module, complete contradiction are gathered generation module alternately; Wherein,
Described operation flow selects module to be used for choosing two operation flows from a plurality of pending operation flows;
Describedly alternately a set of relationship generation module is used for determining movable place alternately to the relation in this operation flow according to the relation that participates between two mutual activities in selected arbitrary operation flow, and then it is contained mutual alternately to a set of relationship to obtain two selected operation flows; Wherein,
Described alternately a set of relationship is comprised described mutual to the relation in two selected operation flows; Relation between described activity comprises preceding, back, parallel, mutual exclusion and the part mutual exclusion fully in proper order of order;
Described complete contradiction is gathered generation module alternately and is used for alternately the mutual of contradiction that exist that set of relationship comprised being determined to have the right alternately of contradiction in two selected operation flows to a relation according to described, thereby the complete contradiction that generates two selected operation flows is gathered alternately.
The discovery device of the mismatched interaction between operation flow of the present invention also comprises operation flow yojan module, and this module is used for carrying out yojan to not participating in activity mutual between operation flow.
The discovery device of the mismatched interaction between operation flow of the present invention comprises that also minimum clears up the set computing module; This module is used for gathering the calculating minimum alternately according to described complete contradiction and clears up set; Described minimum is cleared up set and can be derived described complete contradiction and gather alternately, and the mutual right number minimum of the contradiction that is comprised.
The discovery device of the mismatched interaction between operation flow of the present invention comprises that also operation flow merges module; This module is used to merge two operation flows.
Said method of the present invention and device are judged relation between mutual by the relation between the activity in the operation flow, thereby find out unmatched alternately, have fast, efficient, realize simple advantage.
Whether the present invention not only can judge and exist unmatched alternately between operation flow, and can also find out unmatched mutual particular type.
The present invention can not only find out by the static structure mistake produced unmatched mutual, can also find out the mismatched interaction that produces by run time error.
Which the present invention can also find out exactly and caused mutual not matching between flow process alternately by minimum being cleared up finding the solution of set.
It should be noted last that above embodiment is only unrestricted in order to technical scheme of the present invention to be described.Although the present invention is had been described in detail with reference to embodiment, those of ordinary skill in the art is to be understood that, technical scheme of the present invention is made amendment or is equal to replacement, do not break away from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (14)
1, the discover method of the mismatched interaction between a kind of operation flow comprises:
Step 1), from a plurality of pending operation flows, choose two operation flows;
Step 2), determine movable place alternately to the relation in this operation flow, and then to obtain two selected operation flows contained mutual alternately to a set of relationship according to the relation that participates in selected arbitrary operation flow between two mutual activities; Wherein,
Described alternately a set of relationship is comprised described mutual to the relation in two selected operation flows; Relation between described activity comprises preceding, back, parallel, mutual exclusion and the part mutual exclusion fully in proper order of order;
Step 3), according to described alternately to comprised in the set of relationship exist contradiction alternately a relation is determined to have the right alternately of contradiction in two selected operation flows, thereby the complete contradiction that generates two selected operation flows is gathered alternately.
2, the discover method of the mismatched interaction between operation flow according to claim 1 is characterized in that, in described step 1), selected operation flow is to not participating in the operation flow after yojan is carried out in activity mutual between operation flow.
3, the discover method of the mismatched interaction between operation flow according to claim 2 is characterized in that, does not participate in activity mutual between operation flow in the described selected operation flow and comprises:
A, do not send message or accept the activity of the task type of message;
The activity of b, intermediate event type;
C, content are that the gateway of sky is right.
4, the discover method of the mismatched interaction between operation flow according to claim 1 and 2 is characterized in that, also comprises:
Step 4), gather alternately according to described complete contradiction and to calculate minimum and clear up set; Described minimum is cleared up set and can be derived described complete contradiction and gather alternately, and the mutual right number minimum of the contradiction that is comprised.
5, the discover method of the mismatched interaction between operation flow according to claim 4 is characterized in that, described step 4) comprises:
Step 4-1), initialization minimum is cleared up set for empty;
Step 4-2), select in the mutual set of contradiction one alternately to (i1, i2);
Step 4-3), if there is mutual x, make that the relation between i1 and the x is before the order or simultaneously for after the order or simultaneously for parallel simultaneously, and alternately to (i2, x) Already in minimum is cleared up in the set, then alternately to (i1, i2) do not add described minimum and clear up set, clear up set otherwise add described minimum;
Step 4-4), from step 4-2) begin to repeat, all in the mutual set of the complete contradiction of traversal are right alternately.
6, according to the discover method of the mismatched interaction between claim 1 or 2 or 4 described operation flows, it is characterized in that, also comprise:
Step 5), two operation flows of merging, operation flow after will merging then and other operation flow are as two selected operation flows, re-execute the operation after the step 1), until no longer including undressed operation flow, thereby realize the discovery of mismatched interaction between a plurality of operation flows.
7, the discover method of the mismatched interaction between operation flow according to claim 6 is characterized in that, in described step 5), two operation flows of described merging comprise that two operation flows that will obtain the mutual set of complete contradiction merge.
8, the discover method of the mismatched interaction between operation flow according to claim 7 is characterized in that, described two operation flows that will obtain the mutual set of complete contradiction merge and comprise:
Step 5-1), select one of them as the target flow process, the another one operation flow as the input flow process;
Step 5-2), with in the described input flow process except come into play, each activity movable in ending activity and the mutual Already in described target flow process of the other side all is added in the described target flow process;
Step 5-3), with come into play except connection in the described input flow process and the migration of ending activity each migration add in the described target flow process, if the activity that initiate migration connected does not join in the described target flow process, then will move the mutual the other side who connects former activity.
9, according to the discover method of the mismatched interaction between claim 1 or 2 or 4 or 6 described operation flows, it is characterized in that, in described step 3), describedly there be alternately a relation being comprised of contradiction: " before the order " and " mutual exclusion fully ", " order back " and " mutual exclusion fully ", " before the order " and " part mutual exclusion ", " order back " and " part mutual exclusion ", " walk abreast " and " part mutual exclusion ", " preceding in proper order " and " in proper order ", " complete mutual exclusion " and " walking abreast ".
10, the discover method of the mismatched interaction between operation flow according to claim 9, it is characterized in that, when being one of following to a pass alternately, described: " before the order " and " mutual exclusion fully ", " order back " and " mutual exclusion fully ", " before the order " and " part mutual exclusion ", " order back " and " part mutual exclusion ", " walking abreast " and " part mutual exclusion ", " preceding in proper order " and " in proper order " alternately to " deadlock " takes place;
When alternately a pass being " mutual exclusion fully " and " walking abreast ", described alternately to " lacking synchronously " takes place.
11, the discovery device of the mismatched interaction between a kind of operation flow is characterized in that, comprises operation flow selection module, alternately a set of relationship generation module, complete contradiction is gathered generation module alternately; Wherein,
Described operation flow selects module to be used for choosing two operation flows from a plurality of pending operation flows;
Describedly alternately a set of relationship generation module is used for determining movable place alternately to the relation in this operation flow according to the relation that participates between two mutual activities in selected arbitrary operation flow, and then it is contained mutual alternately to a set of relationship to obtain two selected operation flows; Wherein,
Described alternately a set of relationship is comprised described mutual to the relation in two selected operation flows; Relation between described activity comprises preceding, back, parallel, mutual exclusion and the part mutual exclusion fully in proper order of order;
Described complete contradiction is gathered generation module alternately and is used for alternately the mutual of contradiction that exist that set of relationship comprised being determined to have the right alternately of contradiction in two selected operation flows to a relation according to described, thereby the complete contradiction that generates two selected operation flows is gathered alternately.
12, the discovery device of the mismatched interaction between operation flow according to claim 11 is characterized in that, also comprises operation flow yojan module, and this module is used for carrying out yojan to not participating in activity mutual between operation flow.
13, according to the discovery device of the mismatched interaction between claim 11 or 12 described operation flows, it is characterized in that, comprise that also minimum clears up the set computing module; This module is used for gathering the calculating minimum alternately according to described complete contradiction and clears up set; Described minimum is cleared up set and can be derived described complete contradiction and gather alternately, and the mutual right number minimum of the contradiction that is comprised.
14, according to the discovery device of the mismatched interaction between claim 11 or 12 or 13 described operation flows, it is characterized in that, comprise that also operation flow merges module; This module is used to merge two operation flows.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910092802A CN101650799A (en) | 2009-09-08 | 2009-09-08 | Discovery method of mismatched interaction between operation flows |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910092802A CN101650799A (en) | 2009-09-08 | 2009-09-08 | Discovery method of mismatched interaction between operation flows |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101650799A true CN101650799A (en) | 2010-02-17 |
Family
ID=41673034
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910092802A Pending CN101650799A (en) | 2009-09-08 | 2009-09-08 | Discovery method of mismatched interaction between operation flows |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101650799A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104715328A (en) * | 2015-03-09 | 2015-06-17 | 山东科技大学 | Service process expansion method based on core processes |
| CN107038549A (en) * | 2016-02-04 | 2017-08-11 | 平安科技（深圳）有限公司 | The information processing method and device of group danger |
| CN110704697A (en) * | 2019-10-11 | 2020-01-17 | 山东科技大学 | Method for improving business process efficiency based on selection branch construction |
| CN112529543A (en) * | 2020-12-28 | 2021-03-19 | 平安普惠企业管理有限公司 | Method, device and equipment for verifying mutual exclusion relationship of workflow and storage medium |
-
2009
- 2009-09-08 CN CN200910092802A patent/CN101650799A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104715328A (en) * | 2015-03-09 | 2015-06-17 | 山东科技大学 | Service process expansion method based on core processes |
| CN107038549A (en) * | 2016-02-04 | 2017-08-11 | 平安科技（深圳）有限公司 | The information processing method and device of group danger |
| CN110704697A (en) * | 2019-10-11 | 2020-01-17 | 山东科技大学 | Method for improving business process efficiency based on selection branch construction |
| CN110704697B (en) * | 2019-10-11 | 2022-02-18 | 山东科技大学 | Method for improving business process efficiency based on selection branch construction |
| CN112529543A (en) * | 2020-12-28 | 2021-03-19 | 平安普惠企业管理有限公司 | Method, device and equipment for verifying mutual exclusion relationship of workflow and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guimarães et al. | Modeling lotsizing and scheduling problems with sequence dependent setups | |
| Holzer | Are you talking to me? Why BIM alone is not the answer | |
| Barták et al. | New trends in constraint satisfaction, planning, and scheduling: a survey | |
| US20040260590A1 (en) | Automatic generation of process models | |
| US9594543B2 (en) | Activity diagram model-based system behavior simulation method | |
| CN101571810B (en) | Method for implementing program, method for verifying program result, devices and system | |
| CN101650799A (en) | Discovery method of mismatched interaction between operation flows | |
| CN100484140C (en) | Network working flow describing and verificating method driven normally | |
| CN104267654A (en) | Method and system for converting ladder diagram program into instruction list program and compiling instruction list program | |
| CN109936479A (en) | Control plane failure diagnostic system and its implementation based on Differential Detection | |
| CN102523155B (en) | Boost Graph library-based K shortest path searching method and system | |
| Ng et al. | Design for digital fabrication: An industry needs analysis of collaboration platforms and integrated management processes | |
| Ulrich et al. | Concurrent and comparative discrete event simulation | |
| CN102519476A (en) | Communication regulation treatment method based on composite crossing | |
| Liu et al. | Current trend in planning and scheduling of construction project using artificial in telligence | |
| CN110597194A (en) | Cooperative activity construction method of large-scale flexibly-driven automatic manufacturing system | |
| Guan et al. | An integrated design framework for virtual enterprise-based customer-oriented product-service systems | |
| CN102567845B (en) | Online migration method and equipment for running example during combined service evolution | |
| CN101256491A (en) | Method for definition of believable software process based on workflow | |
| CN111222793A (en) | Data interaction method and system | |
| Shanthi et al. | A heuristic technique for automated test cases generation from UML activity diagram | |
| Finkbeiner et al. | Global winning conditions in synthesis of distributed systems with causal memory (Full Version) | |
| Hecking-Harbusch | Synthesis of asynchronous distributed systems from global specifications | |
| Kathayat et al. | Analyzing realizability of choreographies using initiating and responding flows | |
| Lu et al. | A knowledge-based expert system for drilling station 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 | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20100217 |