EP0251699A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A logic diagram compiler executor
Assignee: Westinghouse Electric Corp
•
Filing: 1987-06-24
•
Granted: —
•
Expires: 2007-06-24
Abstract
Abstract An interactive method of creating a logic diagram and equations representing the diagram as a dynamic diagram grid on a computer display and executing the equations. An interactive graphics program, using inputs taken from an existing logic diagram for plant processes generates a high resolution logic diagram, at the same time providing Boolean equations associated with the logic diagram in a form such that they may be processed, linked and downloaded to a microprocessor-based logic processor connected to the plant central computer.
Inventors
- 👤 Donald Frederick Furgerson
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-24 20:52
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/04; G05B19/05; G05B19/056; G05B2219/00; G05B2219/10; G05B2219/13; G05B2219/13144; G05B2219/16; G05B2219/161
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
97 words
A method of compiling and executing logic diagrams to produce device outputs from device inputs in plant processes, by using an existing dynamic diagram of process devices, comprising the steps of: (a) designating a logic symbol shape and a location on a dynamic diagram for that shape; (b) compiling a logic equation for the shape; characterized by the steps of (c) placing the shape in a token block on the dynamic diagram; (d) repeating steps (a)-(c) until all said process devices on said dynamic diagram are completed; and (e) executing a logic diagram representing the dynamic diagram.
Claim 2
Independent Claim
97 words
A method of compiling and executing logic diagrams to produce device outputs from device inputs in plant processes, by using an existing dynamic diagram of process devices, comprising the steps of: (a) designating a logic symbol shape and a location on a dynamic diagram for that shape; (b) compiling a logic equation for the shape; characterized by the steps of (c) placing the shape in a token block on the dynamic diagram; (d) repeating steps (a)-(c) until all said process devices on said dynamic diagram are completed; and (e) executing a logic diagram representing the dynamic diagram.
Claim 3
Dependent Claim
32 words
A method as recited in claim 1, wherein step (a) comprises the steps of: (ai) designating a shape from a shape library; and (aii) concerting the location into a token block number.
Claim 4
Dependent Claim
44 words
A method as recited in claim 2, wherein step (b) comprises the step of: (bi) creating a dynamic equation list entry from a static equation definition, the entry including the token block number, an operation code, an output position indicator and input position indicators.
Claim 5
Dependent Claim
31 words
A method as recited in claim 3, wherein step (c) comprises the step of: (ci) transferring a shape from the shape library to the diagram at the token block number indicated.
Claim 6
Dependent Claim
26 words
A method as recited in claim 1, further comprising the step of: (f) checking the dynamic diagram for completeness before execution of the logic diagram occurs.
Claim 7
Dependent Claim
32 words
A method as recited in claim 5, wherein step (f) comprises: (fi) comparing occupied input and output positions for each token block with respective output and input positions of neighboring token blocks.
Claim 8
Dependent Claim
42 words
A method as recited in claim 1, wherein step (e) comprises the steps of: (ei) creating execution equations from the logic equations; and (eii) retrieving the device inputs and executing the execution equations with the device inputs to produce the device outputs.
Claim 9
Dependent Claim
29 words
A method as recited in claim 7, wherein step (ei) comprises the steps of: (1) creating an intermediate file; and (2) loading the intermediate file into an execution table.
Claim 10
Dependent Claim
76 words
A method as recited in claim 8, wherein step (2) comprises the steps of: (1a) creating at least one execution table record for each intermediate file record; (1b) preassigning input and output execution table records, as necessary, for the at least one execution table record and linking the preassigned records using input and output record pointers; and (1c) completing the input and output execution table records as a corresponding record in the intermediate file is encountered.
Claim 11
Dependent Claim
64 words
A method as recited in claim 9, wherein an intermediate file record corresponds to a multiple equation shape and said method further comprises the steps of: (1d) creating multiple equation table records for the multiple equation shape; (1e) linking the multiple equation table records using token pointers; and (1f) preassigning input and output execution table records, as necessary, for the multiple equation table records.
Claim 12
Dependent Claim
71 words
A method as recited in claim 10, wherein step (eii) comprises the steps of: (1) propagating device inputs through the equation table records until a multiple input execution table shape record is encountered; (2) determining if all the inputs for the multiple input execution table shape record are available; (3) processing the multiple input execution table shape record when all inputs are available; and (4) continuing propagation of the device inputs.
Claim 13
Dependent Claim
61 words
A method as recited in claim 11 wherein step (eii) further comprises the steps of: (5) pushing a token pointer onto a return stack when a multiple equation table record is encountered; (6) continuing propagation of device inputs until an impasse is reached; and (7) continuing propagation with the equation table record corresponding to the token pointer on the return stack.
Claim 14
Dependent Claim
54 words
A method as recited in claim 11, further comprising the steps of: (8) examining the execution table records for incomplete logic states when all inputs and impasses have been processed; (9) assuming a value for an unavailable input for shapes with incomplete logic states; and (10) propagating the value through the execution table records.
Claim 15
Dependent Claim
198 words
A method of creating and executing logic diagrams as in claim 1 wherein said step (e) of executing a logic diagram comprises executing a logic diagram by creating execution equations from the logic equations and retrieving the device inputs and executing the execution equations with the device inputs to produce the device outputs where executing the execution equations includes: (1) propagating device inputs through the equation table records until a multiple input execution table shape record is encountered; (2) determining if all the inputs for the multiple input equation table shape record are available; (3) processing the multiple input execution table shape record when all inputs are available; (4) continuing propagation of the device inputs; (5) pushing a token pointer onto a return stack when a multiple equation table record is encountered; (6) continuing propagation of device inputs until an impasse is reached; (7) continuing propagation with the equation table record corresponding to the token pointer; (8) examining the execution table records for incomplete logic states when all inputs and impasses have been processed; (9) assuming a value for an unavailable input for shapes with incomplete logic states; and (10) propagating the value through the equation table records.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.