CN107748983A - Method is detected and corrected in a kind of compatibility of cooperation service process - Google Patents
Method is detected and corrected in a kind of compatibility of cooperation service process Download PDFInfo
- Publication number
- CN107748983A CN107748983A CN201710990869.9A CN201710990869A CN107748983A CN 107748983 A CN107748983 A CN 107748983A CN 201710990869 A CN201710990869 A CN 201710990869A CN 107748983 A CN107748983 A CN 107748983A
- Authority
- CN
- China
- Prior art keywords
- cooperation service
- service process
- business procedure
- compatibility
- cbp
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/101—Collaborative creation, e.g. joint development of products or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to business event coordination technique field, discloses a kind of compatibility of cooperation service process and method is detected and corrected, the present invention is modeled respectively based on inter-organizational workflows net to business procedure and cooperation service process；The incompatibility situation occurred for business procedure and cooperation service process proposes corresponding detection algorithm respectively；The incompatible cooperation service process detected can be modified.Purchasing process example of the present invention shows that this method can actually be modified to incompatible cooperation service process and finally give a good cooperation service process model for meeting compatibility；In the case where not changing local business procedure, original incompatible cooperation service process is modified, and be finally reached a kind of good cooperation service process model for meeting compatibility.
Description
Technical field
The invention belongs to business event coordination technique field, more particularly to a kind of cooperation service process compatibility detection and
Modification method.
Background technology
In the past, information system was designed to support the execution of individual task, and the focus of information system of today is no longer
It is task, but business procedure.Due to business process restructuring (BusinessProcessReengineering, BPR) and continue
Process, which improves concepts such as (ContinuousProcessImprovement, CPI), to be influenceed and is emerged by business procedure, people
The importance of business procedure is had become increasingly aware of, and present organization needs to provide broader product scope and service
The trend of sustainable growth, such as mortgage loan is presented in scope, the business procedure in tissue always, and only a small amount of decades ago is several
The pattern of lending of type, the now, there are various pattern of lending to select.More than substantial amounts of products ＆ services exist
Sustainable growth, and the life cycle of products ＆ services is similarly increasing, therefore, business procedure also constantly with vary,
Moreover, these business procedures are also by the considerably complicated of change, these changes of the information system inside institutional framework so that business mistake
Mono- critical problem for promoting information system development of Cheng Chengwei.
With the development of global economy and the continuous improvement of IT application in enterprises degree, the management mode of enterprise is weighed
Big change, the business activity independent development mode development that the monocular out of enterprise has been designated as being oriented to of enterprise turn into across the more mesh of enterprise
Mark the Cooperative Mode of cooperation.In recent years, as Internet turns into the calculating platform of main flow, especially service-oriented computing
The rapid rising of (Service-orientedComputing, SOC) so that the interaction between different tissues business procedure turns into can
Energy.Under modern commerce environment, neither one enterprise is self-existent, to realize common business goal, is each organized
Business procedure usually needs to cross over organizational boundary, and the business procedure with its hetero-organization interacts and cooperated, relatively steady to be formed
Fixed process view, so as to meet business demand.This complicated business procedure is referred to as cooperation service by academia and industrial quarters
Process.
Inter-organization synergetic business procedure is a complexity and the process easily to malfunction, therefore, in inter-organization synergetic business
, it is necessary to be modeled to inter-organization synergetic business procedure and Analysis of Compatibility before process combination business semantics come into operation, prevent
Only there is mistake in the cooperation service process of tissue and enterprise, will be difficult to estimate because now repairing the cost of mistake.Therefore,
Inter-organization synergetic business procedure is modeled, Analysis of Compatibility and solution the problems such as Compatibility Revision it is imperative.
Prior art：
In terms of Petri network：Document is based on the good structure in Workflow net, it is proposed that the concept of good structure is serviced, for letter
Change the verification condition of compatibility, the Analysis of Compatibility between service is reduced to only to verify that its composite services is from initial marking
It is no always to reach termination mark；Services Composition is described based on BPEL for document, further uses for reference colored Petri network pair
The Services Composition of BPEL descriptions is modeled, and uses the structured analysis technology of Petri network to compatible between composite services
Property is analyzed；Document is modeled based on Petri network to operation flow, and proposes a kind of Business Stream based on interaction conflict
Journey interoperability detection method, this method utilize the behavior restraint relation detection of complex operation flow interoperability between Local Interaction
Matching.Document by Petri network, existing cooperation relation business procedure unit draw by the semanteme based on cooperation point
Point, parallel modeling is carried out to across organization business process synergic using the thought of equivalent partition, experiment shows, passes through parallel modeling
Across organization business process synergic model can provide the compatibility verification efficiency of model, reduce the formal verification time.Document with
Based on Petri network, it is proposed that a kind of method divided and rule, to analyze the compatible of the Web service flow under time-constrain
Property, this method can not only effectively detect time-to-violation constraint in the case of the time state figure by generation module
Multiple Web service combinations, and also provide reliable and available service execution path to ensure that the success of user service is held
OK.Document is deposited to architectural characteristics such as constant based on siphon pipe, trap, S- plus mould S- invariants and based on solutions of state equations
Analyzed, have studied mutual between the unreachable mark that these methods can be determined that in the unreachable mark decision method of property
Relation, the taxonomic hierarchies of the unreachable mark of Petri network is established, pass through the incompatible of inter-organization synergetic business process model
State, detection illustrate to identify the application of unreachable decision method.
In terms of process algebra：Document proposes a kind of method based on distributed coordination model, and this method is by unsuccessfully etc.
The semantic projection rule kept of valency behavior, is modeled, and the Analysis of Compatibility of collaboration process is turned using CSP to collaboration process
The paired consistency checks to the cooperation sub-process under distribution are changed to, and further provide a kind of reviewing party based on adaptation
Method；Document is based on Pi calculations and cooperation service process is modeled, and the reduction rules calculated using Pi are business procedure
Interaction protocol has carried out yojan, to judge whether that interaction is abnormal；Document is based on Pi calculations and proposes a kind of Web service behavior phase
The qualitative judgement of capacitive and quantitative calculation method, this method first by algorithm automatically by Web service behavior and Web service it
Between interbehavior be expressed as Pi calculus process, then by Pi calculation operational semantics and formalization deduction realize service behavior
Compatibility automatically qualitatively judges, and then proposes that algorithm realizes Service Compatible on the basis of the process transformation theory of Pi calculations
Automatic theorem calculates.
In terms of automatic machine：Document is distinguishes the mismatch and deadlock of not specified reception, using label converting system to Web service
The behavior protocols of business are described, and propose a kind of mismatch type decision method based on the description, and this method can not only
Identify common mismatch type, and can also be distinguished by the judgement in the comparable path to combination not specified reception mismatch and
Deadlock；Document extends transaction semantics for Pi calculations, carves the action interaction between process is with across tissue film activity associated
Multi-service transaction coordination behavior is drawn, and existing model testing technology is inherited based on equivalent automaton conversion thinking, verifies multi-service
Whether affairs meet the various properties of people's needs.
In summary, the problem of prior art is present be：Present tissue and the cooperation service process of enterprise easily occur
Mistake, and the cost for repairing mistake will be difficult to estimate；Though above-mentioned work be using Petri network, process algebra or its
He is analyzed the compatibility of cooperation service process formal tool, all simply to whether meeting that compatibility is detected,
Or some verification methods, and the amendment side of a system is not proposed for the situation for being unsatisfactory for compatibility detected
Method.And the reason for this problem occur is, for incompatible in the case of detection can realize that and for amendment, then what is be related to arrives
Some can not accurately position in the case of complexity is special and be modified, such as two circulations, select branch etc..It is and our
Case but can be in the case where not changing local business procedure, can not only be to incompatible business procedure and cooperation service process
Detected, additionally it is possible to carry out system amendment for the situation for being unsatisfactory for compatibility detected.The realization of this technology will
It can be analyzed before the cooperation service process with enterprise is organized, prevent from malfunctioning, can be in execution for the mistake of appearance
Before detected and correspondingly corrected, this has effectively saved unnecessary reparation cost, substantially increases the industry of enterprise
The efficiency of the practice and quality of business process and cooperation service process
The content of the invention
The problem of existing for prior art, the invention provides a kind of compatibility of cooperation service process to be detected and corrected
Method.The present invention can not only detect incompatible business procedure and cooperation service process, moreover it is possible to not change local business
In the case of process, cooperation service process is modified.
The present invention is achieved in that a kind of compatibility of cooperation service process is detected and corrected method and includes following step
Suddenly：
First, business procedure and cooperation service process are modeled based on Petri network；By enterprise in the industry and tissue
Business procedure is abstracted into formalized model；
Then, the compatibility of business procedure and cooperation service process is defined, and provides corresponding business mistake respectively
Journey compatibility detection algorithm and cooperation service Process Compatibility detection algorithm；
Finally, using the purchasing process in reality as case, collaboration industry incompatible present in the purchasing process is detected
Business process, and repaired to carrying cooperation service process modification method；Purchasing process example shows that this method can actually be to not
Compatible cooperation service process is modified and finally gives a good cooperation service process model for meeting compatibility.
Further, the compatibility to business procedure and cooperation service process is defined, including：
Define 1：Carry out business procedure：
Extend basic petri net BP=(P, T, F, M, A, fm, i, o), wherein：
P：Limited place set is represented, andP=PM∪PG, the special place set of wherein PM expressions, i.e.,
Message place, PGRepresent common place set；
T：Limited transition set is represented, and
F：The flow relation in business procedure is represented, and
M：A referred to as state of business procedure, original state M0Represent, be designated as M0={ i }；
A：Represent semantic mark finite aggregate；
fm：PM→ A, it is mapping of the message place to semanteme mark, represents each message place pmAssociate a unique language
Justice mark a；
i,o：Two special places are represented, and i, o ∈ P, wherein place i represent initial storehouse institute,Place o is represented
Terminate place,
Define 2：Carry out cooperation service process：
Build two tuple CBP=(MBP, AC), wherein：
MBP：Represent the set of business procedure, i.e. MBP={ BP1, BP2..., BPn, wherein n >=2；
AC：Asynchronous communication set of relationship is represented, andWherein：
PMRepresent message place set；
TM=∪J ∈ { 1 ..., n }Tj, represent the transition set of business procedure participation communication activity during cooperation service；
Represent IP (TM) it is TMNonvoid subset；
Ac=<pij,Ti,Tj>(i ≠ j), wherein：
pijRepresent BPiMiddle message place piAnd BPjMiddle message place pjFusion so that BPiAnd BPjShared message place
pij；
TiAnd TjRepresent BPiAnd BPjIn with message place pijThe transition set of flow relation be present；
fm(pi)=fm(pj), represent place piWith place pjSemantic mark match, while be piAnd pjFuse into message
The precondition of place；
According to definition 2, two tuple formalized descriptions are：CBP=(MBP, AC), wherein：
MBP={ BP1, BP2}；
Wherein：
PM={ pm1,pm2,pm3}；
TM={ t11,t13,t14,t21,t22,t24}；
IP(TM) it is TMNonvoid subset.
In order to preferably analyze inter-organization synergetic business procedure and its compatibility be analyzed, cooperation service process is entered
Row expansion obtains cooperation service process expansion model, and provides definition.
3 are defined, cooperation service process is deployed, U (CBP)=(PU, TU, FU) be CBP expansion, wherein：
PU：PU=P* ∪ PM∪ { i, o }, wherein：
P*=∪J ∈ { 1 ..., n }BPj.P, represent cooperation service during business procedure place set；
PMRepresent message place set；
I is initial storehouse institute, for identifying the beginning of cooperation service process expansion model execution；
O is terminates place, for identifying the end of cooperation service process expansion model execution；
TU：TU=T* ∪ { ti, to } wherein：
T* represents the transition set of business procedure during cooperation service；
tiFor the starting transition of cooperation service process expansion model；
toFor the end transition of cooperation service process expansion model；
FU：FU=F*TMPMPMTM{(i,ti)}{(to,o)}{(ti,BPj.i)}{(BPj.o,to), wherein：F* represents collaboration
The flow relation set of business procedure in business procedure；
According to definition 3, the cooperation service process model formalized description for expansion is：U (CBP)=(PU, TU, FU), its
In：
PU=P* ∪ PM ∪ { i, o }, wherein：
P*={ p11,p12,p21,p22,p23,p24}；
PM={ pm1,pm2,pm3}；
I is initial storehouse institute；
O is end place；
TU=T* ∪ { ti,toWherein：
T*={ t11,t12,t13,t14,t21,t22,t23,t24}；
tiChanged for starting；
toTo terminate to change；
FU={ (i, ti),(ti,i1),(ti,i2),(i1,t11),(t11,p11),(p11,t13),(t12,p12),(t13,p12),
(p12,t14),(t14,o1),(o1,to),(to,o),(i2,t21),(t21,pm1),(pm1,t11),(t21,p21),(t21,p22),
(p21,t22),(p22,t23),(t23,p23),(t22,p24),(p24,t24),(p23,t24),(t24,pm3),(t13,pm2),(pm2,
t22),(t24,o2),(o2,to)}；
4 are defined, rule occurs for transition, if U (CBP)=(PU, TU, FU) it is the expansion of a cooperation service process, and have
Rule occurs for following transition：
For changing t ∈ T, ifThen say that transition t has concession under state M, be designated as M [t>；
If M [t>, then under state M, transition t can occur, and transition t, which occurs, from state M obtains a new state M ',
It is designated as M [t>M ' is rightMeet：
M ' (p)=M (p) -1, if p ∈ t-t；
M ' (p)=M (p)+1, if p ∈ t-t；
M ' (p)=M (p), other；
5 are defined, Reachability state set, if U (CBP)=(PU, TU, FU) be a cooperation service process expansion, wherein M0∈
M is U (CBP) original state；U's (CBP) reaches state set R (M0) it is defined as the minimal set that meets following two condition：
M0∈R(M0)；
If M ∈ R (M0), and transition t ∈ T be present and cause M [t>M ', then M ' ∈ R (M0)；
6 are defined, reachability graph, if U (CBP)=(PU, TU, FU) be a cooperation service process expansion, U's (CBP) is reachable
Figure is defined as a triple RG [U (CBP)]=(R (M0), B, R), wherein：
B={ (Mi,Mj)|Mi,Mj∈ R (M0), andSo that Mi[tk>Mj}；
R：B → T, R (Mi,Mj)=tk, and if only if Mi[tk>Mj。
Further, in the cooperation service Process Compatibility detection method, each business procedure for participating in collaboration is carried out
Analysis, under conditions of local each business procedure meets compatibility, further inter-organization synergetic business procedure is carried out global
The Analysis of Compatibility of sight；Provide the definition of business procedure compatibility and cooperation service Process Compatibility；Specially：
Definition 7, business procedure compatibility, business procedure BP=(P, T, F, M, PM, A, fm, i, o) be it is compatible, when and only
When：Represent to each state M reached from original state i；
8 are defined, cooperation service Process Compatibility, cooperation service process CBP=(MBP, AC) is compatible, and and if only if
CBP meets that part is compatible and global compatible, wherein：
Locally compatible each BP referred in CBP meets business procedure compatibility to CBP；
Global compatible expansion U (CBP)=(PU, TU, the FU) for referring to CBP of CBP meets business procedure compatibility.
Further, the cooperation service Process Compatibility detection method specifically includes：
The business procedure compatibility detection algorithm of algorithm 1；
By all transition T in business procedure BP=(P, T, F, M, PM, A, fm, i, o) before the detection of business procedure compatibility
In place P set deposit stack, and flow relation F is represented with next, true represents that the business procedure is compatible, and false is represented
The business procedure is incompatible；
Initial storehouse institute i is pressed into stack first；Then, when stack does not enter While searching loops for space-time algorithm, in algorithm
In traversal, stack top element s is stored with S, when stack top element is closure element s and not end place o, end time
Go through, export false；If not occurring closure element in stack and all elements can be pressed into stack by the traversal, export
true；
Algorithm 2, it is cooperation service Process Compatibility detection algorithm,
First the set of all transition T and place P in cooperation service CBP=(MBP, AC) are stored in before algorithm performs
In stack, and flow relation F is represented with next, and initialize the initial storehouse institute I of cooperation service process and terminate place O, starting
Change ti and terminate transition to；
True represents that the business procedure is compatible, and false then represents that the business procedure is incompatible；
Initial storehouse institute and starting transition are connected first, terminates place and terminates to change, and traversal is each to participate in cooperation service mistake
The business procedure of journey, algorithm 1 is called, detects whether incompatible business procedure be present, if output false be present, in the absence of then
Export true.
Advantages of the present invention and good effect are：The present invention is based on inter-organizational workflows net to business procedure and cooperation service
Process is modeled respectively；The incompatibility situation occurred for business procedure and cooperation service process proposes accordingly respectively
Detection algorithm；The incompatible cooperation service process detected can be modified.Purchasing process example shows that this method is certain
Incompatible cooperation service process can be modified and finally give a good cooperation service process for meeting compatibility
Model；In the case where not changing local business procedure, original incompatible cooperation service process is modified, and finally reaches
To a kind of good cooperation service process model for meeting compatibility.
The present invention by modification method, improve the accuracy of cooperation service process, greatly reduce unnecessary reparation
Manpower, material resources and financial resources in cost；Accuracy brings up to 98.56% or so by the 92.35% of prior art.
Brief description of the drawings
Fig. 1 is that method flow diagram is detected and corrected in the compatibility of cooperation service process provided in an embodiment of the present invention.
Fig. 2 is cooperation service process schematic provided in an embodiment of the present invention.
Fig. 3 is cooperation service process expanded view provided in an embodiment of the present invention.
Fig. 4 is that method block diagram is detected and corrected in cooperation service Process Compatibility provided in an embodiment of the present invention.
Fig. 5 is the purchasing process figure that four participants provided in an embodiment of the present invention are formed.
Fig. 6 is the business process graph of four participants provided in an embodiment of the present invention.
Fig. 7 is the cooperation service process expanded view of four participants provided in an embodiment of the present invention.
Fig. 8 is the reachability graph of four participant's business procedures provided in an embodiment of the present invention.
Fig. 9 is compatible reachable track (part) figure provided in an embodiment of the present invention.
Figure 10 is incompatible reachable track (part) figure provided in an embodiment of the present invention.
Figure 11 is four participant's cooperation service procedure charts after excavation provided in an embodiment of the present invention.
Figure 12 is the cooperation service procedure chart of revised four participants provided in an embodiment of the present invention.
Figure 13 is the cooperation service process expanded view of revised four participants provided in an embodiment of the present invention.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
Method is detected and corrected in the compatibility of cooperation service process provided in an embodiment of the present invention, based on inter-organizational workflows
Net is modeled respectively to business procedure and cooperation service process；Occur for business procedure and cooperation service process incompatible
Implementations propose corresponding detection algorithm respectively；The incompatible cooperation service process detected can be modified.
The application principle of the present invention is further described below in conjunction with the accompanying drawings.
As shown in figure 1, the compatibility of present invention offer cooperation service process is detected and corrected method and comprised the following steps：
S101:Business procedure and cooperation service process are modeled based on Petri network；
S102:The compatibility of business procedure and cooperation service process is defined, and sets forth corresponding detection
Algorithm；
S103:Using the purchasing process in reality as case, collaboration industry incompatible present in the purchasing process is detected
Business process, and corrected.
Cooperation service process modeling approach provided in an embodiment of the present invention is as follows：
The concept of Petri network is in his thesis for the doctorate in 1962 by Germany scientist CarlAdamPetri
Itd is proposed first in " KommunikationmitAutomaten ".Because Petri network has Formal Semantic, intuitively figure table
Show, the display of state represents and the advantages such as a large amount of ripe analysis tools is supported, at present, Petri network is in computer science skill
The science and technology field such as art, automation science and technology is widely used.Therefore, in line with the characteristics of Petri network and advantage,
Use for reference the Workflow net (Workflownet, WF-net) that is proposed based on Petri network of professor Aalst and towards across organization and administration
The inter-organizational workflows net (InterorganizationalWorkflows, IOWF) of proposition, to business procedure and cooperation service
Process is modeled.
(1) model is summarized
Relation during cooperation service between the business procedure of each tissue forms cooperation service process as shown in Figure 2
Model：The execution of task in organization internal and the conversion of state constitute a business procedure, between different business procedures
Communication activity is carried out by message place, constitutes cooperation service process.
(2) business procedure
Business procedure is used to build as unit minimum, reusable in structure inter-organization synergetic business process model
The operation flow of one organization internal of mould, represent the description of relation between all activities and activity in the tissue.
Define basic petri net BP=(P, T, F, M, A, the f that 1 (business procedure) business procedure is an extensionm, i, o),
Wherein：
P：Limited place set is represented, andP=PM∪PG, the special place set of wherein PM expressions, i.e.,
Message place, PGRepresent common place set.
T：Limited transition set is represented, and
F：The flow relation in business procedure is represented, and
M：A referred to as state of business procedure, original state M0Represent, be designated as M0={ i }；
A：Represent semantic mark finite aggregate；
fm：PM→ A, it is mapping of the message place to semanteme mark, represents each message place pmAssociate a unique language
Justice mark a；
i,o：Two special places are represented, and i, o ∈ P, wherein place i represent initial storehouse institute, i.e.,Place o tables
Show end place, i.e.,
If new transition t* to the BP of increase, for connecting initial storehouse institute i and terminating place o (t*={ o } ∧ t*=
{ i }), then at this moment the BP of gained is strong continune.
In defining 1, each transition in BP represent a specific task of organization internal；Flow relation is used for representing
The order performed in tissue between task and task；The running status of task is by the Tokken distribution situation expression in tissue, i.e. shape
State M, forOnly without Tokken and containing only 1 Tokken both of these case in p, if containing 1 Tokken in p, p ∈ M,
OtherwiseBP.P is designated as the place in BP, and the transition in BP are designated as BP.T, and the flow relation in BP is designated as
Initial storehouse institute in BP.F, BP is designated as BP.i, and the end place in BP is designated as BP.o.
(3) cooperation service process
When the business activity of enterprise is no longer limited to when being designated as the business procedure being oriented to monocular of inside, the demand of enterprise
The often organizational boundaries of beyond tradition, at this time, inter-organization synergetic business procedure are arisen at the historic moment, different based on message communicating
The cooperation service process that constitutes is interacted between organization business process, cooperation service process is defined as follows.
2 (cooperation service process) cooperation service processes of definition are a two tuple CBP=(MBP, AC), wherein：
MBP：Represent the set of business procedure, i.e. MBP={ BP1, BP2..., BPn, wherein n >=2；
AC：Asynchronous communication set of relationship is represented, andWherein：
PMRepresent message place set；
TM=∪J ∈ { 1 ..., n }Tj, represent the transition set of business procedure participation communication activity during cooperation service；
Represent IP (TM) it is TMNonvoid subset.
Ac=<pij,Ti,Tj>(i ≠ j), wherein：
pijRepresent BPiMiddle message place piAnd BPjMiddle message place pjFusion so that BPiAnd BPjShared message place
pij；
TiAnd TjRepresent BPiAnd BPjIn with message place pijThe transition set of flow relation be present；
fm(pi)=fm(pj), represent place piWith place pjSemantic mark match, and piAnd pjIt can fuse into and disappear
Cease the precondition of place.
According to define 2, Fig. 2 can using formalized description as：CBP=(MBP, AC), wherein：
MBP={ BP1, BP2}；
Wherein：
PM={ pm1,pm2,pm3}；
TM={ t11,t13,t14,t21,t22,t24}；
IP(TM) it is TMNonvoid subset.
In order to preferably analyze inter-organization synergetic business procedure and its compatibility be analyzed, cooperation service process is entered
Row expansion obtains cooperation service process expansion model and is illustrated in fig. 3 shown below, and provides definition.
Define 3 (expansion of cooperation service process) U (CBP)=(PU, TU, FU) be CBP expansion, wherein：
PU：PU=P* ∪ PM∪ { i, o }, wherein：
P*=∪J ∈ { l ..., n }BPj.P, represent cooperation service during business procedure place set；
PMRepresent message place set；
I is initial storehouse institute, for identifying the beginning of cooperation service process expansion model execution；
O is terminates place, for identifying the end of cooperation service process expansion model execution.
TU：TU=T* ∪ { ti, to } wherein：
T* represents the transition set of business procedure during cooperation service；
tiFor the starting transition of cooperation service process expansion model；
toFor the end transition of cooperation service process expansion model.
FU：FU=F*TMPMPMTM{(i,ti)}{(to,o)}{(ti,BPj.i)}{(BPj.o,to), wherein：F* represents collaboration
The flow relation set of business procedure in business procedure.
According to defining 3, for the cooperation service process model that deploys in Fig. 3 can formalized description be：U (CBP)=(PU,
TU, FU), wherein：
PU=P* ∪ PM ∪ { i, o }, wherein：
P*={ p11,p12,p21,p22,p23,p24}；
PM={ pm1,pm2,pm3}；
I is initial storehouse institute；
O is end place.
TU=T* ∪ { ti,toWherein：
T*={ t11,t12,t13,t14,t21,t22,t23,t24}；
tiChanged for starting；
toTo terminate to change.
FU={ (i, ti),(ti,i1),(ti,i2),(i1,t11),(t11,p11),(p11,t13),(t12,p12),(t13,p12),
(p12,t14),(t14,o1),(o1,to),(to,o),(i2,t21),(t21,pm1),(pm1,t11),(t21,p21),(t21,p22),
(p21,t22),(p22,t23),(t23,p23),(t22,p24),(p24,t24),(p23,t24),(t24,pm3),(t13,pm2),(pm2,
t22),(t24,o2),(o2,to)}
It can be seen from the formalized description of cooperation service process expansion model, start to change t by increasediBecome with end
Move toWith the beginning place of local business procedure and terminating place and linking together, meanwhile, add global initial storehouse institute i and complete
Office terminates place o and changes t respectively at startingiT is changed with endoIt is connected, has finally given cooperation service process expansion model.
Asynchronous communication relation passes through semantic identity map to message place PM.Inter-organization synergetic is distinguished by the color classification to transition
Whether the transition in business procedure have asynchronous communication relation, related to be represented with the transition of black, unallied white
Transition represent.
It can be seen from document, cooperation service process CBP=(MBP, AC) expansion U (CBP)=(PU, TU, FU) it is a WF-
net.Therefore, the business procedure in the present invention and cooperation service process expansion model are all based on the expansion of basic petri nets, therefore
The transition generation rule of basic petri nets can be used for reference and the theory of reachability graph is entered to model firing rule herein and reachability graph
Row definition.
Define 4 (rule occurs for transition) and set U (CBP)=(PU, TU, FU) it is the expansion of a cooperation service process, and have
Rule occurs for following transition：
For changing t ∈ T, ifThen say that transition t has concession under state M, be designated as M [t>.
If M [t>, then under state M, transition t can occur, and transition t, which occurs, from state M obtains a new state M ',
It is designated as M [t>M ' is rightMeet：
M ' (p)=M (p) -1, if p ∈ t-t；
M ' (p)=M (p)+1, if p ∈ t-t；
M ' (p)=M (p), other.
In order to portray the reachability graph of cooperation service process expansion model, facilitate what the amendment of cooperation service Process Compatibility worked
Smoothly perform, provide Reachability state set and the definition of reachability graph.
Define 5 (Reachability state sets) and set U (CBP)=(PU, TU, FU) be a cooperation service process expansion, wherein M0∈
M is U (CBP) original state.U (CBP) Reachability state set R (M0) it is defined as the minimal set that meets following two condition：
M0∈R(M0)；
If M ∈ R (M0), and transition t ∈ T be present and cause M [t>M ', then M ' ∈ R (M0)。
Define 6 (reachability graphs) and set U (CBP)=(PU, TU, FU) be a cooperation service process expansion, U's (CBP) is reachable
Figure is defined as a triple RG [U (CBP)]=(R (M0), B, R), wherein：
B={ (Mi,Mj)|Mi,Mj∈ R (M0), andSo that Mi[tk>Mj}；
R：B → T, R (Mi,Mj)=tk, and if only if Mi[tk>Mj。
Cooperation service Process Compatibility detection method provided by the invention is as follows：
During cooperation service, the interaction for multiple business procedures that cooperating process is related to, therefore, it is necessary to first to each
The business procedure for participating in collaboration is analyzed, further right under conditions of ensureing that local each business procedure meets compatibility
Inter-organization synergetic business procedure carries out the Analysis of Compatibility of global sight.By using for reference professor Aalst in the literature on reasonability
Definition, provide the definition of business procedure compatibility and cooperation service Process Compatibility.
Define 7 (business procedure compatibility) business procedure BP=(P, T, F, M, PM, A, fm, i, o) be it is compatible, when
And if only if：Represent to each state M reachable from original state i, certainly exist one
Tokken in generation sequence from M to state o, i.e. initial storehouse institute i, it can always be terminated by being transitted towards to reach in place o.In order to
Automatically whether compatibility detects can be met to business procedure, based on depth-first search (DepthFirstSearch,
DFS it is as follows) to propose a kind of business procedure compatibility detection algorithm.
The business procedure compatibility detection algorithm of algorithm 1：
Input：BP=(P, T, F, M, PM, A, fm, i, o), all P (transition) and T (place) members in BP are stored with stack
Element .next represent F (flow relation)；
Define 8 (cooperation service Process Compatibility) cooperation service process CBP=(MBP, AC) be it is compatible, when and only
When CBP meet it is local compatible and global compatible, wherein：
Locally compatible each BP referred in CBP meets business procedure compatibility to CBP；
Global compatible expansion U (CBP)=(PU, TU, the FU) for referring to CBP of CBP meets business procedure compatibility.
It can be seen from defining 8, the compatibility of cooperation service process not only includes the local industry for forming cooperation service process
The compatibility of business process, further comprises the compatibility for the cooperation service process that multiple local business procedure interactions are formed, and algorithm 2 is right
The detection algorithm process of cooperation service Process Compatibility used herein is described,
The cooperation service Process Compatibility detection algorithm of algorithm 2
Input：CBP=(MBP, AC), all P (transition) and T (place) element in CBP are stored with stack .next represents F
(flow relation), initialize the initial storehouse institute I of cooperation service process and terminate place O, starting transition tiT is changed with endo；
Output：true；False//true represents that the cooperation service process is compatible, and false then represents incompatible.
Output：true；False//true represents that the cooperation service process is compatible, and false then represents incompatible.
Begin：
I.next=ti and O.next=to//connection initial storehouse institute and starting change, and terminate place and terminate to change；
For i from 1to n do//traversal each participates in the business procedure of cooperation service process：
If detect (BPi)==false Then//if there is incompatible business procedure；Detect () function is
Algorithm 1,
Return false//return false simultaneously terminates to travel through；
End If；
End for；
Return detect (CBP) // calling detect function pair cooperation service processes CBP is detected and is returned to knot
Fruit；
End。
Cooperation service Process Compatibility modification method provided in an embodiment of the present invention is as follows：
The Research Thinking that method is detected and corrected in inter-organization synergetic business procedure compatibility is substantially as shown in Figure 4.
The inventive method is divided into 3 processes：Inter-organization synergetic Service process modeling；Cooperation service Process Compatibility detects；
Cooperation service Process Compatibility amendment.First, inter-organization synergetic business procedure is built using Petri network as formal tool
Mould；Then, the compatibility of business procedure and cooperation service process is defined and provides detection algorithm respectively；It is finally collaboration
The amendment of business procedure compatibility.The cooperation service Process Compatibility side of being detected and corrected carried herein is will be apparent from below
Method.
It is extended, elaborates based on the purchasing process case that the present invention will be formed by four participants in document
How inter-enterprises collaboration business procedure compatibility to be modified in the case where not changing enterprise's part business procedure herein
Method.
The execution flow of the purchasing process of Fig. 5 displayings is as follows：Client submits order to give agent's (step 1), and agent receives
To after order, credit record (step 2) to bank's requesting query client and to supplier's requesting query inventory information (step
4), if customers' credit record well (step 3), and stockpile number (step 5) enough, then agent sends branch to client
Request (step 7) is paid, client completes (step 8) after paying, and agent notifies supplier's delivery (step 9), and supplier receives fortune
Cargo transport is given to client's (step 10) after defeated request, after client receives goods, is sent confirmation message and is given agent's (step
12) merchandised with supplier's (step 11), completion.Pay attention to：In above-mentioned purchasing process, client can cancel before order payment
Transaction；In addition, agent, before payment request is sent to client, can also Cancel Transaction (step 6), the example is no non-true
The situation of qualitative selection and circulation.
By the analysis to above-mentioned case, according to defining 1 business procedure that can obtain four participants as shown in fig. 6,
As space is limited, it is as follows to the wherein the most complicated agential formalized description of business procedure：
Business procedure is agential to be described as follows：
BPagency=(P, T, F, M, A, fm, i, o),
P：P={ Start, Pa1, Pa2, Pa3, Pa4, Pa5, Pa6, Pa7, Pm3,Pm4,Pm5,Pm6,Pm7,Pm8,Pm9,Pm10,
Pm11,End}；
T：T={ ta1,ta2,ta3,ta4,ta5,ta6,ta7,ta8}；
F：F={ (Start, ta1),(Pm3,ta1),(ta1,Pa1),(ta1,Pa2),(Pa1,ta2),(Pa2,ta3),(ta2,Pm4),
(ta2,Pa3),(ta3,Pm5),(ta3,Pa4),(Pa3,ta4),(Pa4,ta4),(Pm6,ta4),(Pm7,ta4),(ta4,Pa5),(Pa5,
ta5),(ta5,End),(Pa5,ta6),(ta6,Pm8),(ta6,Pa6),(Pa6,ta7),(ta7,Pa7),(ta7,Pm9),(ta7,Pm10),
(Pa7,ta8),(ta8,Pm11),(ta8,End)}；
M：M0={ Start }；
A：A={ processorder, creditquery, stockquery, judgedeal (credit), judgedeal
(stock),sendpay,processpay,notifyship,receiveconfirmation}；
fm：fm(Pm3)={ processorder },
fm(Pm4)={ creditquery }, fm(Pm5)={ stockquery }, fm(Pm6)={ judgedeal
(credit)},
fm(Pm7)={ judgedeal (stock) }, fm(Pm8)={ sendpay },
fm(Pm9)={ processpay },
fm(Pm10)={ notifyship },
fm(Pm11)={ receiveconfirmation }；
i：I={ Start }；
o：O={ End }.
Marked by analyzing the semantic of interaction and message place of four participant's business procedures in whole purchasing process
Whether knowledge matches, and as follows according to the formalized description for defining the 2 cooperation service processes that can obtain four participants：
CBPPurchase=(MBP, AC), wherein：
MBP：MBP={ BPbank,BPagency,BPsupplier,BPcustomer}；
AC：AC=<Pm12m3,tc1,ta1>,<Pm4m2,ta2,tb1>,<Pm5m18,tc3,ts1>,<Pm1m6,tb1,ta4>,<Pm17m7,
ts1,ta4>,<Pm9m19,ta7,ts2>,<Pm8m13,ta6,tc3>,<Pm14m10,tc5,ta7>,<Pm16m11,tc6,ta8>,<Pm15m20,tc6,
ts3>}。
The definition 3 deployed according to cooperation service process can obtain the model of four participant's cooperation service processes expansion such as
Shown in Fig. 7, its formalized description is as follows：
U(CBPPurchase)=(PU, TU, FU), wherein：
PU：PU={ PStart,PEnd,Pa,Pa1,Pa2,Pa3,Pa4,Pa5,Pa6,Pa7,Pa8,Pb,Pb1,Pc,Pc1,Pc2,Pc3,Pc4,
Pc5,Ps,Ps1,Ps2,Ps3,Pm12m3,Pm4m2,Pm1m6,Pm5m18,Pm17m7,Pm8m13,Pm14m10,Pm16m11,Pm15m20}；
TU：TU={ TStart,TEnd,Ta1,Ta2,Ta3,Ta4,Ta5,Ta6,Ta7,Ta8,Ts1,Ts2,Ts3,Tc1,Tc2,Tc3,Tc4,
Tc5,Tc6,Tc7,Tb1}；
FU：FU={ (PStart,TStart),(TStart,Pa),(TStart,Pb),(TStart,Pc),(TStart,Ps),(Pa,ta1),
(ta1,Pa1),(ta1,Pa2),(Pa1,ta2),(Pa2,ta3),(ta2,Pa3),(ta3,Pa4),(Pa3,ta4),(Pa4,ta4),(ta4,
Pa5),(Pa5,ta5),(Pa5,ta6),(ta6,Pa6),(Pa6,ta7),(Pa7,ta8),(ta8,Pa8),(ta5,Pa8),(Pa8,TEnd),
(Pb,tb1),(tb1,Pb1),(Pb1,TEnd),(Pc,tc1),(tc1,Pc1),(Pc1,tc2),(Pc1,tc3),(tc3,Pc2),(Pc2,tc4),
(Pc2,tc5),(tc5,Pc3),(Pc3,tc6),(tc6,Pc4),(Pc4,tc7),(tc7,Pc5),(tc2,Pc5),(tc4,Pc5),(Pc5,
TEnd),(Ps,ts1),(ts1,Ps1),(Ps1,ts2),(ts2,Ps2),(Ps2,ts3),(ts3,Ps3),(Ps3,TEnd),(TEnd,PEnd),
(tc1,Pm12m3),(Pm12m3,ta1),(ta2,Pm4m2),(Pm4m2,tb1),(tb1,Pm1m6),(Pm1m6,ta4),(ta3,Pm5m18),
(Pm5m18,ts1),(ts1,Pm17m7),(ta7,Pm9m19),(Pm9m19,ts2),(ta6,Pm8m13),(Pm8m13,tc3),(tc5,Pm14m10),
(Pm14m10,ta7),(tc6,Pm16m11),(Pm16m11,ta8),(tc6,Pm15m20),(Pm15m20,ts3)}。
The reachability graph of algorithm 1 and four participant's business procedures carries out detection to Fig. 6 and can determine that, four in purchasing process
The business procedure of participant meets compatibility, and the business procedure reachability graph of four participants is illustrated in fig. 8 shown below.
Knowable to being detected using algorithm 2 to the expansion of the cooperation service process of four participants in Fig. 7, in purchasing process
In example, the cooperation service process expansion that the interaction of four participant's business procedures is formed is unsatisfactory for compatibility, i.e., this four
The cooperation service process of individual participant needs to correct.By Petri network simulation tool PIPE (Platform Independent
Petri Net Editor) simulation understand, the reachability graph of the cooperation service process of four participants is excessively complicated, up to 48 dimension
State Transferring, as space is limited, no longer list herein, performing analysis by the transition of the cooperation service process to four participants can
Must meet that compatibility defines from initial storehouse institute (PStart) to all institutes of reachable track below figure 9 for terminating place (PEnd)
Show, one shares 198.
Simultaneously as four participant's cooperation service processes are unsatisfactory for compatibility, so certainly existing from initial storehouse institute
(PStart) set out, but terminate the incompatible reachable track that place is not PEnd, share 102, be illustrated in fig. 10 shown below.
Compatible 102 that are unsatisfactory for during four participant's cooperation services are rejected up to track, it is compatible to meeting
Property 198 up to tracks extracted and according to excavate extensible markup language (Ming eXtensible Markup
Language, MXML) standard and extensible markup language (eXtensible Markup Language, XML) grammer will
The compatible reachable track of extraction is converted into the document of expansible time stream (eXtensible Event Stream, XES) form.
ProM is one and increases income and ripe process model mining platform, can be in http:Under //www.processmining.org
Carry, four participant's cooperation service processes are excavated based on the α algorithms that professor Aalst proposes in the platform herein, obtained
Four participant's cooperation service process such as Figure 11；
Cooperation service process and respective business procedure with reference to four participants after excavation, are obtained by revised
The cooperation service process of four participants is unfolded as follows shown in Figure 12.
As shown in figure 12, for appear in figure shaped like<ta1,t1>Symbol represent synchronizer, effect be so that four
Transition t in the local business procedure of individual participanta1With the transition t during cooperation service1Between meet synchronized relation, pass through
Knowable to algorithm 1 and algorithm 2 are detected to the cooperation service process of revised four participants, four participant's part business
Process meets compatibility respectively, and revised cooperation service process equally meets compatibility.
Based on synchronized relation, to meeting that the transition of synchronized relation fuse, the association of revised four participants is obtained
Deploy with business procedure, be illustrated in fig. 13 shown below.
The expansion of the cooperation service process of revised four participants is detected using algorithm 2 and understood, four participate in
The expansion of person's cooperation service process equally also meets compatibility, i.e., in the case where not changing local business procedure, to not phase originally
The cooperation service process of appearance is modified the cooperation service process for being finally reached a kind of good four participants for meeting compatibility
Model.
For the consistency problem in inter-organization synergetic business procedure, Most scholars are mainly from cooperation service mistake at present
The compatibility detection method of journey is analyzed, and the analysis of the modification method for cooperation service process in the case of incompatible, still
Belong to rarely seen.Therefore, the present invention combines Petri network and the correlation theory of process model mining, it is proposed that a kind of inter-organization synergetic business mistake
Method is detected and corrected in the compatibility of journey.It is main as follows：
Business procedure and cooperation service process are modeled based on the basic petri net of extension；
The compatibility of business procedure and cooperation service process is defined, and sets forth corresponding detection algorithm；
Illustrated using the purchasing process in reality as case, for collaboration industry incompatible present in the purchasing process
Business process, it is modified by Petri network and process model mining technology.
As a result show, in the case where not changing local business procedure, original incompatible cooperation service process is carried out
Amendment is finally reached a kind of good cooperation service process model for meeting compatibility.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
All any modification, equivalent and improvement made within refreshing and principle etc., should be included in the scope of the protection.
Claims (4)
1. method is detected and corrected in a kind of compatibility of cooperation service process, it is characterised in that the phase of the cooperation service process
Method, which is detected and corrected, in capacitive includes：
First, business procedure and cooperation service process are modeled based on Petri network；By enterprise in the industry and the business of tissue
Procedural abstraction is melted into formalized model；
Then, the compatibility of business procedure and cooperation service process is defined, and provides corresponding business procedure phase respectively
Capacitive detection algorithm and cooperation service Process Compatibility detection algorithm；
Finally, cooperation service process incompatible present in purchasing process is detected, and is corrected.
2. method is detected and corrected in the compatibility of cooperation service process as claimed in claim 1, it is characterised in that described to industry
The compatibility of business process and cooperation service process is defined, including：
1)：Business procedure：
Extend basic petri net BP=(P, T, F, M, A, fm, i, o), wherein：
P：Limited place set is represented, andP=PM∪PG, the special place set of wherein PM expressions, i.e. message
Place, PGRepresent common place set；
T：Limited transition set is represented, and
F：The flow relation in business procedure is represented, and
M：A referred to as state of business procedure, original state M0Represent, be designated as M0={ i }；
A：Represent semantic mark finite aggregate；
fm：PM→ A, it is mapping of the message place to semanteme mark, represents each message place pmThe unique semantic mark of association one
Know a；
i,o：Two special places are represented, and i, o ∈ P, wherein place i represent initial storehouse institute,Place o represents to terminate
Place,
2)：Cooperation service process：
Build two tuple CBP=(MBP, AC), wherein：
MBP：Represent the set of business procedure, i.e. MBP={ BP1, BP2..., BPn, wherein n >=2；
AC：Asynchronous communication set of relationship is represented, andWherein：
PMRepresent message place set；
TM=∪J ∈ { 1 ..., n }Tj, represent the transition set of business procedure participation communication activity during cooperation service；
Represent IP (TM) it is TMNonvoid subset；
Wherein：
pijRepresent BPiMiddle message place piAnd BPjMiddle message place pjFusion so that BPiAnd BPjShared message place pij；
TiAnd TjRepresent BPiAnd BPjIn with message place pijThe transition set of flow relation be present；
fm(pi)=fm(pj), represent place piWith place pjSemantic mark match, while be piAnd pjFuse into message place
Precondition；
According to 2), two tuple formalized descriptions are：CBP=(MBP, AC), wherein：
MBP={ BP1, BP2}；
Wherein：
PM={ pm1,pm2,pm3}；
TM={ t11,t13,t14,t21,t22,t24}；
IP(TM) it is TMNonvoid subset；
3), cooperation service process is deployed, U (CBP)=(PU, TU, FU) be CBP expansion, wherein：
PU：PU=P* ∪ PM∪ { i, o }, wherein：
P*=∪J ∈ { 1 ..., n }BPj.P, represent cooperation service during business procedure place set；
PMRepresent message place set；
I is initial storehouse institute, for identifying the beginning of cooperation service process expansion model execution；
O is terminates place, for identifying the end of cooperation service process expansion model execution；
TU：TU=T* ∪ { ti, to } wherein：
T* represents the transition set of business procedure during cooperation service；
tiFor the starting transition of cooperation service process expansion model；
toFor the end transition of cooperation service process expansion model；
FU：FU=F*TMPMPMTM{(i,ti)}{(to,o)}{(ti,BPj.i)}{(BPj.o,to), wherein：F* represents cooperation service
During business procedure flow relation set；
According to 3), the cooperation service process model formalized description for expansion is：U (CBP)=(PU, TU, FU), wherein：
PU=P* ∪ PM ∪ { i, o }, wherein：
P*={ p11,p12,p21,p22,p23,p24}；
PM={ pm1,pm2,pm3}；
I is initial storehouse institute；
O is end place；
TU=T* ∪ { ti,toWherein：
T*={ t11,t12,t13,t14,t21,t22,t23,t24}；
tiChanged for starting；
toTo terminate to change；
FU={ (i, ti),(ti,i1),(ti,i2),(i1,t11),(t11,p11),(p11,t13),(t12,p12),(t13,p12),(p12,
t14),(t14,o1),(o1,to),(to,o),(i2,t21),(t21,pm1),(pm1,t11),(t21,p21),(t21,p22),(p21,
t22),(p22,t23),(t23,p23),(t22,p24),(p24,t24),(p23,t24),(t24,pm3),(t13,pm2),(pm2,t22),
(t24,o2),(o2,to)}；
4), rule occurs for transition, if U (CBP)=(PU, TU, FU) it is the expansion of a cooperation service process, and there are following changes
Move generation rule：
For changing t ∈ T, ifThen say that transition t has concession under state M, be designated as M [t>；
If M [t>, then under state M, transition t can occur, and transition t, which occurs, from state M obtains a new state M ', is designated as M
[t>M ' is rightMeet：
M ' (p)=M (p) -1, if p ∈ t-t；
M ' (p)=M (p)+1, if p ∈ t-t；
M ' (p)=M (p), other；
5), Reachability state set, if U (CBP)=(PU, TU, FU) be a cooperation service process expansion, wherein M0∈ M are U
(CBP) original state；U's (CBP) reaches state set R (M0) it is defined as the minimal set that meets following two condition：
M0∈R(M0)；
If M ∈ R (M0), and transition t ∈ T be present and cause M [t>M ', then M ' ∈ R (M0)；
6), reachability graph, if U (CBP)=(PU, TU, FU) be a cooperation service process expansion, U (CBP) reachability graph definition
For a triple RG [U (CBP)]=(R (M0), B, R), wherein：
B={ (Mi,Mj)|Mi,Mj∈ R (M0), andSo that Mi[tk>Mj}；
R：B → T, R (Mi,Mj)=tk, and if only if Mi[tk>Mj。
3. method is detected and corrected in the compatibility of cooperation service process as claimed in claim 1, it is characterised in that the collaboration
In business procedure compatibility detection method, each business procedure for participating in collaboration is analyzed, in local each business procedure
Under conditions of meeting compatibility, the Analysis of Compatibility of global sight is further carried out to inter-organization synergetic business procedure；Provide business
The definition of Process Compatibility and cooperation service Process Compatibility；Specially：
7), business procedure compatibility, business procedure BP=(P, T, F, M, PM, A, fm, i, o) and it is compatible, and if only if：Represent to each state M reached from original state i；
8), cooperation service Process Compatibility, cooperation service process CBP=(MBP, AC) is compatible, and if only if CBP satisfactions office
Portion is compatible and global compatible, wherein：
Locally compatible each BP referred in CBP meets business procedure compatibility to CBP；
Global compatible expansion U (CBP)=(PU, TU, the FU) for referring to CBP of CBP meets business procedure compatibility.
4. method is detected and corrected in the compatibility of cooperation service process as claimed in claim 3, it is characterised in that the collaboration
Business procedure compatibility detection method specifically includes：
Algorithm 1, business procedure compatibility detection algorithm：
By all transition T in business procedure BP=(P, T, F, M, PM, A, fm, i, o) and storehouse before the detection of business procedure compatibility
In institute P set deposit stack, and flow relation F is represented with next, true represents that the business procedure is compatible, and false represents the industry
Business process is incompatible；
Initial storehouse institute i is pressed into stack first；Then, when stack does not enter While searching loops for space-time algorithm, in algorithm traversal
In, stack top element s is stored with S, when stack top element is closure element s and not end place o, terminates traversal,
Export false；If not occurring closure element in stack and all elements can be pressed into stack by the traversal, export
true；
Algorithm 2, it is cooperation service Process Compatibility detection algorithm,
The set of all transition T and place P in cooperation service CBP=(MBP, AC) are first stored in stack before algorithm performs
In, and flow relation F is represented with next, and initialize the initial storehouse institute I of cooperation service process and terminate place O, starting becomes
Move ti and terminate transition to；
True represents that the business procedure is compatible, and false then represents that the business procedure is incompatible；
Connect initial storehouse institute and starting first to change, end place and end change, and travel through and each participate in cooperation service process
Business procedure, algorithm 1 is called, detects whether incompatible business procedure be present, if output false be present, in the absence of then exporting
true。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710990869.9A CN107748983A (en) | 2017-10-23 | 2017-10-23 | Method is detected and corrected in a kind of compatibility of cooperation service process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710990869.9A CN107748983A (en) | 2017-10-23 | 2017-10-23 | Method is detected and corrected in a kind of compatibility of cooperation service process |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107748983A true CN107748983A (en) | 2018-03-02 |
Family
ID=61253025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710990869.9A Pending CN107748983A (en) | 2017-10-23 | 2017-10-23 | Method is detected and corrected in a kind of compatibility of cooperation service process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107748983A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110334907A (en) * | 2019-06-03 | 2019-10-15 | 武汉大学 | A kind of calamity emergency task combined method based on workflow |
| CN116881017A (en) * | 2023-07-27 | 2023-10-13 | 中国人民解放军陆军工程大学 | Collaborative virtual maintenance training system and method |
| CN116894650A (en) * | 2023-06-05 | 2023-10-17 | 云南大学 | Multi-tissue collaborative process construction method in electronic commerce environment with privacy protection |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021642A (en) * | 2016-05-05 | 2016-10-12 | 山东科技大学 | Reachable identification based process model repairing method |
-
2017
- 2017-10-23 CN CN201710990869.9A patent/CN107748983A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021642A (en) * | 2016-05-05 | 2016-10-12 | 山东科技大学 | Reachable identification based process model repairing method |
Non-Patent Citations (2)
| Title |
|---|
| YANHUA DU 等: ""Timed Compatibility Analysis of Web Service Composition: A Modular Approach Based on Petri Nets"", 《IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERIN 》 * |
| 郑明 等: ""协同业务过程的相容性检测及修正"", 《计算机科学与探索》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110334907A (en) * | 2019-06-03 | 2019-10-15 | 武汉大学 | A kind of calamity emergency task combined method based on workflow |
| CN116894650A (en) * | 2023-06-05 | 2023-10-17 | 云南大学 | Multi-tissue collaborative process construction method in electronic commerce environment with privacy protection |
| CN116881017A (en) * | 2023-07-27 | 2023-10-13 | 中国人民解放军陆军工程大学 | Collaborative virtual maintenance training system and method |
| CN116881017B (en) * | 2023-07-27 | 2024-05-28 | 中国人民解放军陆军工程大学 | Collaborative virtual maintenance training system and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qader et al. | Industry 4.0 enables supply chain resilience and supply chain performance | |
| US8521570B2 (en) | Integration of distributed business process models | |
| Reijers et al. | Improved model management with aggregated business process models | |
| CN106228446B (en) | Transaction in assets plateform system and method based on privately owned block chain | |
| van der Aalst | Intra-and inter-organizational process mining: Discovering processes within and between organizations | |
| CN101370015B (en) | service request processing method and system | |
| Zhang et al. | Branch and price for chance-constrained bin packing | |
| CN109643415A (en) | Trade management technology | |
| CN107748983A (en) | Method is detected and corrected in a kind of compatibility of cooperation service process | |
| Van Zee et al. | Formalizing enterprise architecture decision models using integrity constraints | |
| Yoon et al. | A distributed framework for reliable and efficient service choreographies | |
| Briol | BPMN, the Business Process Modeling Notation Pocket Handbook | |
| Khaluf et al. | Pattern-based modeling and formalizing of business process quality constraints | |
| Zlatev et al. | Consistency between e 3-value models and activity diagrams in a multi-perspective development method | |
| Huergo et al. | A method to identify services using master data and artifact-centric modeling approach | |
| da Silva et al. | Interaction protocols for cross-organisational workflows | |
| Schrödl | Adoption of cloud computing in supply chain management solutions: a SCOR-Aligned assessment | |
| Khudori et al. | Quality evaluation of EPC to BPMN business process model transformation | |
| CN111612330A (en) | Service mode quantitative evaluation method for cross-boundary service | |
| Sun et al. | TiCoBTx-Net: A model to manage temporal consistency of service-oriented business collaboration | |
| Roelens et al. | Towards a strategy-oriented value modeling language: Identifying strategic elements of the VDML meta-model | |
| Hunka et al. | A new view of REA state machine | |
| António et al. | Adapting the i* framework for software product lines | |
| CN110322346A (en) | A kind of condition that supporting uxto model can set method of payment and system | |
| Bodenstaff et al. | MaDe4IC: an abstract method for managing model dependencies in inter-organizational cooperations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180302 |
|
| RJ01 | Rejection of invention patent application after publication |