Timer Patterns For Process Models

• US 20090165001A1
• Filed: 12/19/2007
• Published: 06/25/2009
• Est. Priority Date: 12/19/2007
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Kruempelmann, Marita A., Kowalkiewicz, Marek K., Lu, Ruopeng, Baeuerle, Stefan A.
• Granted Patent: US 8,683,436 B2
• Time in Patent Office: Days
• US Class Current: 718/102
• CPC Class Codes: G06F 2209/506 Constraint
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system

Abstract

The subject matter disclosed herein provides methods and apparatus, including computer program products, for providing timers for tasks of process models. In one aspect, an input representative of a temporal constraint for a task of a graph-process model may be received. The temporal constraint defines at least one of a delay or a deadline. The task may be associated with the temporal constraint created based on the received input. The temporal constraint defined to have a placement at the graph-process model based on the type of temporal constraint. The task and the temporal constraint may be provided to configure the process model. Related systems, apparatus, methods, and/or articles are described.

Claims

1. A computer-implemented method comprising:

receiving an input representative of a temporal constraint for a task of a graph-process model, the temporal constraint defining at least one of a delay or a deadline;

associating the task with the temporal constraint created based on the received input, the temporal constraint defined to have a placement at the graph-process model based on a type of temporal constraint; and

providing the task and the temporal constraint to configure the graph-process model.

2. The computer-implemented method of claim 1, wherein receiving further comprises;

receiving, from a user interface, the input representative of the temporal constraint.

3. The computer-implemented method of claim 1 further comprising:

providing the task and the temporal constraint to the user interface for presentation.

4. The computer-implemented method of claim 1, wherein receiving further comprises:

receiving the input representative of the temporal constraint of the task, the task including a commenced state and a completed state.

5. The computer-implemented method of claim 1, wherein associating further comprises:

defining the placement of the temporal constraint based on whether the type of the temporal constraint represents the deadline or the delay.

6. The computer-implemented method of claim 1, wherein associating further comprises:

defining a graphical notation for a graph-based process model including the task, the graphical notation represents an element having four borders including a commencement delay on a left border, a completion delay on a right border, a commencement deadline on a top border, and a completion deadline on a bottom border.

7. The computer-implemented method of claim 1, wherein associating further comprises:

defining the graphical notation for a graph-based process model including the task and the temporal constraint, wherein the temporal constraint is a commencement delay, the graphical notation representing the task in an element having four borders including a left border, a right border, a top border, and a bottom border and placing the temporal constraint on the left border of the element representing the task.

8. The computer-implemented method of claim 7, wherein the temporal constraint is an absolute commencement delay and defining further comprises:

presenting a label graphically linked to the temporal constraint, the label indicating an absolute time.

9. The computer-implemented method of claim 7, wherein the temporal constraint is a relative commencement delay and defining further comprises:

presenting a label graphically linked to the temporal constraint, the label indicating a time relative to a state of the task.

10. The computer-implemented method of claim 7, wherein the temporal constraint is an interrelated commencement delay and defining further comprises:

presenting a label graphically linked to the temporal constraint and displaying a second task graphically linked to the label, the label indicating a time relative to a state of the second task.

11. The computer-implemented method of claim 1, wherein associating further comprises:

defining the graphical notation for a graph-based process model including the task and the temporal constraint, wherein the temporal constraint is a commencement deadline, the graphical notation representing the task in an element having four borders including a left border, a right border, a top border, and a bottom border, placing the temporal constraint on the top border of the element representing the task, and placing a second task graphically linked to the temporal constraint, the second task being an escalated task.

12. The computer-implemented method of claim 1, wherein associating further comprises:

defining the graphical notation for a graph-based process model including the task and the temporal constraint, wherein the temporal constraint is a completion delay, the graphical notation representing the task in an element having four borders including a left border, a right border, a top border, and a bottom border and placing the temporal constraint on the right border of the element representing the task.

13. The computer-implemented method of claim 1, wherein associating further comprises:

defining the graphical notation for a graph-based process model including the task and the temporal constraint, wherein the temporal constraint is a completion deadline, the graphical notation representing the task in an element having four borders including a left border, a right border, a top border, and a bottom border, placing the temporal constraint on the bottom border of the element representing the task, and placing a second task graphically linked to the temporal constraint, the second task being an escalated task.

14. A computer-readable medium comprising instructions that when performed by a computer result in operations comprising:

receiving an input representative of a temporal constraint for a task of a graph-process model, the temporal constraint defining at least one of a delay or a deadline;

associating the task with the temporal constraint created based on the received input, the temporal constraint defined to have a placement at the graph-process model based on a type of temporal constraint; and

providing the task and the temporal constraint to configure the graph-process model.

15. The computer-readable medium of claim 14, wherein receiving further comprises:

receiving, from a user interface, the input representative of the temporal constraint.

16. The computer-readable medium of claim 14 further comprising;

providing the task and the temporal constraint to the user interface for presentation.

17. A system comprising:

a processor; and

a memory, wherein the processor and the memory are configured to perform a method comprising;

receiving an input representative of a temporal constraint for a task of a graph-process model, the temporal constraint defining at least one of a delay or a deadline;

associating the task with the temporal constraint created based on the received input, the temporal constraint defined to have a placement at the graph-process model based on a type of temporal constraint; and

providing the task and the temporal constraint to configure the graph-process model.

18. The system of claim 17, wherein receiving further comprises:

receiving, from a user interface, the input representative of the temporal constraint.

19. The system of claim 17 further comprising:

providing the task and the temporal constraint to the user interface for presentation.

20. The system of claim 17, wherein receiving further comprises:

receiving the input representative of the temporal constraint of the task, the task including a commenced state and a completed state.