Patents by Inventor Phil S. Coulthard

Phil S. Coulthard has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9800475
    Abstract: A selection of graphical message flow primitives defined within the message flow builder that each graphically represent and define message-oriented logic of an operation for the Web service are graphically assembled. Each graphical message flow primitive is defined within the message flow builder as a representation of a unit of work usable to define message flow patterns of Web service operation flow types and each includes a Web service operational processing logic definition of the representation of the respective unit of work usable to generate executable Web service logic. Selected ones of the graphical message flow primitives are graphically interconnected to represent a flow of messages to create a message-oriented Web service definition. The executable Web service logic defined within the message flow builder by each one of the interconnected selected graphical message flow primitives within the created message-oriented Web service definition is generated to construct the Web service.
    Type: Grant
    Filed: November 4, 2013
    Date of Patent: October 24, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Allen V. C. Chan, Zhongming Chen, Phil S. Coulthard, Richard M. Goldberg, Elaine Y. L. Lau, Chee W. Ooi, David A. Spriet
  • Patent number: 9692657
    Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.
    Type: Grant
    Filed: June 24, 2014
    Date of Patent: June 27, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Patent number: 9686142
    Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.
    Type: Grant
    Filed: September 30, 2013
    Date of Patent: June 20, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Patent number: 9251489
    Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.
    Type: Grant
    Filed: June 24, 2014
    Date of Patent: February 2, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Publication number: 20150095257
    Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.
    Type: Application
    Filed: September 30, 2013
    Publication date: April 2, 2015
    Applicant: International Business Machines Corporation
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Publication number: 20150095094
    Abstract: A previously-computed scope definition represented as at least one begin-end node pair is obtained. The at least one begin-end node pair is usable to identify all nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of a selection of a connected directed graphical representation of a process model. A change to the process model relative to the previously-computed scope definition is identified. A type of tooling environment used to change the process model is determined. The tooling environment includes one of a fully-integrated tooling environment and a componentized tool chain tooling environment. The previously-computed scope definition is adapted into an updated process scope definition based upon the identified at least one change to the process model relative to the previously-computed scope definition and the determined type of tooling environment.
    Type: Application
    Filed: June 24, 2014
    Publication date: April 2, 2015
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Publication number: 20150092596
    Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.
    Type: Application
    Filed: June 24, 2014
    Publication date: April 2, 2015
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Publication number: 20150095093
    Abstract: A connected directed graphical representation of a process model that includes a plurality of process nodes and interconnections between the process nodes of the process model is displayed. A user selection of a subset of the process nodes of the displayed connected directed graphical representation of the process model is received. A process scope definition represented as at least one begin-end node pair is computed. The at least one begin-end node pair is usable to identify all selected nodes and interconnection path links that are reachable in a traversal from a begin node to an end node of each of the at least one begin-end node pair of the received user selection of the subset of the process nodes. The computed process scope definition is stored.
    Type: Application
    Filed: September 30, 2013
    Publication date: April 2, 2015
    Applicant: International Business Machines Corporation
    Inventors: Allen V. C. Chan, Tak S. Chau, Phil S. Coulthard, Hans-Arno Jacobsen, Vinod Muthusamy
  • Publication number: 20140059441
    Abstract: A selection of graphical message flow primitives defined within the message flow builder that each graphically represent and define message-oriented logic of an operation for the Web service are graphically assembled. Each graphical message flow primitive is defined within the message flow builder as a representation of a unit of work usable to define message flow patterns of Web service operation flow types and each includes a Web service operational processing logic definition of the representation of the respective unit of work usable to generate executable Web service logic. Selected ones of the graphical message flow primitives are graphically interconnected to represent a flow of messages to create a message-oriented Web service definition. The executable Web service logic defined within the message flow builder by each one of the interconnected selected graphical message flow primitives within the created message-oriented Web service definition is generated to construct the Web service.
    Type: Application
    Filed: November 4, 2013
    Publication date: February 27, 2014
    Applicant: International Business Machines Corporation
    Inventors: Allen V. C. Chan, Zhongming Chen, Phil S. Coulthard, Richard M. Goldberg, Elaine Y. L. Lau, Chee W. Ooi, David A. Spriet
  • Publication number: 20100082379
    Abstract: Methods, systems and computer program products for inferential business process monitoring. Exemplary embodiments include an inferential business process monitoring method, including deriving an optimal set of key performance indicators from a service level agreement specification, determining metrics to compute the key performance indicators from the service level agreement specification, assigning and configuring monitoring agents to retrieve the metrics to obtain the key performance indicators, deploying the monitoring agents and delivering key performance indicator metrics observed by the monitoring agents.
    Type: Application
    Filed: September 30, 2008
    Publication date: April 1, 2010
    Applicant: International Business Machines Corporation
    Inventors: Allen V.C. Chan, Phil S. Coulthard, Hans-Arno Jacobsen, Helena Litani, Vinod Muthusamy, Julie F. Waterhouse
  • Publication number: 20090055839
    Abstract: Systems, methods and computer products for data oriented aspect programming in message flows. Exemplary embodiments include a method including defining a set of static and dynamic rules to identify a plurality of data-oriented join points in a message flow, wherein each of the plurality of join points is a specific point in the message flow at runtime, defining a set of actions for each of the plurality of data-oriented join points, the set of actions executing once a respective join point condition of a set of static and dynamic conditions are met, inserting the set of static and dynamic rules into the message flow at each of the plurality of data-oriented join points and executing the set of actions for each one of the inserted set of static and dynamic rules in response to a respective static and dynamic condition being met.
    Type: Application
    Filed: August 21, 2007
    Publication date: February 26, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINE CORPORATION
    Inventors: Allen V. C. Chan, Phil S. Coulthard