Peer-to-peer inter-enterprise collaborative process management method and system

• US 7,236,939 B2
• Filed: 03/31/2001
• Issued: 06/26/2007
• Est. Priority Date: 03/31/2001
• Status: Active Grant

• Current Assignee: Valtrus Innovations Limited (f/k/a Dolya Holdco 9 Limited) (Key Patent Innovations Limited)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Chen, Qiming, Hsu, Meichun
• Primary Examiner(s): Tarae, C. Michelle
• Assistant Examiner(s): Jarrett, Scott L.
• Application Number:
  US09/823,581
• Publication Number:
  US 20020184070A1
• Time in Patent Office: 2,278 Days
• Field of Search: 705/9
• US Class Current: 705/7.13
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A collaborative business process for modeling inter-enterprise collaboration (e.g., peer-to-peer (P2P) or business-to-business (B2B) interaction) that involves at least two players from two different enterprises is defined. The collaborative business process has a plurality of work nodes. Each work node has a task-role identifier for identifying a particular player to execute each node. A first collaborative process manager (FCPM) associated with the first player is provided to execute a first instance of the collaborative business process. A second collaborative process manager (SCPM) associated with the second player is provided to execute a second instance of the collaborative business process.

Claims

1. A method for managing peer-to-peer collaborative inter-enterprise business processes between two different enterprises having first and second collaborative process managers (CPM) comprising:

defining a collaborative business process (CBP) specified by a collaborative process definition (CPD) and based on a collaboration protocol, the CPD comprising;

(1) a list of participating process-roles for first and second peer process instances,

(2) plural work nodes each having an activity to be completed and a task role that matches one of the defined process-roles and private sub-processes unavailable to other peer process instances, and

(3) templates having definitions, initial values and sharing scope, being specified as public or private, of process data objects, the templates being either public and sharable by all process roles and peer process instances or private and sharable by only peer instances having a specified process-role;

performing the CBP by instantiating and executing first and second peer process instances of the CBP by the CPMs to form a single logical execution instance of the CBP identified by a unique cooperation key assigned to the peer process instances each having a role and being responsible only for the work nodes having a role matching the role of the peer process instance;

wherein the CPMs′

schedule, dispatch and control work nodes and include a private sub-process manager and an out-of-order handler mechanism that halts execution when messages from other CPMs are received out-of-order;

launching activities of the work nodes by exchanging process data having the templates that specify sharing scopes of the exchanged data objects and updating the templates and sharing scope during process data exchange; and

using the cooperation key to identify a logical instance of the CBP and to correlate and synchronize via peer-to-peer information exchange between the first and second CPMs.

2. The method of claim 1, wherein when message relating to execution of a collaborative process is received, the cooperation key is used to identify a correct local process instance.

3. The method of claim 1, wherein process data in a private template is not sharable by all peer process instances but private to one of the first and second peer process instances.

4. The method of claim 1 further comprising, specifying rules in the sharing scope for sharing both public and private data between the first and second peer process instances.

5. The method of claim 1, wherein the process specific templates are accessible only by a peer process instance have a specified role.

6. The method of claim 1 further comprising, maintaining at each CPM a mapping table between cooperation keys and a local process instance identifier.

7. The method of claim 1 further comprising, employing a queuing technique at the out-of-order message handler to resolve out-of-order message delivery problems.

8. The method of claim 1 wherein the CBP includes a plurality of tasks, the method further comprising:

the first CPM receiving a current task;

the first CPM determining if the current task is responsibility of the first CPM;

when the current task is the responsibility of the first CPM, executing the current task; and

when the current task is not the responsibility of the first GPM, not executing the current task.

9. The method of claim 1 further comprising, employing task return messages for synchronizing the peer process instances and for exchanging data between the process instances;

wherein each task return message includes;

a cooperation key for specifying a logical process instance;

a local handle of the process instance and task;

an activity execution status; and

a sub-packet of process data passed to a task.