Process flow diagram generator

• US 5,596,704 A
• Filed: 11/11/1993
• Issued: 01/21/1997
• Est. Priority Date: 11/11/1993
• Status: Expired due to Fees

• Current Assignee: Aspentech Corporation
• Original Assignee: Bechtel Group Incorporated
• Inventors: Davis, Patrick P., Geddes, David D., Joffe, Basil
• Primary Examiner(s): Bayerl, Raymond J.
• Application Number:
  US08/151,067
• Time in Patent Office: 1,167 Days
• Field of Search: 395/161, 395/159, 395/160, 395/155, 395/157, 395/140, 364/188, 364/578, 364/500, 364/501, 364/469, 364/149, 364/151, 364/192
• US Class Current: 715/763
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

A method and apparatus for creating a process flow diagram from a process model. Process models include processing nodes and process streams. User defined process models can be stored and retrieved for later use. A processor utilizes the process model to determine coordinates for each node and to determine the routing coordinates for each process stream for display. Icons are substituted for nodes for display on the output device, and lines are substituted for process streams also for display on the output device.

Claims

1. A method for creating a process flow diagram from a process model, wherein the process model includes a plurality of process streams and a plurality of nodes, wherein the process streams represent material transfers and the nodes represent processes, the method using a computer system, the computer system including a processor coupled to an output device, user input device and storage means, the method comprising the steps of:

(a) retrieving a plurality of tables of data representing the process model, the process model describing stream data and node data, said node data defining the plurality of nodes and said stream data defining the plurality of process streams between the plurality of nodes;

(b) using the processor, said stream data and said note data to determine corresponding node coordinates for an adjacency matrix between each of the plurality of nodes, the step further comprising the steps of;

(i) creating an adjacency matrix between each of the plurality of nodes;

(ii) subsequent to creating an adjacency matrix, using the processor, said stream data and said node data to identify an origin node, starting node and an ending node;

(iii) creating a placement matrix, with a row dimension and a column dimension, for output placement of the plurality of modes;

(iv) subsequent to creating a placement matrix, placing said origin node in a top row of a first column of said placement matrix;

(v) subsequent to placing said origin node, placing said starting node in a second column of said placement matrix, wherein placement order occurs in said second column from said top row downwards in said placement matrix;

(vi) subsequent to placing said starting node, using said adjacency matrix to determine starting adjacent nodes, said starting adjacent nodes being nodes which are adjacent to said starting node;

(vii) subsequent to using said adjacency matrix to determine starting adjacent nodes placing said starting adjacent nodes into a third column of said placement matrix, wherein placement order occurs in said third column from said top row downwards in said placement matrix; and

(viii) subsequent to placing each of the plurality of nodes, placing said ending node in said top row of a last column of said placement matrix;

(c) using the processor, said stream data and said node data to determine corresponding stream routing coordinates for the plurality of process streams between the plurality of nodes; and

(d) displaying to the output device an icon for each node at said corresponding respective node row and column coordinates in response to the adjacency matrix and displaying to the output device a line interconnecting two or more icons for each process stream at said corresponding stream routing coordinates.

2. The method of claim 1, wherein substep (i) further comprises the substeps of:

creating an adjacency matrix, with matrix rows and matrix columns, with each of the plurality of nodes associated with an associated matrix row and each of the plurality of nodes associated with an associated matrix column; and

using the processor, said stream data and said node data to indicate in each matrix location, whether said associated row node and said associated column node are interconnected by at least one of the plurality of process streams.

3. A method for creating process flow diagram from a process model, wherein the process model includes a plurality process streams and a plurality of nodes, wherein the process streams represent material transfers and the nodes represent processes, the method using a computer system, the computer system including a processor coupled to an output device, user input device and storage means, the method comprising the steps of:

retrieving a plurality of tables of data representing the process model, the process model describing stream data and node data, said node data defining the plurality of nodes and said stream data defining the plurality of process streams between the plurality of nodes;

using the processor, said stream data and said node data to determine corresponding node coordinates for an adjacency matrix between each of the plurality of nodes;

using the processor, said stream data and said node data to determine corresponding stream routing coordinates for the plurality of process streams between the plurality of nodes;

displaying to the output device an icon for each node at said corresponding respective node row and column coordinates in response to the adjacency matrix and displaying to the output device a line interconnecting two or more icons for each process stream at said corresponding stream routing coordinates;

allocating a right vertical path array for the plurality of nodes;

allocating a left vertical path array for the plurality of nodes;

allocating a horizontal path array for the plurality of nodes;

using the processor, said stream data and said node data to detect direct across paths between nodes with dissimilar horizontal coordinates and similar vertical coordinates and updating said right vertical path array and said left vertical path array according to said direct across paths;

using the processor, said stream data and said node data to detect diagonal across paths between nodes with similar horizontal coordinates and dissimilar vertical coordinates and updating said right vertical path array and said left vertical path array according to said diagonal across paths;

using the processor, said stream data and said node data to detect distant paths between nodes with dissimilar horizontal coordinates and dissimilar vertical coordinates and updating said right vertical path array, said left vertical path array, and said horizontal path array according to said distant paths; and

using the processor said stream data and said node data to detect same column paths between nodes with similar vertical coordinates and updating said right vertical path array, said left vertical path array, and said horizontal path array according to said same column paths.

4. The method of claim 3, further comprising the step of:

detecting when said plurality of process streams into each of the plurality of nodes have similar material transfers and updating said right vertical path array, said left vertical path array, and said horizontal path array.

5. The method of claim 3, further comprising the step of:

subsequent to updating said right vertical path array, said left vertical path array and said horizontal path array, determining final node coordinates for each of the plurality of nodes, wherein said final node coordinates are used as said corresponding node coordinates in the step of displaying the output device.

6. The method of claim 5, wherein the step of determining final node coordinates comprises the substeps of:

determining associated horizontal and associated vertical spaces to be added to each of the plurality of nodes in response to associated said right vertical path array, said left vertical path array, and said horizontal path array; and

moving said corresponding node coordinates for each of the plurality of nodes in response to said associated horizontal and said associated vertical spaces.