DETERMINING AN OPTIMAL SEQUENCE OF STATUS TRANSITIONS FOR BUSINESS OBJECTS

• US 20130127863A1
• Filed: 11/23/2011
• Published: 05/23/2013
• Est. Priority Date: 11/23/2011
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: Christian Hohmann, Knut Heusermann, Matthias Becker, Oliver Berger, Steffen Witt
• Inventors: WITT, Steffen, BECKER, Matthias, BERGER, Oliver, BUECHELER, Torsten, HEUSERMANN, Knut, HOHMANN, Christian
• Application Number:
  US13/303,165
• Publication Number:
  US 20130127863A1
• Time in Patent Office: Days
• US Class Current: 345/440
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

Various embodiments of systems and methods for determining optimal an sequence of status transitions for business objects are described herein. In one aspect, the method executed by one or more computers in a network of computers includes receiving a target status for a business object, identifying a source status of the business object, identifying a status schema including one or more transitions from the source status to the target status, parsing the status schema to retrieve the one or more transitions from the source status to the target status, generating a graphical representation illustrating the transitions from the source status to the target status, executing an algorithm upon the graphical representation to determine an optimal sequence of transitions from the source status to the target status, and processing the business object based upon the optimal sequence of transitions to attain the target status.

Claims

1. An article of manufacture including a computer readable storage medium to tangibly store instructions, which when executed by one or more computers in a network of computers causes the performance of the following operation:

the one or more computers receiving a target status related to a business object;

the one or more computers identifying a source status of the business object;

the one or more computers identifying a status schema defined for the business object, wherein the status schema includes a plurality of statuses including the source status and the target status and one or more transitions from one status to another status;

the one or more computers parsing the status schema to retrieve the one or more transitions from the source status to the target status;

the one or more computers generating a graphical representation of the one or more transitions from the source status to the target status;

the one or more computers executing an algorithm upon the graphical representation to determine an optimal sequence of transitions from the source status to the target status; and

the one or more computers processing the business object according to the optimal sequence of transitions to attain the target status.

2. The article of manufacture of claim 1, wherein the target status is received through a Web service.

3. The article of manufacture of claim 1, wherein the source status is identified from a status variable associated with the business object and wherein the status schema is identified from a metadata repository of the business object.

4. The article of manufacture of claim 1, wherein the graphical representation is a graph and wherein the graph is generated using a graph generating algorithm.

5. The article of manufacture of claim 4, wherein the graph includes the one or more statuses as one or more vertices and the one or more transitions as one or more edges and wherein each of the one or more edges represents an action performed on the business object.

6. The article of manufacture of claim 5, wherein each edge in the graph is assigned a predefined value.

7. The article of manufacture of claim 1, wherein the graphical representation is stored in a tabular format including one or more source statuses, one or more target statuses, and one or more transitions from the source statuses to the target statuses, and wherein each of the transitions represents an action performed on the business object.

8. The article of manufacture of claim 1, wherein the algorithm is a breadth first search algorithm and wherein the optimal sequence of transitions is a shortest transition from the source status to the target status.

9. The article of manufacture of claim 8, wherein the algorithm is Dijkstra'"'"'s algorithm.

10. The article of manufacture of claim 1 further comprising instructions which when executed cause the one or more computers to determine if one or more predefined conditions are fulfilled before achieving the target status, wherein if the one or more predefined conditions are not fulfilled an error message is displayed on a user interface (UI) and wherein the error message is a prompt for entering one or more information related to the business object.

11. The article of manufacture of claim 1 further comprising instructions which when executed cause the one or more computers to render a confirmation message if the target status is attained.

12. A method for determining optimal sequence of status transitions for business objects implemented on a network of one or more computers, the method comprising:

the one or more computers receiving a target status related to a business object;

the one or more computers identifying a source status of the business object;

the one or more computers identifying a status schema defined for the business object,

wherein the status schema includes a plurality of statuses including the source status and the target status and one or more transitions from one status to another status;

the one or more computers parsing the status schema to retrieve the one or more transitions from the source status to the target status;

the one or more computers generating a graphical representation of the one or more transitions from the source status to the target status;

the one or more computers executing an algorithm upon the graphical representation

to determine the optimal sequence of transitions from the source status to the target status; and

the one or more computers processing the business object according to the optimal sequence of transitions to attain the target status.

13. The method of claim 12 further comprising:

the one or more computers determining if one or more predefined conditions are fulfilled before achieving the target status; and

the one or more computers displaying an error message if the one or more predefined conditions are not fulfilled before achieving the target status.

14. The method of claim 12 further comprising:

the one or more computers rendering a confirmation message if the target status is attained.

15. A computer system for determining an optimal sequence of status transitions for business objects, comprising:

a memory to store program code; and

a processor communicatively coupled to the memory, the processor configured to execute the program code to cause one or more computers in a network of computers to;

receive a target status related to a business object;

identify a source status of the business object;

identify a status schema defined for the business object, wherein the status schema includes a plurality of statuses including the source status and the target status and one or more transitions from one status to another status;

parse the status schema to retrieve the one or more transitions from the source status to the target status;

generate a graphical representation of the one or more transitions from the source status to the target status;

executing an algorithm upon the graphical representation to determine the optimal sequence of transitions from the source status to the target status; and

process the business object according to the optimal sequence of transitions to attain the target status.

16. The computer system of claim 15, wherein the graphical representation is a graph and wherein the graph includes the one or more statuses as one or more vertices and the one or more transitions as one or more edges.

17. The computer system of claim 16, wherein the processor is further configured to assign a predefined value to each edge of the graph.

18. The computer system of claim 15, wherein the processor is further configured to perform the following:

determine if one or more predefined conditions are fulfilled before achieving the target status; and

display an error message if the one or more predefined conditions are not fulfilled.

19. The computer system of claim 15, wherein the processor is further configured to render a confirmation message if the target status is attained.

20. The computer system of claim 15, wherein the algorithm is Dijkstra'"'"'s algorithm and wherein the optimal sequence of transition is a shortest transition from the source status to the target status.