CN104516719B - BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token - Google Patents

BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token Download PDF

Info

Publication number
CN104516719B
CN104516719B CN201410784693.8A CN201410784693A CN104516719B CN 104516719 B CN104516719 B CN 104516719B CN 201410784693 A CN201410784693 A CN 201410784693A CN 104516719 B CN104516719 B CN 104516719B
Authority
CN
China
Prior art keywords
bpel
token
activity
support
programming
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.)
Active
Application number
CN201410784693.8A
Other languages
Chinese (zh)
Other versions
CN104516719A (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
Original Assignee
Nanjing University
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 filed Critical Nanjing University
Priority to CN201410784693.8A priority Critical patent/CN104516719B/en
Publication of CN104516719A publication Critical patent/CN104516719A/en
Application granted granted Critical
Publication of CN104516719B publication Critical patent/CN104516719B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on a token. The business process execution language BPEL is a programming language which faces a process and supports Web service integration, and has a plurality of support concurrency programming properties, such as flow, link, event handler, and asynchronous calling. However, almost current aspect-oriented programming (AOP) BPEL extension method is lack of the support of the concurrency in aspect definition so that aspects related to concurrency control cannot be conveniently and simply expressed. The BPEL extension realization method for supporting the concurrency aspect programming based on the token, disclosed by the invention, mainly comprises: (1) an aspect programming language model for supporting the concurrency based on the token; the aspect and an original program are concurrently executed, and synchronization is realized by obtaining and releasing; (2) an aspect definition legality verification algorithm based on a Petri network; (3) a BPEL execution engine for supporting aspect dynamic weaving based on ODE.

Description

A kind of BPEL extension implementation methods of the concurrent side programming of the support based on token
Technical field
The present invention relates to the extension realization to the programming of BPEL aspect-orienteds, more particularly to side and BPEL original workflows Concurrently and collaboration capabilities, propose a kind of new aspect-oriented programming language model for this, and it is in addition real to extend ODE engines It is existing.
Background technology
BPEL (BPEL) is to perform language by the integrated standard of the Web service of OASIS propositions.It is one It is processor-oriented to support the integrated programming language of Web service, the language by Oracle, IBM, Apache etc. extensively support with Build Services Oriented Achitecture (SOA).On the one hand with other procedure-orienteds (POP) and the programming language of object-oriented (OOP) Speech is similar, such as debugs, daily record in BPEL, safety, and the non-functional requirement such as business rules can not well from major function point Separate out and.Aspect-oriented software development (AOSD) is well-known solution.It is many as simultaneously in another aspect BPEL language Send out branch (flow), control connection (link), event handling (event handler), asynchronous call (asynchronous ) etc. invoke support the characteristic of concurrency programming, it is desirable to which the extension of its aspect-oriented needs correspondingly concurrent support, so as to letter Clean effectively expressing is related to the side of con current control.
Aspect-oriented programming language model mainly includes pointcut-advice models, the sensitive side mould of history at present Type (EAOP), supports concurrent facet model (CEAOP), interval facet model (region aspect).The pointcut- Advice models allow side at one group by logical relation, wildcard, the operation in the original program that regular expression is elected (pointcut) before, the original execution for operating is performed, or replace afterwards.The model is that traditional AOP language models are wide General application.The sensitive facet model of the history considers historical execution information, will operate abstract for event, it is allowed to which side one is Row event is execution after a perform track.It is described to support that concurrent facet model is carrying for the sensitive facet model of history Rise, it have modified weaving strategy, it is allowed to separates from original program and concurrently performs with original program in side.The interval side mould Type propose Regioncut mechanism codes more than two rows is packaged together to be formed one it is interval, such that it is able to select one section of company Continuous code is used as insertion point.
The extension of BPEL aspect-orienteds mainly has AO4BPEL and two kinds of Padus at present.AO4BPEL adopts dynamic weaving side Formula is applied to traditional pointcut-advice models on BPEL language, and side can be movable at the one of BPEL (activity) before, original movable execution is performed, or replace afterwards.Padus is by the way of static braiding by history Sensitive facet model is applied on BPEL language, it is allowed to add arbitrary legal BPEL elements in former workflow.
The extension of the language model and BPEL aspect-orienteds of above-mentioned aspect-oriented is made a general survey of, BPEL sides can not be fully met Face is concurrently performed in unison with demand with original program.The demand that is concurrently performed in unison with includes at 3 points:
1st, side should be concurrently performed with source program and other sides.
2nd, side can be merged with original program before the certain point in original program with the wish of developer.
3rd, side can be with source program cooperative cooperating.
For this purpose, we have proposed a kind of BPEL extension implementation methods of the concurrent side programming of support based on token.
The content of the invention
Goal of the invention:The extension of BPEL aspect-orienteds programming (AOP) lacks to concurrent support, and this causes to be related to concurrently control The side of system can not facilitate succinct expressing.The present invention proposes a kind of concurrent side of support based on token based on this problem The BPEL extension implementation methods of face programming.
Technical scheme:A kind of BPEL extension implementation methods of the concurrent side programming of the support based on token, including such as bottom Point:
1) the concurrent side programming language model of a kind of support based on token;
2) side based on Petri network defines legitimate verification algorithm;
3) a BPEL enforcement engine based on the support side dynamic weaving of ODE.
The concurrent side programming language model of support based on token, be different from traditional AOP language models to operate (side Method is called, the access to class members) minimum unit that defines as insertion point (join point).Before the model will be operated Put the minimum unit that condition and postcondition are defined as insertion point.One is defined with a four-tuple (Pre, Post, T, N) Side.Wherein Pre is precondition, and Post is postcondition, and T is one group of activity in BPEL for advice, N be skip or Proceed indicates whether to perform the activity of correlation in former workflow.T and BPEL workflows are concurrently performed, preposition by obtaining Condition token and release postcondition token complete synchronization.Precondition defines the opportunity that T brings into operation, and postcondition is then advised The condition that T is merged into original program is determined.It is Petri network by workflow modeling, when in former workflow Pre, all of place was all once There is token, T brings into operation;The token that transition after Post need T execution end releases extra can just be continued executing with.The language The partial ordering relation formal definitions that the semanteme of model is changed by Petri network.So as to reach the extension for supporting BPEL aspect-orienteds simultaneously Send out and collaborative demand.
In the language model be not the combination of arbitrary precondition and postcondition be all legal.The collaboration of side Cooperation can not be produced with the dependence in original program and be conflicted.Definition for this side needs to meet related constraint rule, institute Stating constraint rule mainly has four, and the verification algorithm is according to this four constrained designs and realization.
The constraint rule includes:
Rule 1:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled in normal Flow process, event handling, between error handling processing and compensation deals.
Rule 2:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled in circulation It is inside and outside.
Rule 3:One side CTA=(Pre, Post, T, proceed/skip) can not be produced with the dependence of original program Raw conflict.
Rule 4:One side CTA=(Pre, Post, T, skip), precondition Pre are represented with postcondition Post It must be one interval.
The BPEL enforcement engines of the support side dynamic weaving based on ODE enter to used BPEL enforcement engines ODE Row extension, the engine introduce Aspect compilers and side are compiled.Introduce Aspect running environment, control original program and side The execution in face.So as to realize the cooperative cooperating of side and original program.
The compiler compiling input is side file (.aspect), and related wsdl document, and the wsdl document is side In face, institute's called Web service describes file.Editing machine is fixed according to BPEL activities in the definition of input validation side and side first Whether justice is legal.Side file is compiled as into the access of OAspect Java objects if legal.OAspect is comprising corresponding The objects such as OAdivce, OPrecondition, OPostcondition, skip and attribute.OAdvice is inherited in ODE engines OProcess describes side activity.
Aspect running environment is introduced, the Aspect running environment contains aspect deployment modules, workflow status Monitoring module, Aspect synchronous operation management modules.The aspect deployment modules are used for disposing side;The workflow status Monitoring module monitors the operation shape of BPEL workflow instance OProcess by the BPEL run time events monitor that ODE is provided State;It is relative that the Aspect synchronous operations management module blocks side postcondition when side OAspect preconditions meet The execution of activity is answered, and performs side respective activity, after the completion of side activity is performed, cancelled obstruction activity before blocking, make Which continues executing with.If the skip attributes of side OAspect are true (being defaulted as false), need to skip execution in preposition bar Activity between part and postcondition, so that realize the cooperative cooperating of side and original program.
Beneficial effect:Compared with prior art, the BPEL of the concurrent side programming of the support based on token that the present invention is provided Extension implementation method, supports the side of BPEL aspect-orienteds programming and the concurrent and collaboration capabilities of former workflow.
Description of the drawings
Fig. 1 is that the Petri network of basic activity in BPEL workflows is semantic;
Fig. 2 is that the Petri network of structured activities in BPEL workflows is semantic;
Fig. 3 is that the Petri network of the concurrent aspect-oriented programming language model of support based on partial ordering relation is semantic;
Fig. 4 is in BPEL workflows, add the Petri network of typical side semantic;
Fig. 5 is that the side based on Petri network defines legitimate verification algorithm;
Fig. 6 is the framework of the BPEL enforcement engines of the support side dynamic weaving based on ODE;
Fig. 7 is the demand that travel agent services use case and its three sides;
Fig. 8 is that XML descriptions in side represent grammer;
Fig. 9 is the side definition that travel agent services three side demands.
Specific embodiment
With reference to specific embodiment, the present invention is further elucidated, it should be understood that these embodiments are merely to illustrate the present invention Rather than the scope of the present invention is limited, and after the present invention has been read, various equivalences of the those skilled in the art to the present invention The modification of form falls within the application claims limited range.
1st, the concurrent side programming language model of support based on token
In order to preferably describe and verify the language model of BPEL aspect-orienteds programming, BPEL workflow modelings are by we Petri network.In BPEL, for an activity (activity), activity has two types, basic activity and structuring for an operation Activity, basic activity represent atomic operation, such as:Invoke, calls web services;receive:Receive message;reply: Send message;assign:To variable assignments.Structured activities are used for combining other activities, such as:Sequence, defines one Sequential organization;If, defines a branched structure;While, defines a loop structure;Flow, defines a concurrent structure.Fig. 1 Show that the Petri network of basic activity is semantic, the left side (dotted portion) is it is shown that the deadlock path based on BPEL eliminates (DPE) And the semanteme of movable X is skipped, the right (realizing part) is it is shown that semanteme under activity X normal flows.Wherein rx(“ready”) The state that expression activity X brings into operation, fxThe state of (" finish ") expression activity X end of runs, other places and transition are retouched State the internal conversion of movable X.Other activities are combined by structured activities with certain dependence, and its Petri network is semantic The dependence between living is essentially described, as shown in Figure 2.
We can see that basic activity and structured activities have r from Fig. 1 and Fig. 2x(" ready ") and fx (" finish ") the two places represent a movable beginning and end state.Each movable rx(" ready ") and fx (" finish ") place is namely based on the insertion point of the concurrent side programming language model of support of token.
A side is defined with four-tuple CTA=(Pre, Post, T, N).The semanteme of the four-tuple is become by Petri network The partial ordering relation formal definitions for moving.In CTA, N for the semanteme of proceed is:
Wherein → (" happened before ") defines the partial ordering relation between transition.I (p) represents the unique of place p Input transition, O (p) represent unique output transition of place p.Fig. 3 has shown two preconditions and two postconditions In the case of tangent plane Petri network it is semantic, in Petri network → O → expression " happened before " relation.In CTA, N is The semanteme of skip is similar to therewith, and difference is that movable T will replace the activity execution between precondition and postcondition.It has Very strict constraint is meaningful to guarantee " activity between precondition and postcondition ".CTA=(Pre, Post, T, proceed) equally also there is corresponding constraint.
When in former workflow Pre, all of place all once had token, T brings into operation;Transition after Post need T to hold Row terminates the extra token of release and can just continue executing with.So as to reach, the extension for supporting BPEL aspect-orienteds is concurrent and cooperation is needed Ask.
Fig. 4 describes typical side description and its Petri network is semantic, from Fig. 4, it will be seen that the language Model not only can describe traditional before, and after, around side, such as Fig. 4 (a), 4 (b), 4 (c) are shown;Can also retouch State arbitrarily interval (such as Fig. 4 (d)), cooperative cooperating side (such as Fig. 4 (e)), concurrent side (such as Fig. 4 (f)).
2nd, verification algorithm
In the language model be not the combination of arbitrary precondition and postcondition be all legal.The association of side Can not produce with the dependence in original program with cooperation and conflict.Definition for this side needs to meet related constraint.It is described Constraint rule includes:
Rule 1:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled in normal Flow process, event handling, between error handling processing and compensation deals.
Rule 2:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled in circulation It is inside and outside.
Rule 3:One side CTA=(Pre, Post, T, proceed/skip) can not be produced with the dependence of original program Raw conflict.
Rule 4:One side CTA=(Pre, Post, T, skip), precondition Pre are represented with postcondition Post It must be one interval.
Designed according to this four constraint rules and realize a verification algorithm.The verification algorithm is as shown in Figure 5.
Rule 1,2 defines the boundary of a side.Rule 3,4 then defines the semantic meaningful of CTA.
Described regular 1,2 is converted to the structured activities of activity for finding that Pre and Post is related to, and guarantee Pre and The correlated activation of Post is not distributed in structured activities, normal flow, event handling, error handling processing and compensation deals and is followed Inside and outside ring.As described in Fig. 5 steps 1-5.
Described regular 3 are converted to after the corresponding Petri network addition side Petri network semanteme of the former workflow of detection Whether Petri network has loop.As described in Fig. 5 steps 11-13.
Regular 4 dress is changed to into whether detection Pre and Post each represents activity an A, B.And the two activities For same activity, or the structured activities comprising A are identical with the structured activities comprising B and be a sequence. As described in Fig. 5 steps 6-10.
3rd, enforcement engine
The BPEL enforcement engines of the support side dynamic weaving based on ODE are to used BPEL enforcement engines ODE's As shown in fig. 6, grey parts are shown as former ODE engine frameworks, black portions show the part of extension to extension framework.Introduce Aspect compilers are compiled to side.The compiler compiling input is side file (.aspect), and correlation WSDL is literary Part, the wsdl document describe file for institute's called Web service in side.Editing machine first according to input validation side define with And in side BPEL campaign definitions define whether it is legal.Side file is compiled as OAspect Java objects if legal to deposit Take.OAspect includes object and the attributes such as corresponding OAdivce, OPreCondition, OPostCondition, skip. During OAdvice inherits ODE engines, OProcess describes side activity.
Aspect running environment is introduced, the Aspect running environment contains aspect deployment modules, workflow status Monitoring module, Aspect synchronous operation management modules.The aspect deployment modules are used for disposing side;The workflow status Monitoring module monitors the operation shape of BPEL workflow instance OProcess by the BPEL run time events monitor that ODE is provided State;It is relative that the Aspect synchronous operations management module blocks side postcondition when side OAspect preconditions meet The execution of activity is answered, and performs side respective activity, after the completion of side activity is performed, cancelled obstruction activity before blocking, make Which continues executing with.If the skip attributes of side OAspect are true (being defaulted as false), need to skip execution in preposition bar Activity between part and postcondition, so that realize the cooperative cooperating of side and original program.
4th, use case
Fig. 7 describes a service BPEL workflow and its three side demands with travel agent.Above-mentioned language model 4 tuples by XML description represent.Its XML syntax gauge and its explanation are as shown in Figure 8.
The travel agent services flow process is:After travel receives one from the request of user, it adjusts first User profile is obtained with web services.Then two concurrent tasks of flight and hotel are initialized.The two tasks are equal Search is completed, is selected, and make a reservation for these three flow processs.Finally, result is returned to user by travel agent service.
Side demand R1 is by taking daily record as an example, it would be desirable to record the result of aircraft search.We only need in fact After searchFlight, whether complete before selectFlight the operation of execution journal record, be not relevant for logging operations Into.It can be concurrently performed with the operation after searchFlight.Such log services should possess with source program simultaneously Send out executive capability.Between different log services equally should not preferentially after execution sequence.The side definition is as shown in Fig. 9 (a).
Side demand R2 is as a example by adding business rules " reply to user according to solicited message and add some advertisements ". This means that we need to call an advertisement to generate service after program starts, the advertisement generates service to be needed replying to use Complete before family and merge with source program.Side definition as shown in Fig. 9 (b).
The hotel for searching " is selected for user with the far and near sequence to airport by side demand R3 with adding business rules Select " as a example by, after searchFlight, program can just obtain the positional information on airport, so hotel sequence service needs Start after searchFlight and searchHotel, and completed before selectHotel.Such demand is caused originally Two subtasks of flight and hotel for not controlling dependence need and hotel sequence service collaboration cooperation.The side is fixed Justice as shown in Fig. 9 (c).
3 sides are deployed on the BPEL engines of extension.Former BPEL workflows, its operation result is called to meet pre- Phase is envisioned.

Claims (4)

1. a kind of BPEL of the concurrent side programming of support based on token extends implementation method, it is characterised in that including following several Individual step:
1) the concurrent side programming language model of support of the definition based on token;
2) perform the side based on Petri network and define legitimate verification algorithm;
3) realized to used BPEL enforcement engines ODE by the BPEL enforcement engines of the support side dynamic weaving based on ODE Extension;
Wherein, the concurrent side programming language model of the support based on token, by the precondition of operation and postcondition As the minimum unit of insertion point definition;A side is defined with a four-tuple (Pre, Post, T, N);Wherein Pre is front Condition is put, Post is postcondition, and T is one group of activity in BPEL for advice, and N is indicated whether for skip or proceed will Perform the activity of correlation in former workflow;
The side based on Petri network is defined legitimate verification algorithm and is realized by four constraint rules;
The BPEL enforcement engines of the support side dynamic weaving based on ODE, expand to used BPEL enforcement engines ODE Exhibition, should introduce Aspect compilers based on the BPEL enforcement engines of the support side dynamic weaving of ODE and side was compiled;Draw Enter Aspect running environment, the execution of the former workflow of control and side;So as to realize the cooperative cooperating of side and original program.
2. the BPEL of the concurrent side programming of the support based on token as claimed in claim 1 extends implementation method, and its feature exists In in the concurrent side programming language model of the support based on token, T and BPEL workflows are concurrently performed, by obtaining Precondition token and release postcondition token complete synchronization;Precondition defines bringing into operation opportunity for movable T, rearmounted Condition then defines the condition that movable T is merged into original program;It is Petri network by workflow modeling, when all in former workflow Pre Place all once had token, T brings into operation;Transition after Post need T perform terminate the extra token of release could be after It is continuous to perform;The partial ordering relation formal definitions that the semanteme of the language model is changed by Petri network;So as to reach support BPEL towards The extension of side is concurrent and collaborative demand.
3. the BPEL of the concurrent side programming of the support based on token as claimed in claim 1 extends implementation method, and its feature exists In four constraint rules include:
Rule 1:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled in normal flow, Event handling, between error handling processing and compensation deals;
Rule 2:The activity that one side CTA=(Pre, Post, T, proceed/skip) is related to can not be shuttled inside and outside in circulation;
Rule 3:One side CTA=(Pre, Post, T, proceed/skip) can not produce punching with the dependence of original program It is prominent;
Rule 4:One side CTA=(Pre, Post, T, skip), precondition Pre are necessary with what postcondition Post was represented It is one interval.
4. the BPEL of the concurrent side programming of the support based on token as claimed in claim 1 extends implementation method, and its feature exists In in the BPEL enforcement engines based on the support side dynamic weaving of ODE:
The Aspect compilers input is side file, and related wsdl document, and the wsdl document is by calling in side Web service describes file;Whether editing machine is legal according to BPEL campaign definitions in the definition of input validation side and side first; Side file is compiled as into the access of OAspect Java objects if legal;
The Aspect running environment contains aspect deployment modules, workflow status monitoring module, Aspect synchronous operations Management module;The aspect deployment modules are used for disposing side;What the workflow status monitoring module was provided by ODE BPEL run time events monitor monitors the running status of BPEL workflow instance OProcess;The Aspect synchronous operations pipe Reason module blocks the execution of the corresponding activity of side postcondition when side OAspect preconditions meet, and performs side Respective activity, after the completion of side activity is performed, obstruction activity before cancelling obstruction so as to continue executing with;If side OAspect Skip attributes be true, then need to skip the activity performed between precondition and postcondition, so as to realize side with The cooperative cooperating of original program.
CN201410784693.8A 2014-12-16 2014-12-16 BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token Active CN104516719B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410784693.8A CN104516719B (en) 2014-12-16 2014-12-16 BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410784693.8A CN104516719B (en) 2014-12-16 2014-12-16 BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token

Publications (2)

Publication Number Publication Date
CN104516719A CN104516719A (en) 2015-04-15
CN104516719B true CN104516719B (en) 2017-03-22

Family

ID=52792089

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410784693.8A Active CN104516719B (en) 2014-12-16 2014-12-16 BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token

Country Status (1)

Country Link
CN (1) CN104516719B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11687514B2 (en) 2020-07-15 2023-06-27 International Business Machines Corporation Multimodal table encoding for information retrieval systems

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102332125A (en) * 2011-11-08 2012-01-25 南京大学 Workflow mining method based on subsequent tasks
CN102902804A (en) * 2012-10-15 2013-01-30 南京大学 High-efficiency BPEL (business process execution language) service dynamic updating method
CN102929629A (en) * 2012-10-31 2013-02-13 北京科技大学 Aspect-based method and system for assembling reliable WEB service

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8751284B2 (en) * 2009-04-30 2014-06-10 United Parcel Service Of America, Inc. Systems and methods for a real-time workflow platform using Petri net model mappings

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102332125A (en) * 2011-11-08 2012-01-25 南京大学 Workflow mining method based on subsequent tasks
CN102902804A (en) * 2012-10-15 2013-01-30 南京大学 High-efficiency BPEL (business process execution language) service dynamic updating method
CN102929629A (en) * 2012-10-31 2013-02-13 北京科技大学 Aspect-based method and system for assembling reliable WEB service

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"A Petri Net-based Model for Aspect-Oriented Web Serice Composition";Yang Xu,Han Huang;《International Conference on Management & Service Science》;20090922;1-4 *
"Aspect - Oriented Web Service Composition A Petri Net Based Approach";Deivamani Mallayya,Baskaran Ramachandran;《2011 InternationalConference onCyber-Enabled Distributed Computing and Knowledge Discovery》;20111012;88-95 *
"Modeling Aspect-Oriented Web Service Compositions at Shared Join Points";Yang Xu,Dong Li;《2010 3rd International Conference on Advanced Computer Theory and Engineering》;20100822;480-484 *
"Verifying Aspect-Oriented Models Against Crosscutting Properties";Zhanqi Cui,et al.;《International Journal of Software Engineering & Knowledge Engineering》;20130630;第23卷(第5期);655-676 *

Also Published As

Publication number Publication date
CN104516719A (en) 2015-04-15

Similar Documents

Publication Publication Date Title
CN101777004B (en) Method and system for realizing BPEL sub-process multiplexing based on template in service-oriented environment
US8887124B2 (en) Validation of process models
Sousa et al. Separation of crosscutting concerns from requirements to design: Adapting the use case driven approach
US8418135B2 (en) Method and apparatus to abstract away rule languages
Criado et al. A model-driven approach to graphical user interface runtime adaptation
Joeris Defining Flexible Workflow Execution Behaviors.
Fahland et al. Simplifying mined process models: An approach based on unfoldings
Autili et al. Distributed enforcement of service choreographies
Hamadi et al. Self-adapting recovery nets for policy-driven exception handling in business processes
Börger et al. Modeling workflows, interaction patterns, web services and business processes: the ASM-based approach
Joeris Decentralized and flexible workflow enactment based on task coordination agents
CN104516719B (en) BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token
Campos et al. A survey of formalization approaches to service composition
US20100218082A1 (en) Method and system for expressing and enforcing non-functional concerns in business process management systems and workflow systems
Redding et al. Generating business process models from object behavior models
Altamimi et al. Incremental change propagation from UML software models to LQN performance models.
Kloul et al. From interaction overview diagrams to pepa nets
Lima et al. A formal semantics for sysml activity diagrams
Guba et al. A method for business logic extraction from legacy COBOL code of industrial systems
Hölzl et al. Modeling the car crash crisis management system using HiLA
Geatti et al. Foundations of Collaborative DECLARE
Schewe et al. Horizontal business process model integration
Boukhedouma et al. A pattern-based approach for workflow interconnection and flexibility support
Kinoshita et al. Realizability of choreography given by two scenarios
Varela-Vaca et al. OPBUS: Automating structural fault diagnosis for graphical models in the design of business processes

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant