التفاصيل البيبلوغرافية
| العنوان: |
SYSTEM AND METHOD FOR MESSAGE CHOREOGRAPHIES OF SERVICES |
| Document Number: |
20100162213 |
| تاريخ النشر: |
June 24, 2010 |
| Appl. No: |
12/338183 |
| Application Filed: |
December 18, 2008 |
| مستخلص: |
In one embodiment the present invention includes a computer-implemented method of evaluating interactions between processes. The method includes storing a message choreography meta-model that includes an interaction meta class and a constraint meta-class. The interaction meta-class relates to an exchange of a message between a sender and a receiver, and the constraint meta-class relates to an input to the interaction meta-class. The method further includes executing a user interface computer program with which a user creates a message choreography model between a first process and a second process. The message choreography model is based on the message choreography meta-model. The message choreography model includes interactions that conform to the interaction meta class, and includes constraints that conform to the constraint meta class. The method further includes executing a verification computer program that performs a verification of the message choreography model. The verification includes verifying absence of an inconsumable message. The method further includes executing a testing computer program that performs a testing based on the message choreography model. The testing validates on an existing implementation the message exchange execution described by the choreography. |
| Inventors: |
Wieczorek, Sebastian (Mainz, DE); Roth, Andreas (Karlsruhe, DE); Stefanescu, Alin (Gross-Zimmern, DE); Charfi, Anis (Darmstadt, DE); Kraft, Frank Michael (Speyer, DE) |
| Assignees: |
SAP AG (Walldorf, DE) |
| Claim: |
1. A computer-implemented method of evaluating interactions between processes, comprising: storing a message choreography meta-model that includes an interaction meta-class and a constraint meta-class, wherein the interaction meta-class relates to an exchange of a message between a sender and a receiver, and wherein the constraint meta-class relates to an input to the interaction meta-class; executing a user interface computer program with which a user creates a message choreography model between a first process and a second process, wherein the message choreography model is based on the message choreography meta-model, wherein the message choreography model includes a plurality of interactions that conform to the interaction meta-class, and wherein message choreography model includes a plurality of constraints that conform to the constraint meta-class; and executing a verification computer program that performs a verification of the message choreography model, wherein the verification includes verifying absence of an inconsumable message. |
| Claim: |
2. The computer-implemented method of claim 1, further comprising: executing a testing computer program that performs a testing based on the message choreography model, wherein the testing performs model based testing on an existing implementation of the message choreography model by executing a test case that the testing computer program generates from the message choreography model. |
| Claim: |
3. The computer-implemented method of claim 1, wherein the step of executing the user interface computer program comprises: defining a global choreography model; and refining a plurality of local partner models, generated from the global choreography model, according to a plurality of send-after-receive constraints. |
| Claim: |
4. The computer-implemented method of claim 1, wherein the step of executing the verification computer program comprises: transforming, according to a plurality of consistency relations, the message choreography model into a general purpose model according to a general purpose modeling language; and evaluating the general purpose model using at least one of an advanced theorem prover and a model checker. |
| Claim: |
5. The computer-implemented method of claim 1, wherein the message choreography model includes a global choreography model, a local partner model, and a channel model. |
| Claim: |
6. The computer-implemented method of claim 1, wherein the message choreography model includes a communication status variable, a communication status value, and an interaction. |
| Claim: |
7. The computer-implemented method of claim 1, wherein the interaction meta-class includes a message type, a sender and a receiver, an effect, and a guard condition. |
| Claim: |
8. The computer-implemented method of claim 1, wherein the constraint meta-class includes a communication status value reached constraint meta-class, a predicate constraint meta-class, and an operator meta-class. |
| Claim: |
9. A computer program, embodied on a tangible recording medium, for evaluating interactions between processes, comprising: data representing a message choreography meta-model that includes an interaction meta-class and a constraint meta-class, wherein the interaction meta-class relates to an exchange of a message between a sender and a receiver, and wherein the constraint meta-class relates to an input to the interaction meta-class; a user interface computer program with which a user, using a physical computing device, creates a message choreography model between a first process and a second process, wherein the message choreography model is based on the message choreography meta-model, wherein the message choreography model includes a plurality of interactions that conform to the interaction meta-class, and wherein message choreography model includes a plurality of constraints that conform to the constraint meta-class; and a verification computer program that, when executed by the physical computing device, performs a verification of the message choreography model, wherein the verification includes verifying absence of an inconsumable message. |
| Claim: |
10. The computer program of claim 9, further comprising: a testing computer program that performs a testing based on the message choreography model, wherein the testing performs model based testing on an existing implementation of the message choreography model by executing a test case that the testing computer program generates from the message choreography model. |
| Claim: |
11. The computer program of claim 9, wherein the user uses the user interface computer program to define a global choreography model, and wherein the user uses the user interface computer program to refine a plurality of local partner models, generated from the global choreography model, according to a plurality of send-after-receive constraints. |
| Claim: |
12. The computer program of claim 9, wherein the verification computer program, when executed by the physical computing device: transforms, according to a plurality of consistency relations, the message choreography model into a general purpose model according to a general purpose modeling language; and evaluates the general purpose model using at least one of an advanced theorem prover and a model checker. |
| Claim: |
13. The computer program of claim 9, wherein the message choreography model includes a global choreography model, a local partner model, and a channel model. |
| Claim: |
14. The computer program of claim 9, wherein the message choreography model includes a communication status variable, a communication status value, and an interaction. |
| Claim: |
15. The computer program of claim 9, wherein the interaction meta-class includes a message type, a sender and a receiver, an effect, and a guard condition. |
| Claim: |
16. The computer program of claim 9, wherein the constraint meta-class includes a communication status value reached constraint meta-class, a predicate constraint meta-class, and an operator meta-class. |
| Claim: |
17. A system for evaluating interactions between processes, comprising: a storage system that stores a message choreography meta-model that includes an interaction meta-class and a constraint meta-class, wherein the interaction meta-class relates to an exchange of a message between a sender and a receiver, and wherein the constraint meta-class relates to an input to the interaction meta-class; and a processor system that executes a user interface computer program with which a user creates a message choreography model between a first process and a second process, wherein the message choreography model is based on the message choreography meta-model, wherein the message choreography model includes a plurality of interactions that conform to the interaction meta-class, and wherein message choreography model includes a plurality of constraints that conform to the constraint meta-class, wherein the processor system executes a verification computer program that performs a verification of the message choreography model, wherein the verification includes verifying absence of an inconsumable message. |
| Claim: |
18. The system of claim 17, wherein the processor system executes a testing computer program that performs a testing based on the message choreography model, wherein the testing performs model based testing on an existing implementation of the message choreography model by executing a test case that the testing computer program generates from the message choreography model. |
| Claim: |
19. The system of claim 17, wherein the user uses the user interface computer program to define a global choreography model, and wherein the user uses the user interface computer program to refine a plurality of local partner models, generated from the global choreography model, according to a plurality of send-after-receive constraints. |
| Claim: |
20. The system of claim 17, wherein the verification computer program, when executed by the processor system: transforms, according to a plurality of consistency relations, the message choreography model into a general purpose model according to a general purpose modeling language; and evaluates the general purpose model using at least one of an advanced theorem prover and a model checker. |
| Current U.S. Class: |
717/126 |
| Current International Class: |
06 |
| رقم الانضمام: |
edspap.20100162213 |
| قاعدة البيانات: |
USPTO Patent Applications |
