CN106293648A - Services Composition behavior compliance measure based on Route Dependence figure - Google Patents

Services Composition behavior compliance measure based on Route Dependence figure Download PDF

Info

Publication number
CN106293648A
CN106293648A CN201510243933.8A CN201510243933A CN106293648A CN 106293648 A CN106293648 A CN 106293648A CN 201510243933 A CN201510243933 A CN 201510243933A CN 106293648 A CN106293648 A CN 106293648A
Authority
CN
China
Prior art keywords
movable
dependence
path
route
tdg
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510243933.8A
Other languages
Chinese (zh)
Other versions
CN106293648B (en
Inventor
宋巍
刘红玉
钱祥星
张学伟
黄青青
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Science and Technology
Original Assignee
Nanjing University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Science and Technology filed Critical Nanjing University of Science and Technology
Priority to CN201510243933.8A priority Critical patent/CN106293648B/en
Publication of CN106293648A publication Critical patent/CN106293648A/en
Application granted granted Critical
Publication of CN106293648B publication Critical patent/CN106293648B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Debugging And Monitoring (AREA)

Abstract

The invention discloses a kind of Services Composition behavior compliance measure based on Route Dependence figure, the Services Composition file described with DPNML form and the journal file of correspondence are input, with the behavior compliance degree of Services Composition for output result.For the compliance of measurement service combination, first, analyze DPNML file and the journal file of correspondence, generate the Route Dependence figure TDG (Trace Dependence Graph, TDG) inputting path in journal file;Then, utilize the reference path that heuristic rule search input path is corresponding, compliance metric question is converted into consistency of path problem;Finally according to the degree of consistency between input path and reference path, the compliance degree of measurement service combination.The method that the present invention proposes, the quantification compliance degree result being provided that between 0 to 1.For traditional method, method proposed by the invention is it appeared that the deviation of data stream, and emphasizes execution sequence between activity not too much, it is to avoid existing methods wrong report and failing to report.

Description

Services Composition behavior compliance measure based on Route Dependence figure
Technical field
The invention belongs to field of service calculation, specially the compliance measurement technology of Services Composition, i.e. quantification service Anabolic process example meets the technology of process stipulations degree.
Background technology
The appearance of the Internet and the universal running environment making computer software be faced from closing, static, controlled by Step moves towards open, dynamic, changeable.Along with the maturation of software application, service-oriented software architecture SOA (Service-Oriented Architecture) and software i.e. service the thought of (Software-as-a-service) also Start to be used by industry.Software development is no longer main to be programmed for, and is more the multiplexing of software service resource, The simplest atomic service the most no longer can meet increasingly sophisticated business demand.Thus, Services Composition skill Art is arisen at the historic moment.Services Composition is in a specific way by given application logic, combines the existing atomic service of layout, With the value-added service that offer is new.Under the network environment of New Complex, the credibility of Services Composition is faced with sternness Challenge.In some key areas, such as Aeronautics and Astronautics, bank service etc., the credibility of Services Composition seems More important.
Due to the feature such as the dynamic polytropy of software service under open environment so that judge that it credible become comparison and be stranded Difficult.In addition to traditional software verification, measuring technology, also to study for software trust under open environment Pass judgment on and measure, such as trust, reputation etc..In service-oriented framework, the process skill of data perception Art becomes the effective means realizing application and development based on service, and the system development of high-quality depends on high-quality Service process stipulations.But at real life, the execution of process instance often deviates the definition of process stipulations. In order to support management decision-making, manager needs process logs data to perform to understand business procedure, thus realizes industry The management of business process, improve, reproduce.A few thing is attempted using compliance measurement technology to judge log information Whether meet or meet in much degree the process model of previous definition.If not in full conformity with, also return is deviateed Information is for business personnel's reference.The relatively low reason of compliance depends on the purpose of model, if model is statement Formula, then the difference between model and daily record shows, this model needs to be improved, preferably to catch reality Existing;If model is authoritative, then this species diversity may be caused by two aspects, on the one hand due to Difference between realization and stipulations causes the generation of bad deviation, say, that service needs preferably to be controlled;Separately On the one hand, artificial deviation is also reason, and such as workman is in order to preferably serve customers, and has carried out engineering model Unforeseen activity.The compliance tolerance of Services Composition can helper applications engineering staff be weighed to a certain extent The credibility of software service system.
Compliance can be widely applied to the various aspects of software service, such as Service controll, secret protection etc.. Baumgrass et al. proposes a kind of method, for from access control based roles (RBAC) model Automatically generating linear time temporal logic statement, these statements can be used to detect the mistake by event execution journal record Whether Cheng Hangwei meets the access control policy by corresponding RBAC model definition.Similarly, Banescu etc. Privacy policy is joined in the constraint of process specification by people, is measured by compliance and detects privacy violation with this, Ensure service safe, and to the method elaborating to distinguish Departure type (unnecessary, substitute, out of order).Carlos Molina-Jimenez et al. proposes use business stipulations and represents the mode of contract terms, from system bottom message Middleware capture and process event log, assess the compliance of business contract with this.Raul Mazo et al. proposes Compliance measuring method of based on product line model (PLMs), in terms of semanteme, a product line model It is defined as the set of the derivative all product models of meta-model, uses constraint logic programming, establish one PLM compliance detection solution.
Compliance inspection has the most important in business procedure intelligence (BPI) and BAM (BAM) Status.In the information system of process apperception, owing to enterprise sometimes is in order to solve the unique need of they systems, Cause stipulations the most complicated, and easily can make us twisting, so that the process instance of reality often deviates it The process stipulations pre-defined, thus cause the behavior shown of event log and process model and differ Cause.Compliance analysis is i.e. to be analyzed the reason that generation behavior is inconsistent, and carries out departure degree respectively Calculate.Between process instance and process stipulations, compliance is two-way, and it includes two aspects, it may be assumed that observe Service realize whether meet process definition stipulations, and process definition stipulations whether can describe well The service observed realizes.
The compliance of Services Composition is analyzed by existing most methods from controlling stream angle, such as some sides Method compliance based on the traditional path equivalent concepts definition Services Composition in spectrum during linear branch, this kind of method Generally analyze the path bigger to liking granularity, for the independent paths in daily record, can only obtain one The qualitative analysis of individual "Yes" or "No", that is to say that the execution of Service Instance meets or do not meets process stipulations Definition, does not provide the matching degree of a quantification, can cause State-explosion problem simultaneously.It addition, one A little methods are using the less activity of the granularity in path as analyzing object such that it is able to provide the analysis knot of quantification Really.But these methods remain in control fluid layer face, and the deviation to data stream is insensitive, it is impossible to detect number Change the compliance degree caused to decline according to stream.They excessively emphasize execution sequence between activity simultaneously, the most deeply Constitutive relations between analytical activity.
Summary of the invention
It is an object of the invention to provide a kind of Services Composition behavior compliance tolerance side based on Route Dependence figure Method, the method achieves the function retrieved Services Composition, manage, safeguard and reuse.
The technical solution realizing the object of the invention is: a kind of Services Composition behavior based on Route Dependence figure is closed Rule property measure, the Services Composition described with DPNML form and the journal file of correspondence are input, with clothes The behavior compliance degree of business combination is output result;Step is as follows:
(1) Services Composition described with DPNML form and the journal file of correspondence are inputted, between analytical activity Three kinds of dependences, generate in journal file the Route Dependence figure TDG inputting path;
(2) heuritic approach that Kernel-based methods decomposes and track reappears, finds service group in polynomial time The reference path closed;
(3) by the analysis of the Route Dependence figure to input path and reference path, Services Composition is calculated Behavior compliance degree.
The present invention compared with prior art, its remarkable advantage: present invention path based on a kind of loose quantization is of equal value Concept, it is proposed that the Services Composition behavior compliance measure of a kind of quantification, the method is not only able to analyze Control the departure degree of stream, and can the departure degree of analytical data stream.Compared to traditional method, the present invention Institute's extracting method is the most flexible, will not excessively emphasize execution sequence between activity, is avoided that tradition track replay method can Some false negatives (false negtive) that can produce, thus back services example does not meets business procedure effectively Information content.
Accompanying drawing explanation
Fig. 1 is the overall flow figure of the present invention.
Fig. 2 is UML activity diagram.
Fig. 3 is two each self-corresponding TDG of the actual execution route of embodiment.
Fig. 4 is that business process model is decomposed into several subprocess not comprising choice structure.
Detailed description of the invention
The present invention has considered control dependence and the data dependence of Services Composition, it is proposed that a kind of new compliance Gauge and analysis method, be not only able to provide a scope from 0 to 1 quantitative analysis result, moreover it is possible to return The diagnostic message of relevant deviation.
Present invention Services Composition based on Route Dependence figure behavior compliance measure.Depend at service combination path Relying in figure (TDG), the constitutive relations between the log path activity of Services Composition includes that the relation that directly relies on is with only Vertical relation.Wherein, dependence includes controlling dependence and data dependence relation.One movable AjControl Depend on the movable A occurred before iti, and if only if movable AiDetermine movable AiCan perform.Data depend on Rely and be divided into three kinds: true data relies on, anti-data dependence, exports data dependence.One movable AjTrue data depends on Rely the movable A performed before iti, and if only if movable AjEmploy movable AiCertain variable of definition;One Individual movable AjThe movable A that anti-data dependence performed before iti, and if only if movable AjDefine movable AiInstitute Certain variable used;One movable AjThe movable A that output data dependence performed before iti, and if only if Movable AjRedefine movable AiCertain variable of definition.It should be noted that data dependence relation is permissible Directly obtained by execution sequence movable in analysis path and movable corresponding input and output, and control dependence Cannot, it is therefore desirable to from predefined business procedure, isolated controls dependence.
The present invention is exactly implementing the method measurement service combination behavior compliance proposed.Below in conjunction with The present invention will be further described for accompanying drawing.
Present invention Services Composition based on Route Dependence figure behavior compliance measure, its overall flow such as Fig. 1 Shown in.First, according to Services Composition and the journal file of correspondence of input, three kinds of dependences between analytical activity are closed System, generates the Route Dependence figure TDG inputting path in journal file;Then, Kernel-based methods decomposes and track The heuritic approach reappeared, finds the reference path of Services Composition;Finally, by input path and reference arm The analysis of the Route Dependence figure in footpath, calculates the behavior compliance degree of Services Composition.For meeting DPNML The Services Composition of pattern of the input, the present invention can parse all information included in it, including all types Activity and the title of activity, input and output, partner's link etc..
1. according to Services Composition and the journal file of correspondence, three kinds of dependences between analytical activity of input Generating the Route Dependence figure TDG inputting path in journal file, algorithm is as follows:
Algorithm 1: build path dependency graph TDG
Particularly may be divided into following steps:
1.1 initialization Defs (set of all defined variables) and Uses (set of all use variablees) are empty, All active junction points of traversal log path, add the active junction point collection N of Route Dependence figure to by activityTDGIn, Analyze the control dependence collection D obtaining between all active junction pointsc
1.2 add all true data dependence edges in Route Dependence figure TDG;Movable j in traversal execution route σ All input variable var ∈ inPut (σj) i.e. movable σiAll input variables, if movable j employs movable k The variable of definition, the variable of i.e. movable k belongs to defined variable set Defs, then will with movable k as starting point, Movable j is that the true data dependence edge of terminal adds in TDG, the input variable of movable j is added to simultaneously In used variables collection Uses;
1.3 add all anti-data dependence limits in Route Dependence figure TDG;Movable j in traversal execution route σ All output variable var ∈ outPut (σj) i.e. movable σiAll output variables, if movable j defines movable k The variable used, the variable of i.e. movable k belongs to use variables collection Uses, then will live with movable k as starting point Dynamic j is that the anti-data dependence limit of terminal is added in TDG, the output variable of movable j is added to simultaneously In Def (σ [j]);
1.4 add all output data dependence limits in Route Dependence figure TDG;Activity in traversal execution route σ All output variable var ∈ outPut (σ of jj), if movable j has redefined the variable of movable i definition, the most alive The variable of dynamic i belongs to defined variable set Defs, then will be with movable i as starting point, and movable j is the defeated of terminal Go out data dependence limit and add in TDG, the output variable of movable j is added in Def (σ [j]) simultaneously
1.5 repeat 1.2 to 1.4, until all activities in complete execution route σ of traversal;
1.6 traversal active junction point collection NTDGIf existing between movable i and movable j and controlling to rely on, i.e. its binary Relation belongs to control dependence collection Dc, then dependence edge will be controlled accordingly add to the dependence edge of Route Dependence figure Set ETDGIn;If there is not control between movable i and movable j to rely on, then without adding limit;
1.7 establish Route Dependence figure according to active junction points all in log path and the dependence between them The active junction point collection N of TDGTDGWith dependence edge collection ETDG
2. the heuritic approach that Kernel-based methods decomposes and track reappears, finds Services Composition in polynomial time Reference path, it specifically includes following steps:
Business process model is decomposed into several subprocess not comprising choice structure by 2.1;
2.2 determine the reference subprocess that reference path most possibly belongs to;
2.3 analyze input path, obtain the Route Dependence figure TDG of correspondence, delete in TDG and be not belonging to reference Activity in subprocess and relevant directed edge thereof;
2.4 methods reappeared based on track, find reference path in most possible subprocess;
Wherein, the method for step 2.2 is as follows:
For activities all in subprocess, in input path, movable proportion is the highest, and reference path more may belong to The subprocess that subprocess activity ratio shared by input path activity is the highest is belonged in this subprocess, i.e. reference path. Assume Sσ, SspIt is input path σ and the active set of subprocess sp respectively, if sp is with reference to subprocess, And if only if | Sσ∩Ssp|/|Ssp| value not less than other subprocess.
The algorithm of step 2.3 is as follows:
Algorithm 2: Route Dependence figure TDG simplifies
Specifically comprise the following steps that
2.3.1 the active set N being not belonging to subprocess active set is found in log pathd;
2.3.2 N is traveled throughdIn all movable ni, from the node set of Route Dependence figure, remove ni, and obtain niAll forerunner's nodes combine preSet and successor node set postSet, from Route Dependence figure, remove ni And its forerunner's node and follow-up limit between some, and add the limit obtained by preSet × postSet to road In the limit set of footpath dependency graph;
Following rule is taked to determine NdSet: input path σ is carried out pretreatment.If do not had with reference in subprocess Having loop structure, the repeatedly generation of same activity only can be produced by repeating misregistration in daily record.In order to eliminate weight Multiple, take following rule: assume Aj1And Aj2It is same movable AjTwice generation in log path, lives Dynamic Ai, AkIt is movable A respectivelyjDirect precursor in subprocess and immediate successor, index (A) is that movable A exists The numbering of execution sequence in the σ of path.If inequality index (Ai)<index(Aj), (index (Aj1), index(Aj2))<index(Ak) set up, then can eliminate A from input path σj1, Aj2In any one;As Really inequality is false, then eliminate and run counter to the activity with upper inequality.Then the activity in input path σ is analyzed Between dependence, obtain input path σ Route Dependence figure TDG.Owing to being not belonging to subprocess active set SspActivity cannot be at SspMiddle reproduction, needs to delete these movable and relevant directed edges in TDG, with Time ensure transitive dependency be not destroyed.
The algorithm of step 2.4 is as follows:
Algorithm 3: the reference path reappeared based on track is searched
Use heuristic rule shown in algorithm 3: if in Route Dependence figure TDG after simplification, a work Dynamic AiIn-degree be 0 and in current state M of subprocess spC(it is initially M0Enable under), then movable AiIt is chosen as under subprocess sp reappearing.Meanwhile, deletion activity A from TDGiWith with AiLimit for source. If there is no meeting the activity of conditions above, then select in current state MCOne subprocess sp of lower enable Movable AjReappear.If AjIt is set SσIn activity, then deletion activity A from TDGjOccur for the first time. Which kind of operation the most above-mentioned, all can make subprocess sp by current state MCBecome new state MC'。 Repeat above operation, until TDG is empty.If input path σ is a path being not fully complete Service Instance, Under subprocess sp reappear active sequences be exactly reference path.Otherwise, need from subprocess sp, take out Take one from current state to final state (with MfRepresent) active sequences trigger.In order to ensure σ2Be from Current state to final state (with MfRepresent) the shortest active sequences, for circulation, σ2It is not allow for back Regression is moved (with nbkRepresent).Now, the final reference path that input path is corresponding is σ1σ2
Analyze obtain between the two BPEL process inconsistent corresponding movable right, be then based on inputting path and Dependence and the set of independence in reference path, calculate the behavior compliance degree of Services Composition;Its Specifically include following steps:
3.1 Sdk) and Sik) respectively as path σkDependence and the set of independence, root in (k=1,2) According to dependence S between the activity in reference path and input pathdk) and independence Sik), use formula 1 calculates the degree of consistency between this two paths;
CD = | S d ( &sigma; 1 ) &cap; S d ( &sigma; 2 ) | + | S i ( &sigma; 1 ) &cap; S i ( &sigma; 2 ) | | S d ( &sigma; 1 ) &cup; S d ( &sigma; 2 ) | + | S i ( &sigma; 1 ) &cup; S i ( &sigma; 2 ) | - - - ( 1 )
3.2, according to each input path in event log and the degree of consistency of corresponding reference path, use public affairs Formula 2 calculates the behavior compliance degree of this Services Composition;
CD ( L , p ) = 1 n &Sigma; i = 1 n CD ( &sigma; i , p ) - - - ( 2 )
Below in conjunction with example, the present invention will be further described.
The example of the present invention comes from BPEL process Sample Storehouse (the Oracle BPEL of Oracle company Process Manager Samples Repository) a Services Composition example Marketplace, this example It is frequently used in some WS-BPEL study courses and research.Due to this business procedure XML format WS-BPEL code is longer, therefore represents this process by UML activity diagram, the most as shown in Figure 2. Relevant information has been explained in each activity, such as movable input/output variable and Xpath.
In order to measure the behavior compliance of this Services Composition, use following implementation:
1. according to Services Composition and the journal file of correspondence of input, three kinds of dependences between analytical activity, Generate the Route Dependence figure TDG inputting path in journal file;
Flow down controlling, this process contains only four can execution route, but opening, dynamically, uncontrollable In the environment of, the execution of process often deviates its definition.Assume to exist the actual execution of two process instances Path σ1=A1A2A3A4A7A6And σ2=A2A1A3A4A7, TDG corresponding to each of which respectively such as Fig. 3 (a) and Shown in Fig. 3 (b).For the ease of display, eliminate the label information on dependence edge.If there is another process The execution route σ of example3=A2A1A3A4A6A7, its TDG is with Fig. 3 (b) isomorphism, so according to definition Path σ1And σ3It is of equal value.
2. the heuritic approach that Kernel-based methods decomposes and track reappears, finds Services Composition in polynomial time Reference path.
Business process model is decomposed into several subprocess not comprising choice structure, such as Fig. 4 (b) (c) by 2.1 Shown in;
2.2 determine the reference subprocess that reference path most possibly belongs to.For input path σ1, Sσ1=Ssp1= {A1,A2,A3,A4,A6,A7, Ssp2={ A1,A2,A3,A5,A6,A7}.Due to | Sσ1∩Ssp1|/|Ssp1|=1 > |Sσ1∩Ssp2|/|Ssp2|=5/6.Therefore, under the heuristic rule of this chapter, reference path is considered to belong to subprocess Ssp1
2.3 analyze input path, obtain the Route Dependence figure TDG of correspondence, delete in TDG and be not belonging to reference Activity in subprocess and relevant directed edge thereof;
2.4 methods reappeared based on track, find reference path in most possible subprocess.For σ1's Process instance, based on Fig. 3 (a) σ1Route Dependence figure carry out path playback, at subprocess sp1In obtain reference Path σ1'=A1A2A3A4A6A7.Obviously, input path σ1With reference path σ1' of equal value.It follows that should Process instance meets business procedure Marketplace.
Similarly, for input path σ2, according to heuristic rule, determine that reference path most possibly belongs to son Process Ssp1, at subprocess Ssp1Lower playback path obtains corresponding reference path σ2'=A2A1A3A4A6A7.Reference Path σ2' TDG and σ1TDG isomorphism, as shown in Fig. 3 (a).Respectively by input path σ2And reference Path σ2' TDG, constitutive relations between analytical activity, obtain directly relying on set of relationship Sd2)={ < A1,A3>, <A2,A3>,<A3,A4>,<A4,A7>, Sd2')=Sd2)∪{<A4,A6>, independence set Si2)={ (A2,A1), Si2')=Si2)∪{(A6,A7)}.Defining according to this chapter, this process instance (is held Walking along the street footpath σ2) and business procedure Marketplace between compliance degree be CD (σ2, p)=5/7.Based on above knot Really, it appeared that execution route is σ2Process instance (qualitative not in full conformity with business procedure Marketplace Result), their compliance degree is 5/7 (quantitative result).

Claims (7)

1. a Services Composition behavior compliance measure based on Route Dependence figure, it is characterised in that concretely comprise the following steps:
(1) the Services Composition file described with DPNML form and the journal file of correspondence are input, and three kinds of dependences between analytical activity generate the Route Dependence figure TDG inputting path in journal file;
(2) heuritic approach that Kernel-based methods decomposes and track reappears, finds the reference path of Services Composition in polynomial time;
(3) by the analysis of the Route Dependence figure to input path and reference path, the behavior compliance degree of Services Composition is calculated.
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 1, it is characterized in that: in described step (1), article one, the Route Dependence figure TDG=(N of log path σ, E) it is a directed graph, wherein N active junction point set of all generations in being path σ, E is directed edge set between all activities in the σ of path;Article one, by the directed edge of activity a to movable b, there is control dependence or data dependence or asynchronous call dependence to movable b in expression activity a;In TDG, each the directed edge < a representing data dependence,A b > additional label var, represents that the variables set defined by movable a merges the variables collection used by movable b;In TDG, in choice structure, each represents that the directed edge controlling to rely on is labeled as " True " (" T ") or " False " (" F "), and represent that this directed edge is positioned in business process model choice structure true and false asserts;
Concretely comprising the following steps of structure Route Dependence figure:
1.1 initialization Defs (set of all defined variables) and Uses (set of all use variablees) are empty, all active junction points of traversal log path, and activity is added to the active junction point collection N of Route Dependence figureTDGIn, analyze the control dependence collection D obtaining between all active junction pointsc
1.2 add all true data dependence edges in Route Dependence figure TDG;The most movable all input variables of j of all input variables var ∈ inPut (j) of movable j in traversal execution route σ, if movable j employs the variable of movable k definition, the variable of i.e. movable k belongs to defined variable set Defs, then will be with movable k as starting point, movable j is that the true data dependence edge of terminal adds in TDG, the input variable of movable j is added in used variables collection Uses simultaneously;
1.3 add all anti-data dependence limits in Route Dependence figure TDG;The most movable all output variables of j of all output variables var ∈ outPut (j) of movable j in traversal execution route σ, if movable j defines the variable that movable k uses, the variable of i.e. movable k belongs to use variables collection Uses, then will be with movable k as starting point, movable j is that the anti-data dependence limit of terminal is added in TDG, adding in Def (σ [j]) by the output variable of movable j, Def (σ [j]) is the set of all variablees defined in movable j simultaneously;
1.4 add all output data dependence limits in Route Dependence figure TDG;All output variables var ∈ outPut (j) of movable j in traversal execution route σ, if movable j has redefined the variable of movable i definition, the variable of i.e. movable i belongs to defined variable set Defs, then will be with movable i as starting point, movable j is that the output data dependence limit of terminal is added in TDG, the output variable of movable j is added in Def (σ [j]) simultaneously;
1.5 repeat 1.2 to 1.4, until all activities in complete execution route σ of traversal;
1.6 traversal active junction point collection N, control to rely on if existed between movable i and movable j, i.e. its binary crelation belongs to control dependence collection Dc, then by the dependence edge set E controlling dependence edge accordingly and adding to Route Dependence figure;If there is not control between movable i and movable j to rely on, then without adding limit;
1.7 establish the active junction point collection N and dependence edge collection E of Route Dependence figure TDG according to active junction points all in log path and the dependence between them.
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 1, it is characterised in that: described step (2) specifically includes following steps:
The Services Composition file that DPNML form describes is decomposed into several subprocess not comprising choice structure by 2.1;
2.2 determine the reference subprocess that reference path most possibly belongs to, and its heuristic rule used is: reference path belongs to the subprocess that subprocess activity ratio shared by input path activity is the highest;
The Route Dependence figure TDG of the log path of 2.3 pairs of inputs, deletes in TDG and is not belonging to reference to the activity in subprocess and relevant directed edge thereof;
2.4 methods reappeared based on track, find reference path in most possible subprocess.
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 3, it is characterised in that: comprising the concrete steps that of described step 2.3:
2.3.1 the active set N being not belonging to subprocess active set is found in log pathd
2.3.2 N is traveled throughdIn all movable ni, from the node set of Route Dependence figure, remove ni, and obtain niAll forerunner's nodes combine preSet and successor node set postSet, from Route Dependence figure, remove niAnd its forerunner's node and follow-up limit between some, and the limit obtained by preSet × postSet is added in the limit set of Route Dependence figure.
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 4, it is characterised in that: described step 2.3.1 takes following rule to determine NdSet: assume Aj1And Aj2It is same movable AjTwice generation in log path, movable Ai, AkIt is movable A respectivelyjDirect precursor in subprocess and immediate successor, index (A) is movable A numbering of execution sequence in the σ of path;If inequality index (Ai)<index(Aj), (index (Aj1),index(Aj2))<index(Ak) set up, then can eliminate A from input path σj1, Aj2In any one;If inequality is false, then eliminates and run counter to the activity with upper inequality.
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 3, it is characterised in that: concretely comprising the following steps of described step 2.4:
2.4.1 initialization path σ1For sky, initializing zeroInNodes is that in Route Dependence figure TDG (N, E), all in-degrees are the activity of 0;
If 2.4.2 zeroInNodes non-NULL, for movable ni ∈ zeroInNodes and ni in subprocess sp, sp is input Services Composition process and does not comprise the subprocess of choice structure,
If 1. movable ni is in current state M of subprocess spCLower enable, is initially M0, then from zeroInNodes, leave out movable ni, and from TDG, leave out the limit between this activity and this activity and its all succeeding activities, if there being the in-degree of succeeding activity to become 0 after deleting limit, then the succeeding activity that in-degree becomes 0 adds in zeroInNodes;
If 2. movable ni is in current state M of subprocess spCUnder do not enable, from TDG, deletion activity ni occurs for the first time;
Above two operation all can make subprocess sp by current state MCBecome new state MC', ni is added to path σ1End;
2.4.3 2.4.2 operation is repeated until Route Dependence figure TDG is empty;
If 2.4.4 log path is a completed Service Instance path, then σ1It is exactly reference path;Otherwise from subprocess sp, extract the shortest active sequences σ from current state to final state2Trigger, for circulation, σ2Being not allow for rollback transition, final state is with MfRepresent;Now, the final reference path that input path is corresponding is σ1σ2
Services Composition behavior compliance measure based on Route Dependence figure the most according to claim 1, it is characterised in that: concretely comprising the following steps of described step (3):
3.1Sdk) and Sik) respectively as path σkDependence and the set of independence in (k=1,2), according to dependence S between the activity in reference path and input pathdk) and independence Sik), use formula 1 to calculate the degree of consistency between this two paths;
3.2, according to each input path in event log and the degree of consistency of corresponding reference path, use formula 2 to calculate the compliance degree between event log L and predefined business procedure p;
The bar number in path, σ during in formula 2, n represents event log LiRepresent the i-th paths in event log L.
CN201510243933.8A 2015-05-13 2015-05-13 Services Composition behavior compliance measure based on Route Dependence figure Expired - Fee Related CN106293648B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510243933.8A CN106293648B (en) 2015-05-13 2015-05-13 Services Composition behavior compliance measure based on Route Dependence figure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510243933.8A CN106293648B (en) 2015-05-13 2015-05-13 Services Composition behavior compliance measure based on Route Dependence figure

Publications (2)

Publication Number Publication Date
CN106293648A true CN106293648A (en) 2017-01-04
CN106293648B CN106293648B (en) 2019-11-29

Family

ID=57632293

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510243933.8A Expired - Fee Related CN106293648B (en) 2015-05-13 2015-05-13 Services Composition behavior compliance measure based on Route Dependence figure

Country Status (1)

Country Link
CN (1) CN106293648B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106909696A (en) * 2017-03-27 2017-06-30 浙江工业大学 A kind of colleges and universities' data assembled view automatic generation method based on data, services dependency graph
CN107239483A (en) * 2017-04-14 2017-10-10 浙江工业大学 A kind of cross-domain elevator data assembled view automatic generation method based on data, services
CN111192005A (en) * 2019-12-17 2020-05-22 腾讯云计算(北京)有限责任公司 Government affair service processing method and device, computer equipment and readable storage medium
US11243835B1 (en) 2020-12-03 2022-02-08 International Business Machines Corporation Message-based problem diagnosis and root cause analysis
US11403326B2 (en) 2020-12-03 2022-08-02 International Business Machines Corporation Message-based event grouping for a computing operation
US11474892B2 (en) 2020-12-03 2022-10-18 International Business Machines Corporation Graph-based log sequence anomaly detection and problem diagnosis
US11513930B2 (en) 2020-12-03 2022-11-29 International Business Machines Corporation Log-based status modeling and problem diagnosis for distributed applications
CN115431260A (en) * 2021-12-07 2022-12-06 北京航天飞行控制中心 Mechanical arm motion planning method and system based on virtual point state backtracking
US11599404B2 (en) 2020-12-03 2023-03-07 International Business Machines Corporation Correlation-based multi-source problem diagnosis
US11829766B2 (en) 2021-05-04 2023-11-28 International Business Machines Corporation Compliance enforcement via service discovery analytics
CN118034989A (en) * 2024-04-10 2024-05-14 中国民航大学 Log dependency graph construction method, electronic equipment and storage medium
US11995562B2 (en) 2020-12-03 2024-05-28 International Business Machines Corporation Integrating documentation knowledge with log mining for system diagnosis

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11797538B2 (en) 2020-12-03 2023-10-24 International Business Machines Corporation Message correlation extraction for mainframe operation

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070143795A1 (en) * 2005-12-20 2007-06-21 Duong-Han Tran Application trace for distributed systems environment
CN101715002A (en) * 2009-10-20 2010-05-26 清华大学 Semantic consistency verification method of semantic Web service combination
CN102255955A (en) * 2011-06-22 2011-11-23 浙江工商大学 Dynamic Web service combination method based on dependency relationship
CN102447735A (en) * 2011-11-09 2012-05-09 重庆大学 Reliability analyzing method for DAML-S (Darpa Agent Markup Language for Services) composite services
CN103150626A (en) * 2013-03-01 2013-06-12 南京理工大学 Program dependence graph-based BPEL (Business Process Execution Language) process consistency measurement method
CN103218692A (en) * 2013-04-27 2013-07-24 南京理工大学 Workflow excavating method based on inter-movement dependency relation analysis

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070143795A1 (en) * 2005-12-20 2007-06-21 Duong-Han Tran Application trace for distributed systems environment
CN101715002A (en) * 2009-10-20 2010-05-26 清华大学 Semantic consistency verification method of semantic Web service combination
CN102255955A (en) * 2011-06-22 2011-11-23 浙江工商大学 Dynamic Web service combination method based on dependency relationship
CN102447735A (en) * 2011-11-09 2012-05-09 重庆大学 Reliability analyzing method for DAML-S (Darpa Agent Markup Language for Services) composite services
CN103150626A (en) * 2013-03-01 2013-06-12 南京理工大学 Program dependence graph-based BPEL (Business Process Execution Language) process consistency measurement method
CN103218692A (en) * 2013-04-27 2013-07-24 南京理工大学 Workflow excavating method based on inter-movement dependency relation analysis

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A. ADRIANSYAH 等: ""Conformance checking using cost-based fitness analysis", 《2011 15TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE》 *
W. SONG 等: "Quantifying Consistency between Conceptual and Executable Business Processes", 《2013 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING》 *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106909696A (en) * 2017-03-27 2017-06-30 浙江工业大学 A kind of colleges and universities' data assembled view automatic generation method based on data, services dependency graph
CN106909696B (en) * 2017-03-27 2020-01-14 浙江工业大学 College data combined view automatic generation method based on data service dependency graph
CN107239483A (en) * 2017-04-14 2017-10-10 浙江工业大学 A kind of cross-domain elevator data assembled view automatic generation method based on data, services
CN107239483B (en) * 2017-04-14 2020-06-09 浙江工业大学 Cross-domain elevator data combined view automatic generation method based on data service
CN111192005A (en) * 2019-12-17 2020-05-22 腾讯云计算(北京)有限责任公司 Government affair service processing method and device, computer equipment and readable storage medium
CN111192005B (en) * 2019-12-17 2023-04-18 腾讯云计算(北京)有限责任公司 Government affair service processing method and device, computer equipment and readable storage medium
US11513930B2 (en) 2020-12-03 2022-11-29 International Business Machines Corporation Log-based status modeling and problem diagnosis for distributed applications
US11474892B2 (en) 2020-12-03 2022-10-18 International Business Machines Corporation Graph-based log sequence anomaly detection and problem diagnosis
US11403326B2 (en) 2020-12-03 2022-08-02 International Business Machines Corporation Message-based event grouping for a computing operation
US11599404B2 (en) 2020-12-03 2023-03-07 International Business Machines Corporation Correlation-based multi-source problem diagnosis
US11243835B1 (en) 2020-12-03 2022-02-08 International Business Machines Corporation Message-based problem diagnosis and root cause analysis
US11995562B2 (en) 2020-12-03 2024-05-28 International Business Machines Corporation Integrating documentation knowledge with log mining for system diagnosis
US11829766B2 (en) 2021-05-04 2023-11-28 International Business Machines Corporation Compliance enforcement via service discovery analytics
CN115431260A (en) * 2021-12-07 2022-12-06 北京航天飞行控制中心 Mechanical arm motion planning method and system based on virtual point state backtracking
CN118034989A (en) * 2024-04-10 2024-05-14 中国民航大学 Log dependency graph construction method, electronic equipment and storage medium
CN118034989B (en) * 2024-04-10 2024-07-19 中国民航大学 Log dependency graph construction method, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN106293648B (en) 2019-11-29

Similar Documents

Publication Publication Date Title
CN106293648A (en) Services Composition behavior compliance measure based on Route Dependence figure
Meneely et al. Predicting failures with developer networks and social network analysis
Viriyasitavat et al. Compliance checking for requirement-oriented service workflow interoperations
CN107066256B (en) Object change model modeling method based on tense
Le Hanh et al. Selecting an efficient OO integration testing strategy: an experimental comparison of actual strategies
Gudas Enterprise knowledge modelling: domains and aspects
WO2007124057A2 (en) Computer program generating
Li et al. Code-coverage guided prioritized test generation
Khalajzadeh et al. Bidaml: A suite of visual languages for supporting end-user data analytics
Han et al. FAME: A UML-based framework for modeling fuzzy self-adaptive software
Fox et al. Knowledge based simulation: an artificial intelligence approach to system modeling and automating the simulation life cycle
Ahmed et al. A comparison of three simulation methodologies for a Lean Six Sigma manufacturing project–a business case study
Liu et al. Cross‐Organization Emergency Response Process Mining: An Approach Based on Petri Nets
CN117436112A (en) User permission data processing method and device
Han et al. Integrating goal models and problem frames for requirements analysis of self-adaptive CPS
Rajabi et al. Change management framework to support UML diagrams changes.
Endo et al. Event tree algorithms to generate test sequences for composite Web services
Pinto et al. Maturity models for business continuity–A systematic literature review
Durán et al. Models and analysis for user-driven reconfiguration of rule-based IoT applications
Oukharijane et al. Self-adaptive business processes: a hybrid approach for the resolution of adaptation needs
Subburaj et al. Specifying security requirements in multi-agent systems using the descartes-agent specification language and AUML
Zimmermann et al. Enterprise architecture ontology for services computing
Ren et al. Active performance management in supply chains
Masuda et al. Direction of digital it and enterprise architecture
Hira et al. Preliminary causal discovery results with software effort estimation data

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20191129

CF01 Termination of patent right due to non-payment of annual fee