CN104516719A - 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 PDFInfo
- Publication number
- CN104516719A CN104516719A CN201410784693.8A CN201410784693A CN104516719A CN 104516719 A CN104516719 A CN 104516719A CN 201410784693 A CN201410784693 A CN 201410784693A CN 104516719 A CN104516719 A CN 104516719A
- Authority
- CN
- China
- Prior art keywords
- bpel
- token
- support
- programming
- activity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000008569 process Effects 0.000 title abstract description 6
- 238000009941 weaving Methods 0.000 claims abstract description 10
- 238000012795 verification Methods 0.000 claims abstract description 9
- 230000000694 effects Effects 0.000 claims description 47
- 238000012544 monitoring process Methods 0.000 claims description 9
- 230000000875 corresponding effect Effects 0.000 claims description 7
- 230000007704 transition Effects 0.000 claims description 7
- 230000001360 synchronised effect Effects 0.000 claims description 6
- 238000003780 insertion Methods 0.000 claims description 5
- 230000037431 insertion Effects 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 4
- 230000000903 blocking effect Effects 0.000 claims description 3
- 238000010200 validation analysis Methods 0.000 claims description 3
- 238000007599 discharging Methods 0.000 claims description 2
- 230000010354 integration Effects 0.000 abstract 1
- 230000035945 sensitivity Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 2
- 208000026326 Adult-onset Still disease Diseases 0.000 description 1
- 230000004913 activation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000009954 braiding Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Landscapes
- Devices For Executing Special Programs (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
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
Technical field
The present invention relates to and the expansion of BPEL aspect-oriented programming is realized, particularly relate to the concurrent and collaboration capabilities of side and the former workflow of BPEL, propose a kind of new aspect-oriented programming language model for this reason, and extend ODE engine and realized.
Background technology
BPEL (BPEL) is the integrated standard effective language of the Web service that proposed by OASIS.Be the integrated programming language of a processor-oriented support Web service, this language is extensively supported to build Services Oriented Achitecture (SOA) by Oracle, IBM, Apache etc.Similar with the programming language of other procedure-oriented (POP) and object-oriented (OOP) on the one hand, such as debug in BPEL, daily record, safety, the non-functional requirements such as business rules can not be separated from major function well.Aspect-oriented software development (AOSD) is well-known solution.Many as concurrent branch (flow) in BPEL language on the other hand, control linkage (link), event handling (event handler), asynchronous calls (asynchronousinvoke) etc. support the characteristic of concurrency programming, require that the expansion of its aspect-oriented needs correspondingly concurrent support, thus succinct effectively expressing relates to the side of con current control.
Current aspect-oriented programming language model mainly comprises pointcut-advice model, the facet model (EAOP) of history sensitivity, supports concurrent facet model (CEAOP), interval facet model (region aspect).Described pointcut-advice model allows side at one group by logical relation, and wildcard, before the operation (pointcut) in the original program that regular expression is elected, performs afterwards, or replaces the execution of original operation.This model is that traditional AOP language model is widely used.The facet model of described history sensitivity considers that history performs information, and will operate abstract is event, allows side to perform after sequence of events i.e. an execution track.The concurrent facet model of described support is the lifting of the facet model of history sensitivity, and it have modified weaving strategy, allows side to separate from original program and original program concurrence performance.Described interval facet model proposes Regioncut mechanism and code packages more than two row is fitted together formation interval, thus one section of continuous print code can be selected as insertion point.
The expansion of current BPEL aspect-oriented mainly contains AO4BPEL and Padus two kinds.AO4BPEL adopts dynamic weaving mode by traditional pointcut-advice models applying on BPEL language, and side before of a BPEL activity (activity), perform afterwards, or can replace original movable execution.Padus adopts the mode of static braiding to be applied on BPEL language by the facet model of history sensitivity, allows in former workflow, add arbitrary legal BPEL element.
Make a general survey of the language model of above-mentioned aspect-oriented and the expansion of BPEL aspect-oriented, all can not meet the concurrent collaborative execution demand of BPEL side and original program completely.Described concurrent collaborative execution demand comprises 3 points:
1, side should with source program and other side concurrence performance.
2, side can with the wish of developer in original program certain a bit before merge with original program.
3, side can with source program cooperative cooperating.
For this reason, the BPEL that we have proposed a kind of support based on token concurrent side programming expands implementation method.
Summary of the invention
Goal of the invention: the expansion of BPEL aspect-oriented programming (AOP) lacks concurrent support, and this causes the side relating to con current control can not facilitate succinct expressing.The present invention is based on the BPEL expansion implementation method that this problem proposes a kind of support based on token concurrent side programming.
Technical scheme: the BPEL of a kind of support based on token concurrent side programming expands implementation method, comprises as lower part:
1) a kind of side programming language model concurrent based on the support of token;
2) definition of the side based on a Petri network legitimate verification algorithm;
3) a BPEL enforcement engine based on the support side dynamic weaving of ODE.
Based on the side programming language model that the support of token is concurrent, be different from traditional AOP language model to operate the minimum unit that (method call, the access to class members) defines as insertion point (join point).The minimum unit that the precondition of operation and postcondition define as insertion point by described model.A side is defined with a four-tuple (Pre, Post, T, N).Wherein Pre is precondition, and Post is postcondition, T one group of activity that to be advice be in BPEL, and N is that skip or proceed shows whether will perform activity relevant in former workflow.T and BPEL workflow concurrence performance, completes synchronously by obtaining precondition token and discharging postcondition token.Precondition defines the opportunity that T brings into operation, and postcondition then defines the condition that T is merged into original program.Be Petri network by workflow modeling, when tokens that storehouse all once had all in former workflow Pre, T brings into operation; Transition after Post need T to perform the extra token of end release could continue execution.The partial ordering relation formal definitions that the semanteme of this language model is changed by Petri network.Thus the expansion reaching support BPEL aspect-oriented is concurrent and collaborative demand.
Be not the combination of arbitrary precondition and postcondition in described language model be all legal.The cooperative cooperating of side can not produce with the dependence in original program and conflict.The constraint rule that the definition demand fulfillment of side is relevant for this reason, described constraint rule mainly contains four, and described verification algorithm is according to this four constrained designs and realization.
Described constraint rule comprises:
The activity that rule 1: one side CTA=(Pre, Post, T, proceed/skip) relates to can not be shuttled back and forth in normal flow, and event handling, between error handling processing and compensation deals.
The activity that rule 2: one side CTA=(Pre, Post, T, proceed/skip) relate to can not be shuttled back and forth inside and outside circulation.
Rule 3: one side CTA=(Pre, Post, T, proceed/skip) can not produce with the dependence of original program to be conflicted.
Rule 4: one side CTA=(Pre, Post, T, skip), what precondition Pre and postcondition Post represented must be an interval.
The BPEL enforcement engine of the described support side dynamic weaving based on ODE is to the expansion of used BPEL enforcement engine ODE, and this engine is introduced Aspect compiler and compiled side.Introduce Aspect running environment, control the execution of original program and side.Thus realize side in the cooperative cooperating of original program.
Described compiler compiling is input as side file (.aspect), and relevant wsdl document, and described wsdl document is institute's called Web service description document in side.Whether editing machine is first legal according to BPEL campaign definitions in the definition of input validation side and side.If legal, side file is compiled as the access of OAspect Java object.OAspect comprises the objects such as corresponding OAdivce, OPrecondition, OPostcondition, skip and attribute.OAdvice inherits OProcess in ODE engine and describes side activity.
Introduce Aspect running environment, described Aspect running environment contains aspect deployment module, workflow status monitoring module, Aspect synchronous operation administration module.Described aspect deployment module is for disposing side; The running status of the BPEL run time events audiomonitor monitoring BPEL workflow instance OProcess that described workflow status monitoring module is provided by ODE; Described Aspect synchronous operation administration module blocks the execution of the corresponding activity of side postcondition when side OAspect precondition meets, and perform side respective activity, after side is movable complete, cancel obstruction before blocking movable, make it continue to perform.If the skip attribute of side OAspect is true (being defaulted as false), then needs to skip the activity performed between precondition and postcondition, thus realize side in the cooperative cooperating of original program.
Beneficial effect: compared with prior art, the BPEL of the support based on token provided by the invention concurrent side programming expands implementation method, supports the side of BPEL aspect-oriented programming and the concurrent and collaboration capabilities of former workflow.
Accompanying drawing explanation
Fig. 1 is that the Petri network of basic activity in BPEL workflow is semantic;
Fig. 2 is that the Petri network of structured activities in BPEL workflow is semantic;
Fig. 3 is semantic based on the Petri network of the concurrent aspect-oriented programming language model of the support of partial ordering relation;
Fig. 4 is the Petri network semanteme adding typical side in BPEL workflow;
Fig. 5 is the side definition legitimate verification algorithm based on Petri network;
Fig. 6 is the framework of the BPEL enforcement engine of support side dynamic weaving based on ODE;
Fig. 7 is the demand of travel agent service use case and three sides thereof;
Fig. 8 is that side XML describes expression grammer;
Fig. 9 is the side definition that travel agent serves three side demands.
Embodiment
Below in conjunction with specific embodiment, illustrate the present invention further, these embodiments should be understood only be not used in for illustration of the present invention and limit the scope of the invention, after having read the present invention, the amendment of those skilled in the art to the various equivalent form of value of the present invention has all fallen within the application's claims limited range.
1, based on the side programming language model that the support of token is concurrent
In order to the language model of describing and validating BPEL aspect-oriented programming better, BPEL workflow modeling is Petri network by we.In BPEL, one is operating as an activity (activity), and activity has two types, basic activity and structured activities, and basic activity represents atomic operation, as: invoke, calls a web services; Receive: receipt message; Reply: send message; Assign: to variable assignments.Structured activities for combining other activity, as: sequence, defines a sequential organization; If, defines a branched structure; While, defines a loop structure; Flow, defines a concurrent structure.It is semantic that Fig. 1 shows the movable Petri network in basis, what the left side (dotted portion) showed is eliminate (DPE) based on the deadlock path of BPEL and skip the semanteme of movable X, the semanteme that what the right (realizing part) showed is under movable X normal flow.Wherein r
xthe state that (" ready ") expression activity X brings into operation, f
xthe state of (" finish ") expression activity X end of run, other storehouses and transition describing activity X internal conversion.Other activities are combined with certain dependence by structured activities, and its Petri network semanteme essentially describes the dependence between living, as shown in Figure 2.
From Fig. 1 and Fig. 2, we can find out that basis activity and structured activities all have r
x(" ready ") and f
xa movable beginning and done state represented by (" finish ") these two storehouses.The r of each activity
x(" ready ") and f
x(" finish ") storehouse be exactly insertion point based on the concurrent side programming language model of the support of token.
A side is defined with four-tuple CTA=(Pre, Post, T, N).The partial ordering relation formal definitions that the semanteme of described four-tuple is changed by Petri network.In CTA, to be the semanteme of proceed be N:
Wherein → (" happened before ") defines the partial ordering relation between transition.I (p) represents unique input transition of storehouse institute p, and O (p) represents unique output transition of storehouse institute p.The tangent plane Petri network that Fig. 3 shows in two preconditions and two postcondition situations is semantic, in Petri network → and O → expression " happened before " relation.In CTA, N is that the semanteme of skip is similar with it, and difference is, the activity that movable T will replace between precondition and postcondition performs.It has very strict constraint to guarantee " activity between precondition and postcondition " to be significant.CTA=(Pre, Post, T, proceed) equally also has corresponding constraint.
When tokens that storehouse all once had all in former workflow Pre, T brings into operation; Transition after Post need T to perform the extra token of end release could continue execution.Thus the expansion reaching support BPEL aspect-oriented is concurrent and collaborative demand.
Fig. 4 describes typical side and describes with its Petri network semantic, and from Fig. 4, we can find out, this language model not only can describe traditional before, after, around side, as Fig. 4-a, shown in 4-b, 4-c; Any interval (as Fig. 4-d) can also be described, cooperative cooperating side (as Fig. 4-e), concurrent side (as Fig. 4-f).
2, verification algorithm
Be not the combination of arbitrary precondition and postcondition in described language model be all legal.The cooperative cooperating of side can not produce with the dependence in original program and conflict.The constraint that the definition demand fulfillment of side is relevant for this reason.Described constraint rule comprises:
The activity that rule 1: one side CTA=(Pre, Post, T, proceed/skip) relates to can not be shuttled back and forth in normal flow, and event handling, between error handling processing and compensation deals.
The activity that rule 2: one side CTA=(Pre, Post, T, proceed/skip) relate to can not be shuttled back and forth inside and outside circulation.
Rule 3: one side CTA=(Pre, Post, T, proceed/skip) can not produce with the dependence of original program to be conflicted.
Rule 4: one side CTA=(Pre, Post, T, skip), what precondition Pre and postcondition Post represented must be an interval.
According to these four constraint rule Design and implementations verification algorithm.Described verification algorithm as shown in Figure 5.
Rule 1,2 defines the boundary of a side.Rule 3,4 semantemes defining CTA are significant.
Be converted to the structured activities of activity found Pre and Post and relate to by described regular 1,2, and guarantee that the correlated activation of Pre and Post is not distributed in structured activities, normal flow, event handling, inside and outside error handling processing and compensation deals and circulation.As described in Fig. 5 step 1-5.
Whether the Petri network be converted to described regular 3 after detecting Petri network interpolation side Petri network semanteme corresponding to former workflow has loop.As described in Fig. 5 step 11-13.
Described regular 4 dresses are changed to detection Pre and Post and whether represent movable A, a B separately.And these two activities are same activity, or the structured activities comprising A is identical with the structured activities comprising B and be a sequence.As described in Fig. 5 step 6-10.
3, enforcement engine
To the extension framework of used BPEL enforcement engine ODE as shown in Figure 6, grey parts is shown as former ODE engine framework to the BPEL enforcement engine of the described support side dynamic weaving based on ODE, and black part shows the part of expansion.Introduce Aspect compiler to compile side.Described compiler compiling is input as side file (.aspect), and relevant wsdl document, and described wsdl document is institute's called Web service description document in side.Whether editing machine is first legal according to BPEL campaign definitions definition in the definition of input validation side and side.If legal, side file is compiled as the access of OAspect Java object.OAspect comprises the objects such as corresponding OAdivce, OPreCondition, OPostCondition, skip and attribute.OAdvice inherits OProcess in ODE engine and describes side activity.
Introduce Aspect running environment, described Aspect running environment contains aspect deployment module, workflow status monitoring module, Aspect synchronous operation administration module.Described aspect deployment module is for disposing side; The running status of the BPEL run time events audiomonitor monitoring BPEL workflow instance OProcess that described workflow status monitoring module is provided by ODE; Described Aspect synchronous operation administration module blocks the execution of the corresponding activity of side postcondition when side OAspect precondition meets, and perform side respective activity, after side is movable complete, cancel obstruction before blocking movable, make it continue to perform.If the skip attribute of side OAspect is true (being defaulted as false), then needs to skip the activity performed between precondition and postcondition, thus realize side in the cooperative cooperating of original program.
4, use case
Fig. 7 describes a service BPEL workflow by travel agent and three side demands thereof.4 tuples of above-mentioned language model are described by XML and represent.Its XML syntax gauge and explanation thereof are as shown in Figure 8.
Described travel agent services flow process is: when travel receive one from the request of user after, first it call web services and obtain user profile.Then the task that initialization flight and hotel two is concurrent.These two tasks all complete search, select, and these three flow processs predetermined.Finally, result is returned to user by travel agent service.
Described side demand R1 is for daily record, and we need the result recording aircraft search.Whether we only need execution journal record operation after searchFlight in fact, and be indifferent to logging operations and completed before selectFlight.It can with searchFlight after operation concurrence performance.Such log services should possess the concurrence performance ability in source program.Between different log services equally not should preferentially after execution sequence.The definition of this side is as shown in Fig. 9 (a).
Described side demand R2 " replys more additional advertisements according to solicited message to user " to add business rules.This means that we need to call an advertisement generation service after program starts, this advertisement generates service to be needed completed before replying to user and merge in source program.This side definition as shown in Fig. 9 (b).
The hotel searched " is selected for user for the distance sequence to airport " to add business rules by described side demand R3, after searchFlight, program just can obtain the positional information on airport, so hotel sequence service needs to start after searchFlight and searchHotel, and completed before selectHotel.Such demand makes flight and hotel two subtasks originally not controlling dependence need and the cooperation of hotel sequence service collaboration.This side definition as shown in Fig. 9 (c).
Described 3 side surface part are deployed on the BPEL engine of expansion.Call former BPEL workflow, its operation result meets expection imagination.
Claims (4)
1. the BPEL based on the support concurrent side programming of token expands an implementation method, it is characterized in that, mainly comprises following several part:
1) a kind of side programming language model concurrent based on the support of token;
2) definition of the side based on a Petri network legitimate verification algorithm;
3) a BPEL enforcement engine based on the support side dynamic weaving of ODE;
Wherein, the described side programming language model concurrent based on the support of token, using the minimum unit that the precondition of operation and postcondition define as insertion point; A side is defined with a four-tuple (Pre, Post, T, N); Wherein Pre is precondition, and Post is postcondition, T one group of activity that to be advice be in BPEL, and N is that skip or proceed shows whether will perform activity relevant in former workflow;
The described definition of the side based on Petri network legitimate verification algorithm is realized by four constraint rules;
The BPEL enforcement engine of the described support side dynamic weaving based on ODE, to the expansion of used BPEL enforcement engine ODE, this engine is introduced Aspect compiler and is compiled side; Introduce Aspect running environment, control the execution of former workflow and side; Thus realize side in the cooperative cooperating of original program.
2. expand implementation method based on the BPEL of the support concurrent side programming of token as claimed in claim 1, it is characterized in that, in the described side programming language model concurrent based on the support of token, T and BPEL workflow concurrence performance, completes synchronously by obtaining precondition token and discharging postcondition token; Precondition defines bringing into operation opportunity of movable T, and postcondition then defines the condition that movable T is merged into original program.Be Petri network by workflow modeling, when tokens that storehouse all once had all in former workflow Pre, T brings into operation; Transition after Post need T to perform the extra token of end release could continue execution.The partial ordering relation formal definitions that the semanteme of this language model is changed by Petri network; Thus the expansion reaching support BPEL aspect-oriented is concurrent and collaborative demand.
3. expand implementation method based on the BPEL of the support concurrent side programming of token as claimed in claim 1, it is characterized in that, described four constraint rules comprise:
The activity that rule 1: one side CTA=(Pre, Post, T, proceed/skip) relates to can not be shuttled back and forth in normal flow, and event handling, between error handling processing and compensation deals;
The activity that rule 2: one side CTA=(Pre, Post, T, proceed/skip) relate to can not be shuttled back and forth inside and outside circulation;
Rule 3: one side CTA=(Pre, Post, T, proceed/skip) can not produce with the dependence of original program to be conflicted;
Rule 4: one side CTA=(Pre, Post, T, skip), what precondition Pre and postcondition Post represented must be an interval.
4. expand implementation method based on the BPEL of the support concurrent side programming of token as claimed in claim 1, it is characterized in that, in the BPEL enforcement engine of the described support side dynamic weaving based on ODE:
Described Aspect compiler is input as side file (.aspect), and relevant wsdl document, and described wsdl document is institute's called Web service description document in side; Whether editing machine is first legal according to BPEL campaign definitions in the definition of input validation side and side; If legal, side file is compiled as the access of OAspect Java object;
Described Aspect running environment contains aspect deployment module, workflow status monitoring module, Aspect synchronous operation administration module; Described aspect deployment module is for disposing side; The running status of the BPEL run time events audiomonitor monitoring BPEL workflow instance OProcess that described workflow status monitoring module is provided by ODE; Described Aspect synchronous operation administration module blocks the execution of the corresponding activity of side postcondition when side OAspect precondition meets, and perform side respective activity, after side is movable complete, cancel obstruction before blocking movable, make it continue to perform; If the skip attribute of side OAspect is true (being defaulted as false), then needs to skip the activity performed between precondition and postcondition, thus realize side in the cooperative cooperating of original program.
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 true CN104516719A (en) | 2015-04-15 |
| CN104516719B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022013675A1 (en) * | 2020-07-15 | 2022-01-20 | International Business Machines Corpofiation | Multimodal table encoding for information retrieval systems |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100280865A1 (en) * | 2009-04-30 | 2010-11-04 | United Parcel Service Of America, Inc. | Systems and Methods for a Real-Time Workflow Platform |
| 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 |
-
2014
- 2014-12-16 CN CN201410784693.8A patent/CN104516719B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100280865A1 (en) * | 2009-04-30 | 2010-11-04 | United Parcel Service Of America, Inc. | Systems and Methods for a Real-Time Workflow Platform |
| 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)
| Title |
|---|
| DEIVAMANI MALLAYYA，BASKARAN RAMACHANDRAN: ""Aspect - Oriented Web Service Composition A Petri Net Based Approach"", 《2011 INTERNATIONALCONFERENCE ONCYBER-ENABLED DISTRIBUTED COMPUTING AND KNOWLEDGE DISCOVERY》 * |
| YANG XU，DONG LI: ""Modeling Aspect-Oriented Web Service Compositions at Shared Join Points"", 《2010 3RD INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING》 * |
| YANG XU，HAN HUANG: ""A Petri Net-based Model for Aspect-Oriented Web Serice Composition"", 《INTERNATIONAL CONFERENCE ON MANAGEMENT & SERVICE SCIENCE》 * |
| ZHANQI CUI，ET AL.: ""Verifying Aspect-Oriented Models Against Crosscutting Properties"", 《INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING & KNOWLEDGE ENGINEERING》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022013675A1 (en) * | 2020-07-15 | 2022-01-20 | International Business Machines Corpofiation | Multimodal table encoding for information retrieval systems |
| US11687514B2 (en) | 2020-07-15 | 2023-06-27 | International Business Machines Corporation | Multimodal table encoding for information retrieval systems |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104516719B (en) | 2017-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bergmann et al. | Viatra 3: A reactive model transformation platform | |
| Baresi et al. | Service-oriented dynamic software product lines | |
| Börger et al. | An ASM semantics for UML activity diagrams | |
| Vogel et al. | The role of models and megamodels at runtime | |
| Zhao et al. | Version management for business process schema evolution | |
| Börger et al. | Modeling workflows, interaction patterns, web services and business processes: the ASM-based approach | |
| Hamadi et al. | Self-adapting recovery nets for policy-driven exception handling in business processes | |
| Kamina et al. | Generalized layer activation mechanism through contexts and subscribers | |
| Khalaf et al. | Coordination for fragmented loops and scopes in a distributed business process | |
| Bossche et al. | Ontology driven software engineering for real life applications | |
| Bergenti et al. | Core features of an agent-oriented domain-specific language for JADE agents | |
| CN105808241B (en) | The construction method and system in library in terms of reusable | |
| André et al. | Activity diagrams patterns for modeling business processes | |
| Cariou et al. | Characterization of adaptable interpreted-dsml | |
| CN104516719A (en) | BPEL (Business Process Execution Language) extension realization method for supporting concurrency aspect programming based on token | |
| Bendraou et al. | Achieving process modeling and execution through the combination of aspect and model‐driven engineering approaches | |
| CN102073505A (en) | Service composition-oriented declarative transaction integration method and system | |
| Moschoyiannis et al. | True concurrency in long-running transactions for digital ecosystems | |
| Zaharieva-Stojanovski et al. | Verifying class invariants in concurrent programs | |
| Bucchiarone et al. | Towards a domain specific language for engineering collective adaptive systems | |
| US20090164879A1 (en) | Method and system for controlling the re-execution of a rule branch | |
| Stoyenko et al. | A description language for engineering of complex real-time systems | |
| Kloul et al. | From interaction overview diagrams to pepa nets | |
| Fan et al. | Shared-locking for semantic conflict prevention in real-time collaborative programming | |
| Stolz et al. | Refactoring and active object languages |
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 |