Processing logic modeling and execution

Abstract

Provides processing logic modeling and executing methods, systems and apparatus. These facilitate collaboration between business analyst and IT staff for process modeling and maintenance of the consistency between business level design and IT implementation design. A task is decomposed into sub-tasks and is represented by a tree. Annotations to the nodes of the tree are used to represent the relations between the sub-tasks. A processing logic is thus completed. When executing the processing logic, traversing the tree follows according to the annotations.

1 . A processing logic modeling method for modeling a task, comprising: 
 a decomposing step for decomposing said task into at least one level of sub-tasks;    a tree structure forming step for forming a tree structure from said task and various levels of sub-tasks resulted from decomposing the task; and    an annotating step for, according to the relations between the sub-tasks, annotating the nodes of the tree, thus obtaining a processing logic model for performing said task.    
     
     
         2 . The method according to  claim 1 , wherein said tree structure forming step comprises: forming leaf nodes comprising at least one of action node and sub-logic node, wherein, the action node corresponds to atomic action program that could be invoked, and the sub-logic node corresponds to sub-logic that could be invoked.  
     
     
         3 . The method according to  claim 2 , wherein the step of forming leaf nodes comprises at least one of action node and sub-logic node, and further comprises: 
 defining the interface description of the action node and/or sub-logic; and    binding the implementation modules of the action and the sub-logic according to said interface description.    
     
     
         4 . The method according to  claim 1 , wherein said annotating step comprises attaching at least one of the following annotations: 
 precondition defining the condition to be met for performing the corresponding node;    postcondition defining the condition to be met for leaving the corresponding node;    pre-task defining the task to be performed before performing the corresponding node;    post-task defining the task to be performed before leaving the corresponding node; and    the type of intermediate node, stipulating whether the children of the intermediate node should be performed sequentially or in parallel.    
     
     
         5 . A method for executing the processing logic established according to  claim 1 , comprising: 
 traversing the tree according to the annotations, and    performing the leaf nodes of the tree according to the annotations, thus completing the execution of the task.    
     
     
         6 . The method according to  claim 5 , wherein the leaf nodes of the tree comprises at least one of action node and sub-logic node, wherein, invoking atomic action program when executing the action node, and invoking sub-logic when performing the sub-logic node.  
     
     
         7 . The method according to  claim 5 , wherein said annotations includes at least one of the following: 
 precondition defining the condition to be met for performing the corresponding node;    postcondition defining the condition to be met for leaving the corresponding node;    pre-task defining the task to be performed before performing the corresponding node;    post-task defining the task to be performed before leaving the corresponding node;    the type of intermediate node, stipulating whether the children of the intermediate node should be performed sequentially or in parallel.    and the method further comprises:    when the traversing reaches a node, checking its annotations, and determining whether to perform the node according to said precondition and whether to leave the node according to said postcondition, executing the pre-task before executing the node according to the pre-task, executing the post-task before leaving the node according to the post-task, and, according to the type of the node, determining whether a depth-first traversing algorithm or a broadness-first traversing algorithm should be performed with respect to the children of the node.    
     
     
         8 . A processing logic modeling apparatus to model a task, comprising an editor comprising: 
 a tree editor, for editing a tree corresponding to a processing logic and showing how the task is decomposed into at least one level of sub-tasks;    annotation editor, for editing annotations for the nodes of the tree, the annotations representing the relations between the nodes of various levels; and    interpreter, for mapping the tree and the annotations into script of the processing logic.    
     
     
         9 . The apparatus according to  claim 8 , wherein, said editor further comprises a graphical user interface, on which various graphical elements are provided or defined by the user, graphics representing the tree and the annotations are edited with said tree editor and said annotation editor on the graphical user interface by using said graphical elements, and said interpreter comprises means for mapping a predetermined graphical element into a predetermined script section.  
     
     
         10 . The apparatus according to  claim 9 , wherein said graphical elements includes graphical elements corresponding to the tree structure and graphical elements corresponding to the annotations.  
     
     
         11 . The apparatus according to  claim 9 , wherein said graphical elements includes formatted text.  
     
     
         12 . The apparatus according to  claim 8 , further comprising a debugger for simulatively performing the processing logic, either automatically or manually, either globally or locally, so as to find out and display the potential bug in the resulted processing logic.  
     
     
         13 . A processing logic executing apparatus comprising an identifying means for identifying the annotations in the processing logic script produced by the processing logic modeling apparatus according to  claim 8 , so that the executing apparatus traverses the tree according to the annotations and executes the processing logic.  
     
     
         14 . An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing modeling of a task, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of  claim 1 .  
     
     
         15 . An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing execution of the processing logic, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of  claim 5 .  
     
     
         16 . A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for executing the processing logic, said method steps comprising the steps of  claim 5 .  
     
     
         17 . The method according to  claim 1 , wherein: 
 said tree structure forming step comprises: forming leaf nodes comprising at least one of action node and sub-logic node, wherein, the action node corresponds to atomic action program that could be invoked, and the sub-logic node corresponds to sub-logic that could be invoked;    the step of forming leaf nodes comprises at least one of action node and sub-logic node, and further comprises: 
 defining the interface description of the action node and/or sub-logic, and  
 binding the implementation modules of the action and the sub-logic according to said interface description; and  
   the annotating step comprises attaching at least one of the following annotations: 
 precondition defining the condition to be met for performing the corresponding node;  
 postcondition defining the condition to be met for leaving the corresponding node;  
 pre-task defining the task to be performed before performing the corresponding node;  
 post-task defining the task to be performed before leaving the corresponding node; and  
 the type of intermediate node, stipulating whether the children of the intermediate node should be performed sequentially or in parallel.  
   
     
     
         18 . The method according to  claim 5 , wherein: 
 the leaf nodes of the tree comprises at least one of action node and sub-logic node, wherein, invoking atomic action program when executing the action node, and invoking sub-logic when performing the sub-logic node;    said annotations includes at least one of the following: 
 precondition defining the condition to be met for performing the corresponding node;  
 postcondition defining the condition to be met for leaving the corresponding node;  
 pre-task defining the task to be performed before performing the corresponding node;  
 post-task defining the task to be performed before leaving the corresponding node;  
 the type of intermediate node, stipulating whether the children of the intermediate node should be performed sequentially or in parallel.  
   and the method further comprises: 
 when the traversing reaches a node, checking its annotations, and determining whether to perform the node according to said precondition and whether to leave the node according to said postcondition, executing the pre-task before executing the node according to the pre-task, executing the post-task before leaving the node according to the post-task, and, according to the type of the node, determining whether a depth-first traversing algorithm or a broadness-first traversing algorithm should be performed with respect to the children of the node.  
   
     
     
         19 . A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing modeling of a task, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of  claim 8 .  
     
     
         20 . A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing functions of a processing logic executing apparatus, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of  claim 13.