MECHANISM AND SYSTEM FOR REPRESENTING AND PROCESSING ACTIVITY MODELS

• US 20130268258A1
• Filed: 03/27/2013
• Published: 10/10/2013
• Est. Priority Date: 04/04/2012
• Status: Active Grant

• Current Assignee: Pilla Gurumurty Patrudu
• Original Assignee: Pilla Gurumurty Patrudu
• Inventors: Patrudu, Pilla Gurumurty
• Granted Patent: US 9,176,951 B2
• Time in Patent Office: Days
• US Class Current: 704/2
• CPC Class Codes: G06F 40/40 Processing or translation of natural language natural language analysis G06F40/20; semantic analysis G06F40/30
• CPC Class Codes: G06N 5/02 Knowledge representation; Symbolic representation

Abstract

This invention (KBM), extends the concept called color, of my previous invention KB (ref-1), to cover process oriented concepts, and linguistic notions. Colors of KBM are now capable of depicting a very wide variety of scenarios of information, biological, and mechanical systems. KBM provides a novel framework (called DSC) for operational modeling, which can be used to compose larger process structures from small process structures. KBM also provides a novel framework for model checking, and for planning a workflow. Thus, KBM may be used to build and execute complex workflows.

Claims

1. ) A method executed by one or more processors, for processing activity models, contained locally or remotely on one or more processor readable storage devices, wherein,

rules called KBM rules which were devised to depict complex processing scenarios, may be further integrated into larger process structures, by a framework called KBM DSC framework, which facilitates integration of process structures of lower order to process structures of higher order, recursively, until higher level process structures called “

Activities”

are generated, and wherein,

said KBM activities may be grouped into a set of sequential or concurrent activity blocks, called KBM workflow,

such that

said KBM workflow may depict the activity flow of a complex application system or subsystem, and may be executed to accomplish the goals of the application system or subsystem.

2. ) The method of claim 1, comprises:

a) Augmenting the method of the system called KB, for representing and processing static and dynamic information, wherein the improvement comprises of—

a new set of colors called reference colors, which are devised for augmenting reference mechanisms of entities,

a new set of colors called complex colors, which are used for depicting complex processing notions,

a new set of colors called process colors, which are used for depicting effects of process structures on entities,

new specialized structural rules called KBM Structural rules, for structuring the integration of said KBM rules,

an enhanced O-Context, wherein each entity type, can hold a plurality of entity references, segregated into partitions, called data sets.

an extensible framework for creating new color types, and mapping these colors to said KBM rules.

Said reference colors, complex colors, process colors, and conceptual colors are collectively referred to as KBM colors.

Type-1 thru Type-6 rules of said KB system, may be further enhanced by utilizing said KBM colors.

3. ) The method of claim 2, comprises:

a) Assigning a type of reference color called “

Instance Id”

color, to terms of KBM rules, which implies, that an entity reference having the unique identification token, specified in the color value, is sought for the term of the KBM rule.

b) Assigning a type of reference color called “

Data Set”

color, to terms of KBM rules, which implies, that entity references restricted to the partition or logical grouping implied by the data set color, are sought for the term of the KBM rule. Said entity references of the terms of KBM rules are stored in a container capable of providing said partitions or logical groupings.

c) Assigning a type of reference color called “

local reference”

color, to terms of KBM rules, which implies that entity references held dynamically in a cache or special storage mechanism, of the parent entity, are sought for the term of the KBM rule, for which the color value is specified. Said parent entity is capable of holding several said cache storages simultaneously, and said local reference color, provides identification of the cache to be used for retrieving the entity references of the term of the KBM rule.

d) Assigning a type of complex color called “

category color”

to terms of KBM rules, which implies, that an entity reference possessing a predefined set of features, and/or relations or bindings with other entities, and/or a pre-specified rank or metric among a plurality of entity references, which are applicable or available for the term of the KBM rule, is sought for the term. Said features, relations, bindings, rank, or metric may be encoded as a kbm rule, and may be associated with the said category color.

e) Assigning a type of complex color called “

form color”

, which implies, that an entity reference possessing a predefined set of features, and/or relations or bindings with other entities, is sought for the term. Said features, relations, bindings, may be encoded as a kbm rule, and may be associated with the said form color.

f) Assigning a type of complex color called “

model color”

, which implies, that the an entity reference, whose sub entities have a predefined arrangement with respect to each other and with respect to their parent, is sought for the term. Said arrangements, may be encoded as a kbm rule, and may be associated with the said model color.

g) Assigning a type of complex color called “

capability color”

, which implies, that an entity reference, which has a set of capabilities, is sought for the term. Said capabilities may be defined directly as features or attributes of the entity, or defined indirectly as meta data or via a token called taxonomy identification, and may be encoded as a kbm rule, and may be associated with the said capability color.

h) Assigning a type of complex color called “

characteristics color”

, which implies, that an entity reference possessing a predefined set of dynamic characteristics, is sought for the term. Said characteristics, may be encoded as a kbm rule, and may be associated with the said characteristics color.

i) Assigning a type of complex color called “

binding color”

, which implies, that an entity reference possessing a predefined set of bindings, is sought for the term. Said bindings, are stored as parameters in the entity configuration files. Said bindings may be further constrained by and features, relations, characteristics of the source and the target of the binding, which may be encoded as a kbm rule, and may be associated with the said binding color.

j) Assigning a type of complex color called “

procedure color”

, which depicts the source for entity references of the entity type specified for the term of a rule. Said source is typically encoded as a class, method, and method color.

k) Mapping a path of execution of a process structure to a type of color called “

process execution color”

, which depicts the runtime state of the process structure.

l) Assigning a color value of color type called “

functional color”

to entity references participating in a process structure, based on process execution color of the process structure and optionally the previous color values for the functional color type, already acquired by the entities. Said functional color type implies a map from old functional color values and current process execution color to new functional color values.

m) Assigning a color value of color type called “

transformational color”

to entity references participating in a process structure, which implies, that said entity reference, acquired a set of predefined functional colors, in succession.

n) Assigning a color value of color type called “

disposition color”

to a process structure, which implies, that the entities of the said process structure possess a characteristic called plasticity, which guides the entities towards a particular path, among a plurality of possible paths for the process structure.

o) Assigning a type of color called “

mode of processing”

to process structures, which implies that the process structure is to utilize a predefined set of process control values, which are collectively identified by the mode of processing color.

p) Mapping said complex colors like “

category color”

, “

form color”

, “

model color”

, “

capability color”

, “

binding color”

, and “

characteristic color”

to KBM rules, by a mapping document called “

Entity Maps”

, which is provided as part of configuration of the entity bearing the said color. Said KBM rules associated with said colors are called colored rules, and can in turn contain terms having said complex colors, and so on in a recursive manner.

q) Applying a set of operators called KBM operators, to terms of said KBM rules, for determining existence of entities, assigning characteristics, for binding entities, and for assigning colors.

r) Assigning type called Type-7A to said KBM rules, wherein the terms of said Type-7A rule, may represent fields with or without method invocations or any of Type-1 thru Type-9 rules of KB/KBM, with or without KBM colors, and any of said KBM operators.

s) Assigning type called Type-7C to said KBM rules, wherein the terms of said Type-7C rule, may represent fields with or without method invocations or any of Type-1 thru Type-9 rules of KB/KBM, with or without KBM colors, and employ logical operators and return Boolean values as output.

t) Assigning type called Type-7E to said KBM rules, wherein the terms of said Type-7E rule, may represent fields with or without method invocations or any of Type-1 thru Type-9 rules of KB/KBM, with or without KBM colors, and any of said KBM operators. Said Type-7E rules can receive the process execution color of another kbm rule, for which this rule is configured as effect rule.

u) Assigning type called Type-8 to said KBM rules, wherein said Type-8 rule comprises of two terms, which are Type-7A rules, wherein the terms of the first Type-7A rule, may be depicted by Type-4 or Type-5 KB rules, and the terms of the second Type-7A rule may be depicted by Type-7A rules, such that the arrangement represents a case block.

v) Assigning a Type called Type-9 to said KBM rules, wherein the said KBM rule is assigned a group rule id, and all such kbm rules possessing the same group rule id, may be invoked by the group rule id. The execution of the Type-9 kbm rule, comprises of selecting one of the kbm rules of the group, whose terms on the RHS side of the expression are satisfied by the current state of the application contexts, and returning the LHS as the result of execution of the rule.

w) Assigning a structural rule called horizontal structural rule to a kbm rule, which defines the order of determination of the entity references and their dependencies in a “

nested-for”

, format.

x) Assigning a structural rule called vertical structural for each term of the said rule, which defines the order of evaluation of the said colored rules and their dependencies in a “

nested-for”

, format. The dependencies of said colored rules are defined as source-colored-rule, term-of-source-colored-rule, and target-colored-rule, term-of-target-colored-rule.

y) Said Type-7A/7C/7E, 8, 9 KBM rules, along with said Type-1 thru Type-6 KB rules employing KBM colors, are collectively regarded as KBM rules.

4. ) The method of claim 1, comprises:

a) Integrating process structures of any granularity into graphs, whereby said KBM rules may be integrated into KBM rule graphs, and said KBM rule graphs may be further integrated into KBM gears, and said KBM Gears may be further integrated into Activities, such that

a path reached by the graph of a process structure during execution, may be assigned a state called desired, or special or complex.

b) Linking process structures to each other based on the state reached, such that a desired state reached by a process structure may optionally link to another process structure.

c) Linking process structures to each other based on the state reached, such that a special state reached by a first process structure is always linked to a second process structure, except when the first process structure is a leaf node of the graph, or when a higher level structure containing the first process structures as child process structure, undertakes the responsibility to handle the special state reached by the first process structure as its own special state.

d) Linking process structures to each other based on the state reached, such that a complex state reached by a process structure called original process structure is always linked to another new process structure, wherein the new process structure or its descendents link back to the said original process structure, whenever they reach a state marked as desired state.

Accordingly, said KBM rule graphs and said KBM Gears may possess desired, special or complex states;

whereas said KBM activities may possess desired or special states.

5. ) The method of claim 1, further comprises of—

a) Translating said KBM rules to statements of a predefined host language, by a predefined software module called KBM Translator, whenever said KBM colors are encountered, in the said rule, which is under translation. Said KBM translator, is invoked by the Translator of said KB system, whenever said KBM colors or operators are encountered. Said KB Translator holds a plurality of runtime control parameters like Collaboration parameter (Clbparm), Equation Info (EqtInfo).

b) Translating said KBM colors by said KBM Translator, wherein a sequence number called color-dft-seqnum is assigned to each colored rule, by traversing each colored rule, due to colors of terms of the rule, in a depth-first-traversal (dft) order. The main rule is assigned a predefined value of zero.

c) Generating a method referred to as “

EntityRefs”

method, to determine the applicable entity references for the terms of a KBM rule, based on horizontal structural rule specification, such that said entity references are now available for said KBM colored rules, which may come into effect due to said KBM color specification, for the term of the KBM rule being translated.

d) Translating said KBM colors by said KBM translator, wherein said KBM colors of a term are translated as methods, and these methods are held in a outer containing object, such that special methods called “

driver” and

“

controller”

generated as part of the translation could control the execution of the generated methods, based on the structuring requirements specified by the end user, as vertical structure rule for the term.

e) Executing said KBM rule, whereby the code generated by the KB Translator when executed, invokes said EntityRefs method generated by said KBM Translator for determining the entity references of the terms of the said KBM rule being executed.

Said EntityRefs method generated, utilizes a specialized data structure called Entity cache, which is held in said runtime control parameter of KB called clbparm, for storing said entity references and said procedure object references of the terms of the said KBM rule, and a set of flags called Invalidate flags, which indicate if a term of the said KBM rule is still valid, along with the cdft-seq number and the dft seqnumber of the said KBM rule.

6. ) The method of claim 5, comprises:

a) Retrieving prior recordings of the entity references, and procedure object references, data set indexes, and invalidate flags from the said Entity cache by utilizing the said colored dft seq number and the said dft seq number of the said KBM rule.

b) Evaluating the procedure reference objects of the terms of said KBM rule, by creating the objects depicted by the respective procedure colors, when said procedure colors are specified for the terms.

c) Retrieving the current entity reference by invoking the get current object method of the said procedure object reference, when said term has procedure color, and when the said entity cache has the said procedure object reference, and if it is the first time, the entity reference of the term is being evaluated, and the invalidate flag of the term is not set.

d) Retrieving the next entity reference by invoking the get next object method of the said procedure object reference, when said term has procedure color, and when the said entity cache has the said procedure object reference, and if it is not the first time, the entity reference of the term is being evaluated, or if the invalidate flag of the term is set.

e) Retrieving the next entity reference by invoking the get next object method of the said procedure object reference, when said term has procedure color, and when the said entity cache has no entry for the current rule, or if it is not the first time, the entity reference of the term is being evaluated.

f) Evaluating the entity references of the terms of the rule, by retrieving the elements of the data sets depicted by the data set colors, in the collaboration object depicted by the term of the rule, when said data set colors are specified for the term. Said evaluation comprises of;

Retrieving the current entity reference, when the said entity cache has entry for the current rule, and if it is the first time, the entity reference of the term is being evaluated, and the invalidate flag of the term is not set.

Retrieving the next entity reference, when the said entity cache has entry for the current rule, and if it is not the first time, the entity reference of the term is being evaluated, or if the invalidate flag of the term is set.

Retrieving the next entity reference, when the said entity cache has no entry for the current rule, or if it is not the first time, the entity reference of the term is being evaluated.

g) Evaluating the entity reference by retrieving the elements of the last data set of the collaboration object depicted by the term of the rule, when neither a procedure color or a data set color are specified for the term.

h) Storing the said entity reference obtained either by the procedure color or the data set color, or from the default dataset, in a temporary data set called the temp data set, whose name is augmented by the said color-dft-seq-num of the rule, and the dft-seq-num of the rule.

i) Evaluating the said colors of the rule, by executing kbm rules associated with the colors, such that said kbm colored rules could now utilize the entity references determined by the evaluation of the said procedure color or data set color or their default.

j) Invoking the said driver method of the outer containing object, which has the code generated for the kbm colored rules, as methods.

k) Repeating the process, for each term of the said KBM rule, by retrieving entity references from the procedure implied by the procedure color or from the data sets implied by the data set color of from the default data set color, and evaluating the colored rules by invoking the said driver method associated with the container of the colored rules, until there are no more entity references in any of the sources, or an entity reference of the term, has satisfied the requirements of the colored rules specified for the term, and returned a Boolean true value.

l) Executing the reset method of the procedure object, and setting the object reference is to null, and the data set index is set to zero, when none of the entity references, implied by the procedure color or data set colors or default, satisfied the requirements of the colored rules specified for the term.

m) Invalidating the procedure object reference, if the term has specified a procedure color, when none of the entity references, implied by the procedure color or data set colors or default, satisfied the requirements of the colored rules specified for the term.

n) Invalidating the object reference, of the previous term, and transferring control to the label of the previous term, if a previous term exists, and if none of the entity references, implied by the procedure color or data set colors or default, satisfied the requirements of the colored rules specified for the term.

o) Copying the said entity reference in the temporary data set called the temp data set, which is augmented by the said color-dft-seq-num of the rule, and the dft-seq-num of the rule, to a new data set called “

save”

data set, of the collaboration object, implied by the term of the rule, when the said driver has returned a Boolean true value, implying that all the colored rules were evaluated satisfactorily, that is, all the specified colors are applicable to the current entity reference.

p) Saving said entity references and said procedure object references of the terms of the said KBM rule, and said Invalidate flags, along with the colored-dft-seq number and the dft seqnumber of the said KBM rule, in said Entity cache, when entity references of all the terms of the said rule are established.

q) Returning control to the caller, after setting special flags in the control parameters, indicating a failure to establish entity references, if a previous term does not exist, and if none of the entity references, implied by the procedure color or data set colors or default, satisfied the requirements of the colored rules specified for the term.

7. ) The method of claim 5, further comprises of—

a) Checking for the invalidate flag of the said procedure object reference, which is held by the said procedure object itself as an internal attribute or field, before invoking the get current or get next object methods of the procedure object.

b) Re-establishing the said procedure object reference, by invoking the method generated for the procedure color, and establishing an object reference by invoking the get next object reference, when the invalidate flag is set to true.

8. ) The method of claim 5, further comprises of—

a) Retrieving the vertical structural rule specified for the term of the rule, and splitting it into constituents comprising of source rule, source term, destination rule, destination term, wherein, said source rule and said destination rule are colored rules, and correspond to colors of the current term being evaluated, such that an object called Vertical dependency, which comprises of the said source rule, source term, destination rule, destination term is created for each constituent of the said vertical structural rule specification.

b) Storing said Vertical dependency objects created from the said vertical structural rule, in an object called Vertical Structural Rule Object.

c) Creating an object based on said Vertical dependency template, for each kbm color specified for the current kbm term of the said kbm rule, and adding the newly created objects to a vector called the dynamic rules vector, wherein, fields corresponding to source rule and source term of the object are set to −

1, and the field corresponding to destination rule is set to the current kbm color, and the field corresponding to destination term is set to −

1.

d) Said dynamic rules vector, provides abilities to inject colored rules into the execution stream, based on vertical dependencies specified for the colors of the term.

e) Invoking a method called controller, which executes the colored rules, associated with the colors of a term.

f) Checking for the size of the dynamic rules vector, and terminating the process, and returning to the caller, when the dynamic rules vector reaches a size of 0.

g) Sorting the dynamic rules vector, based on the destination id field, wherein elements of said dynamic rules vector, hold the destination id field.

h) Repeating steps “

e thru g”

until the size of the dynamic rules vector reaches zero, and returning a Boolean true value, when all colored rules executed produced a Boolean true value, and returning a Boolean false value, when any colored rules executed produced a Boolean false value.

9. ) The method of claim 8, further comprises of—

a) Retrieving vertical dependency objects from the dynamic rules vector, until a control break occurs on the destination rule, and deleting all such objects from the dynamic rules vector, and executing the colored rule depicted by the destination rule id.

b) Checking for the status of the execution of the said colored rule, by inspecting the special flags in the control parameters, which could indicate a failure to establish entity references, and when such a failure is detected, said vertical dependencies of the currently failed rule are retrieved from the Vertical Structural Rule Object, and added to the dynamic rules vector, along with the current colored rule, which has failed.

c) Updating the status of execution of the colored rule in a vector called results vector, which is vector of Boolean variables.

10. ) The method of claim 9, further comprises of—

a) Searching the Vertical Structural Rule Object, and obtaining the target destination id, when the source rule id of an element of Vertical Structural Rule Object, matches the colored rule id, which has failed.

b) Said target destination id is then used to search the Vertical Structural Rule Object, and the source rule id fields of the matched rows, are retrieved as additional dependencies.

c) Invalidating the procedure object reference of the term, which failed, if the term has a procedure color.

d) Invalidating the procedure object reference of the term depicted by the said target destination id, and all terms in the rule of the said target destination id, which have a term id higher than the target destination id; and

repeating the same procedure for each of the said additional dependencies.

11. ) The method of claim 1, further comprises of—

a) Translating said KBM Rule Graphs, KBM Gears, and KBM Activities, which are process structures of higher granularity, into class files called process structure code files.

b) Said process structure code files, comprises of a set methods, to invoke the translated process structures of lower order, a special method called init to initialize the internal storage variables used by the process structure code file, and a special method called finish which performs the necessary house keeping, before termination.

c) Generating code to determine the process execution color based on the execution path of the process structure graph, and the configuration defined in the process structure table.

d) Generating code to determine the functional color of the entities participating in the process structure based on the execution path of the process structure graph, when a functional color is defined for the process structure in the functional color table.

e) Generating code to determine the transformation color of the entities participating in the process structure based on the functional colors of the entities of the process structure, when a transformational color is defined for the process structure in the functional color table.

12. ) The method of claim 1, further comprises of—

a) Capturing a request for executing said KBM workflow, when an online or batch request is made by the end user, and recording it in a queue called KBM Workflow queue. Said request comprises of name of workflow and information regarding the key fields of the entities that could participate in the processing of the workflow.

b) Retrieving the request for executing the Workflow from the said KBM Workflow Queue, by a predefined software module called KBM WorkFlow Coordinator, supplied as part of KBM runtime, and tools, which schedules and controls the execution of KBM Workflows.

c) Retrieving the Workflow specification document, based on the workflow name received as input in the said KBM Workflow queue record.

d) Parsing said Workflow document, and identifying the activity blocks, which are scheduled for execution.

e) Scheduling the activity contained in the next block for execution if said block is enclosed in special tags called “

SEQ”

, which imply that the activity is to be executed in sequential order, by creating an instance of the activity module to be executed, and executing the init method, and subsequently the process method, and creating a record in the WorkFlow Execution status table, indicating that the activity was scheduled for execution.

f) Scheduling all the activities contained in the next block for execution if said block is enclosed in special tags called “

CONCUR”

, which imply that the activities are to be executed in concurrent order, by repeating the process described for said single activity delimited by “

SEQ”

tags, for each of the activities specified in the block, delimited by the “

CONCUR”

tags.

g) Executing the process structures of lower order contained in the current process structure recursively, by executing their and init, process and finish methods, until the current activity being executed, reaches a desired or special state.

h) Updating said KBM Workflow Execution status table, when activities scheduled by workflow coordinator for the said KBM Workflow, have reached a desired or special state.

i) Monitoring the Execution status of the activities already scheduled for execution by the said KBM Workflow coordinator, based on a preset timer.

j) Scheduling the next workflow block of the current workflow for execution, if all the activities of the current workflow block have reached a desired state.

k) Updating said KBM Workflow Execution status table, with the completion status of the workflow, when all activities scheduled by workflow coordinator for the said KBM Workflow, have reached a completion state.

13. ) The method of claim 12, further comprises of—

a) Generating a record called Activity Failure record, for each of the activities of the current workflow block, which have reached a special state, and writing the said Activity Failure record to a queue specified for the special state of the activity, in the activity configuration file.

b) Said Activity failure record may be the result of failure of a KBM Gear of the failed activity, and may be derived from an object called Gear Failure record, which is generated by a KBM gear of said activity when it has failed, and reached a special state, and when that the special state reached is not connected to another KBM gear, but is handled by the activity, which is the container for the said failed KBM Gear.

18. ) The system of claim 16, further comprises:

a) Means for implementing the method recited in claim 1

b) Means for implementing the method recited in claim 14.

14. ) A method for determining the conceptual model of an activity, wherein,

specialized entities called conceptual entities are employed to depict conceptual structures, and effects of processing on real entities, and wherein,

states of particular aspects of a subset of said conceptual entities called macro entities, may yield new states, owing to the conceptual execution of said activity, such that

a sequence of activities called KBM workflow, may be determined from an initial set of macro entities and the states of their aspects, and a final set of macro entities and the states of their aspects called goal, by a framework called KBM workflow planning, which comprises:

a) Assigning a type to said conceptual entity, whereby said conceptual entity may be classified as entity, process, or wrapper, and wherein the entity type may be further sub classified as component, port, fluent, signal, channel, connector, event or concept.

b) Storing Conceptual entities in memory by means of a predefined data structure called Conceptual object data structure, which assists in accessing and manipulating the contents of the data structure.

Said components may store other components, ports, fluents, characteristics, and functions. Said ports store channels or connectors as components. Said channel or connector stores source and target components as components, and source and target ports as ports. Said conceptual entities of all types store their colors, characteristics, in KBMAdapter.

c) Associating complete or partial paths of execution of said KBM rule graphs or any generic process structure with novel functions called conceptual Mu-Functions, which operate on said conceptual entities.

Said Mu-Functions, operate on conceptual entities and perform operations such as, create, morph, delete, bind, unbind, move, insert, remove, send, receive, increase, decrease, set, reset, compute, perform, start, stop, pause, publish, subscribe.

d) Compiling a list of applicable Mu-functions, for a particular path of KBM activity based on contained KBM gears, and the contained KBM graphs within the said contained KBM gears, based on specifications in a table called process structure table.

e) Executing the said Mu-functions compiled for an activity from the contained KBM Gears and KBM Rule graphs, and a pre-specified initial configuration of conceptual entities, which when executed yields a transformed configuration of the initial configuration, in terms of conceptual entities.

f) Evaluating said configuration further by a set of predefined kbm rules, of said macro entities, to yield states of particular aspects of macro entities.

g) Storing the state switching behavior of said activities with respect to said aspects of the said macro entities, in the form of a table, called Activity Switching table.

15. ) The method of claim 14, further comprises of—

a) Creating a node called “

root”

planning node and storing the said initial planning state in the root-planning node. Said root node is set as current planning node, to assist recursive processing.

b) Searching the entries of said Activity Switching table, for the planning state, in the current planning node, such that all the states of aspects of macro entities of a starting planning state of an entry of the said Activity Switching table, are covered by the said current planning state. The activities of said entries, which matched, are stored in current planning node, along with the disposition and mode of processing colors.

c) Creating planning nodes, for each of the target states depicted by the said entries of the Activity Switching table, which matched the current planning state, and adding these nodes as child nodes of the current planning node.

d) Recursively processing the newly created planning nodes, as stated above, and expanding the planning node set as a graph called “

Abstract Planning Graph”

, until the goal state is reached.

e) Storing the “

Abstract Planning Graph”

in a persistable storage.

f) Pruning the branches or arcs of the said “

Abstract Planning Graph”

, if they do not lead towards to the goal state, by assigning bit values to branches. Said pruning is accomplished by traversing the graph from the goal node, and assigning bit values to branches which are in the path towards the root node.

g) Creating a graph called “

Concrete Planning Graph”

, by traversing the said “

Abstract Planning Graph”

from the root, and by taking into consideration the pruned branches via the said bit values, and persisting the said Concrete planning graph to persistable storage.

h) Compiling input requirements by taking into consideration, the input requirements of the activities of the said “

Concrete Planning graph”

, and any interdependencies that may exist owing to data base schemas. Said activities depict their input requirements, and a special gear called planning gear in their configuration documents.

i) Capturing the inputs from the user, using said input requirements complied from the said “

Concrete Planning graph”

.

j) Traversing the said “

Concrete Planning graph”

, from the root, by executing the planning gears associated with said activities of planning nodes.

k) Preserving the bit values of only those branches, which correspond to the activity and the disposition color determined by the planning gear, and setting the rest of the bit values of the planning node to zero.

l) Selecting activities in the path from root to final goal, of the said “

Concrete Planning graph”

, as possible workflows, wherein only those branches, which correspond to the activity and the disposition color determined by the planning gear, are regarded as viable.

16. ) A system, stored in a non-transitory computer readable medium, called Knowledge Base Modeler (KBM), including computer usable program code for processing Activity Models, wherein,

rules called KBM rules, which were devised to depict complex processing scenarios, and which utilize the norms employed for representing and processing the static and dynamic information of the KB system,

may be further integrated into larger process structures, by a framework called KBM DSC framework, which facilitates integration of process structures of lower order to process structures of higher order, recursively, until higher level process structures called “

Activities”

are generated, and wherein,

specialized entities called conceptual entities are employed to depict conceptual structures, and effects of processing on real entities, and wherein,

states of particular aspects of a subset of said conceptual entities called macro entities, may yield new states, owing to the conceptual execution of said activity,

such that

a sequence of activities called KBM workflow, may be determined from an initial set of macro entities and the states of their aspects, and a final set of macro entities and the states of their aspects called goal, by a novel framework called KBM workflow planning, and

said KBM workflow which may depict the activity flow of a complex application system, may be executed to accomplish the goals of the application system, comprises;

a) A tool called KBM translator, means for translating—

said KBM rules, utilizing said KBM colors, and

process structures derived recursively from said KBM rules, like KBM rule graphs, KBM Gears and KBM activities to equivalent statements of a predetermined host language.

b) A tool called KBM Planner, means for—

determining a sequence of activities, based on an initial, and goal planning states, wherein, said planning state comprises of a states of aspects of a set of Macro entities.

c) A plurality of tables called KBM tables, means for storing—

predefined configurations and associations, of said KBM colors, KBM rules, and process structures; and

a plurality of Configuration files called KBM Configuration files, means for storing—

predefined configurations and associations, of said KBM colors, KBM rules, and process structures.

d) A plurality of modules called KBM tools and Runtime, means for supporting user activities and code generated by said KBM Translator, for said KBM rules, and said process structures like KBM rule graphs, KBM Gears, and KBM activities, for a predefined host language.

e) Means for storing the configuration of colors and their mappings to KBM rules, in a predefined configuration document, called Entity Maps document.

f) Means for storing mappings of abstract entity specified with taxonomy and auxiliary colors, and a token, or an interaction of several abstract entities with taxonomy and auxiliary colors to a semantic role and method of the abstract entity.

g) Means for storing the mapping of semantic role and method of an abstract entity to a kbm rule, and its verb color.

h) Means for storing conceptual objects in memory, for processing.

i) Means for storing the configuration of KBM rule graphs, and their states and effects, in a predefined configuration document called the KBM Rule Graph document.

j) Means for storing the configuration of KBM Gears, and their states and effects, in a predefined configuration document called the KBM Gear document.

k) Means for storing the configuration information for the operational model of said KBM activities, and their states, in a predefined configuration document called the Operational description of KBM Activity.

l) Means for storing the configuration information for the conceptual model of said KBM activities, in a predefined configuration document called the Conceptual description of KBM Activity.

m) Means for storing the configuration information for the deployment of said KBM activities, in a predefined configuration document called the Deployment description of KBM Activity.

n) Means for storing the configuration information of said KBM Workflow, in a predefined configuration document called the description of KBM WorkFlow.

o) Means for storing KBM rules in a predefined table called KBM rules table, wherein, the columns of KB rules are table are inherited, and new columns comprising of Unique Rule id, Group rule id, Type of output, Type and name of color, effect rule, function handler class name, are added to support the functionality of the KBM system.

p) Means for storing the structural rules in a predefined table called the structural rules table.

q) Means for storing the Collaboration objects in memory by said partitions called datasets, in a data structure called the CObject structure. Said KBM rules are executed against said collaboration objects held in a table called O-Context, which employs said CObject structure, to store a plurality of entity references partitioned as data sets.

r) Means for storing the effects of process structures on entities as functional and transformation colors.

s) Means for storing the configuration information of Macro Entities, in a predefined configuration document called the Macro Entity Description document.

t) Means for storing the execution status of kbm workflows, and their activities in a predefined table called KBM Workflow execution status table.

u) Means for storing the transformation of states of aspects of macro entities by activities, in a predefined table called Activity Switching table.

v) Means for storing the mapping of a higher level process structure to lower level process structures, in a table called the Process Structure table.

w) Means for receiving as input, a request for executing a KBM Workflow, wherein a queue entry in a predefined queue called KBM Workflow queue, is created by an online or batch program, which is initiated by the end user.

x) Means for storing Activity failure records in a queue specified by the end user in the configuration files of the said Activity, when the activity reaches a special state, for which the queue is configured.

17. ) The system of claim 16, further comprises:

a) Means for parsing the various configuration files.

b) Means for invoking a predefined KBM runtime software module, called KBM WorkFlow coordinator, whenever a new entry is made in the said KBM WorkFlow queue, by message queuing software systems.