Framework for modeling cancellation for process-centric programs

• US 20070239498A1
• Filed: 03/30/2006
• Published: 10/11/2007
• Est. Priority Date: 03/30/2006
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Sagar, Akash, Shukla, Dharma, Schmidt, Bob, Mehta, Mayank, Raman, Karthik, Talbert, Nathan
• Application Number:
  US11/393,357
• Publication Number:
  US 20070239498A1
• Time in Patent Office: Days
• US Class Current: 705/7
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/0633 Workflow analysis

Abstract

Declaratively canceling execution of an activity. A state automaton for an activity is defined, and the state automaton includes an executing state, a canceling state, and a closed state and classifies an execution lifetime of the activity. The activity includes work items and organizes the work items in an execution hierarchical structure. The work items are transitioned from the executing state to the closed state indicating a completion of executing the each work item of the activity. Upon having one of the work items being transitioned to the closed state, a cancellation request is transmitted to the work items currently in the executing state. The executing work items are identified as a function of the transmitted cancellation request and the execution hierarchical structure of the defined activity. The execution lifetime of the activity is canceled by transitioning the identified work items from the executing state to the canceling state.

Claims

1. A method for declaratively canceling an activity in a process-centric program, said method comprising:

defining a state automaton for the activity, said state automaton including an executing state, a canceling state, and a closed state, said state automaton classifying an execution lifetime of the activity;

defining the activity to include the plurality of work items, said defined activity organizing the plurality of work items in an execution hierarchical structure, each of the work items including a method for executing a portion of the activity;

transitioning the plurality of work items from the executing state to the closed state, said closed state indicating a completion of executing the activity;

upon having one of the work items being transitioned to the closed state, transmitting a cancellation request to one or more of the work items currently in the executing state;

identifying one or more work items in the executing state as a function of the transmitted cancellation request and the execution hierarchical structure of the defined activity; and

canceling the execution lifetime of the activity by transitioning the one or more identified work items from the executing state to the canceling state.

2. The method of claim 1, further comprising transitioning the one or more identified work items from the canceling state to the closed state in response to canceling of the execution lifetime of the activity.

3. The method of claim 1, further comprising providing a set of post-cancellation operations to a user in response to canceling of the execution lifetime of the activity.

4. The method of claim 1, wherein identifying the one or more work items comprises enqueuing the work items to a scheduler queue.

5. The method of claim 4, wherein canceling comprises dequeuing the work items from the scheduler queue to the canceling state.

6. The method of claim 1, wherein the execution hierarchical structure comprises a tree structure, and wherein identifying the one or more work items comprises identifying the one or more work items in the executing state by traversing the tree structure from a lower level in the tree structure to a higher level in the tree structure.

7. The method of claim 1, wherein one or more computer-readable media have computer-executable instructions for performing the method of claim 1.

8. A system for declaratively canceling an activity in a process-centric program, said system comprising:

a memory area for storing data associated with the work items of the activity, said activity organizing the work items in an execution sequence;

a processor configured for executing computer-executable instructions for;

defining a state automaton for the activity, said state automaton including an executing state, a canceling state, and a closed state, said state automaton classifying an execution lifetime of the activity;

defining the activity to include the work items;

transitioning the work items from the executing state to the closed state, said closed state indicating a completion of executing the activity;

upon having one of the work items being transitioned to the closed state, transmitting a cancellation request to one or more of the work items currently in the executing state;

identifying one or more work items in the executing state as a function of the transmitted cancellation request and the execution sequence of the defined activity; and

canceling the execution lifetime of the activity by transitioning the one or more identified work items from the executing state to the canceling state.

9. The system of claim 8, further comprising means for transitioning the one or more identified work items from the canceling state to the closed state in response to the canceled execution lifetime of the activity.

10. The system of claim 8, further comprising means for providing a set of post-cancellation operations to a user in response to canceling of the execution lifetime of the activity.

11. The system of claim 8, wherein the processor is configured to identify the one or more work items comprises enqueuing the work items to a scheduler queue in the memory area.

12. The system of claim 11, wherein the processor is configured to dequeue the work items from the scheduler queue to the canceling state in response to the canceled execution lifetime of the activity.

13. The system of claim 8, wherein the execution sequence comprises a tree structure, and wherein the processor is configured to identify the one or more work items by traversing the tree structure from a lower level in the tree structure to a higher level in the tree structure.

14. The system of claim 8, further comprising means for removing data associated with the work items from the memory area as a function of the canceled execution lifetime of the activity.

15. One or more computer-readable media having computer-executable components for declaratively canceling an activity in a process-centric program, said computer-executable components comprising:

a state machine for defining a state automaton for the activity, said state automaton including an executing state, a canceling state, and a closed state, said state automaton classifying an execution lifetime of the activity;

an activity component for defining the activity to include the plurality of work items, said defined activity organizing the plurality of work items in an execution sequence, each of the work items including a method for executing a portion of the activity;

a scheduler component for transitioning the work items from the executing state to the closed state, said closed state indicating a completion of executing the activity;

a message component, responsive to one of the work items being transitioned to the closed state, for transmitting a cancellation request to one or more of the work items currently in the executing state;

a cancellation handler for identifying one or more work items in the executing state as a function of the transmitted cancellation request and the execution sequence of the defined activity by enqueuing the identified work items to a queue; and

an execution component for canceling the execution lifetime of the activity by transitioning the one or more identified work items from the executing state to the canceling state.

16. The computer-readable media of claim 15, wherein the scheduler component is configured to transition the one or more identified work items from the canceling state to the closed state.

17. The computer-readable media of claim 15, further comprising a user interface (UI) for providing a set of post-cancellation operations to a user in response to canceling of the execution lifetime of the activity.

18. The computer-readable media of claim 15, wherein the cancellation handler is configured to dequeue the work items from the queue to the canceling state.

19. The computer-readable media of claim 15, wherein the execution sequence comprises a tree structure, and wherein the cancellation handler is configured to identify the one or more work items by traversing the tree structure from a lower level in the tree structure to a higher level in the tree structure.

20. The computer-readable media of claim 15, further comprising a cleaning component for removing data associated with execution of the work items as a function of the cancellation of execution lifetime of the activity by the execution component.