Token based control flow for workflow

A method of managing tokens at a join node, the method comprising:

• receiving an incoming token stream;
• generating a token based on a last consumed token;
• and
• appending a maximum of the incoming token stream and the last consumed token.

A method of managing tokens at a join node, the method comprising:

• receiving an number “n” of incoming tokens;
• identifying a first maximum of the incoming tokens;
• generating a token based on a last consumed token;
• identifying a second maximum of the first maximum and the last consumed token;
• and
• appending a third maximum of the second maximum and the generated token.

A method of managing tokens by a join node from a loop back edge, the method comprising:

• receiving an incoming token stream;
• generating a token based on a last consumed token;
• consuming the incoming token based on a join node id;
• identifying a maximum between the consumed token and the last consumed token;
• and
• appending the maximum and the generated token.

A method of determining a maximum value of two workflow tokens, one of which is an incoming token, wherein the tokens identify a path of work through a process having multiple nodes, the method comprising:

• identifying a substring from each token such that all identified nodes in both tokens are equal;
• comparing the substrings sequentially using the value associated with each node from each substring to find the maximum;
• and
• modifying the incoming token to be the maximum.

A workflow engine comprising:

• a token representing a path that work follows through a process;
• a construct module that modifies tokens corresponding to the work;
• and
• an activity module in the path that receives and forwards the tokens as work is being performed in the process.

A workflow engine comprising:

• means for generating a token for a piece of work to be performed in accordance with a process;
• means for selectively incrementing a token value as work flows through nodes of the process;
• means for adding a node id to a token as it passes through the node;
• and
• means for consuming tokens at selected nodes.

A workflow engine comprising:

• a processor;
• a memory having a workflow program for executing on the processor;
• means for inputting status of workflow;
• and
• multiple tokens representing paths that work follows through multiple nodes of a process, wherein the program has a first module that manages tokens based on a node type, and the path taken by a token coming into the node modifies tokens corresponding to the work.

A method of managing a workflow token in a join node, the method comprising:

• generating a token;
• storing previous token values;
• adding a unique join id to a token;
• and
• consuming tokens.

A method of managing a workflow token in a split node, the method comprising:

• generating a token;
• storing previous token values;
• and
• adding a unique split id to a token;
• and
• consuming tokens.

A method of controlling workflow using tokens that identify paths taken by work progressing through a process comprising multiple nodes, the method comprising:

• receiving a token having a value and id corresponding to a previous node;
• using the value and id to modify the token based on the paths;
• and
• sending the token to a further node based on the path taken by the work.

A computer readable medium having instruction for causing a computer to execute a method of controlling flow of work through a process represented by nodes, the method comprising:

• generating a token for a piece of work to be performed in accordance with the process;
• selectively incrementing a token value as the work flows through nodes of the process;
• adding a node id to a token as it passes through the node;
• and
• consuming tokens at selected nodes.

A computer readable medium having instruction for causing a computer to execute a method of managing tokens at a join node, the method comprising:

• receiving an incoming token stream;
• generating a token based on a last consumed token;
• and
• appending a maximum of the incoming token stream and the last consumed token.

A computer readable medium having instruction for causing a computer to execute a method of managing tokens at a join node, the method comprising:

• receiving an number “n” of incoming tokens;
• identifying a first maximum of the incoming tokens;
• generating a token based on a last consumed token;
• identifying a second maximum of the first maximum and the last consumed token;
• and
• appending a third maximum of the second maximum and the generated token.

A computer readable medium having instruction for causing a computer to execute a method of managing tokens by a join node from a loop back edge, the method comprising:

• receiving an incoming token stream;
• generating a token based on a last consumed token;
• consuming the incoming token based on a join node id;
• identifying a maximum between the consumed token and the last consumed token;
• and
• appending the maximum and the generated token.

A computer readable medium having instruction for causing a computer to execute a method of determining a maximum value of two workflow tokens, one of which is an incoming token, wherein the tokens identify a path of work through a process having multiple nodes, the method comprising:

• identifying a substring from each token such that all identified nodes in both tokens are equal;
• comparing the substrings sequentially using the value associated with each node from each substring to find the maximum;
• and
• modifying the incoming token to be the maximum.

A computer readable medium having instruction for causing a computer to execute a method of managing a workflow token in a join node, the method comprising:

• generating a token;
• storing previous token values;
• adding a unique join id to a token;
• and
• consuming tokens.

A computer readable medium having instruction for causing a computer to execute a method of managing a workflow token in a split node, the method comprising:

• generating a token;
• storing previous token values;
• and
• adding a unique split id to a token;
• and
• consuming tokens.

A computer readable medium having instruction for causing a computer to execute a method of controlling workflow using tokens that identify paths taken by work progressing through a process comprising multiple nodes, the method comprising:

• receiving a token having a value and id corresponding to a previous node;
• using the value and id to modify the token based on the paths;
• and
• sending the token to a further node based on the path taken by the work.