# US 2015/0106068 A1 · Interactive feedback for variable equation specifications

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0106068 A1
- Document ID: US20150106068A1
- Status: Published application
- Kind: A1
- Application number: 14/231,363
- Filed: 2014-03-31
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: Invensys Systems, Inc.
- Applicants: Invensys Systems, Inc.
- Inventors: Ian H. Boys; Douglas Paul Kane; David H. Jerome; Cal Depew
- Web page: https://patentgrep.com/patent/US20150106068A1

## CPC

- G05B 17/02: electric
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)

## Abstract

Software instructions stored on a memory device and executable by a processor generate a plurality of models to simulate a process entity. The models include equations that mathematically represent the functionality of the process. Moreover, the models are configured to accurately represent the functionality of the process. Instructions determine whether the equations of the models are solvable after each change made to the models and indicate the result of the determination of solvability of the equations. Changes to the plurality of models are suggested that may render the equations solvable if the equations are determined to be unsolvable.

## Claims

### Claim 1

A system for simulating a process entity comprising:
a processor;
a memory device coupled to the processor;
software instructions stored on the memory device and executable by the processor, said instructions comprising:
instructions for generating a plurality of models, said plurality of models including equations that mathematically represent the functionality of the process;
instructions for configuring the plurality of models to accurately represent the functionality of the process;
instructions for determining whether the equations of the plurality of models are solvable after each change made to the plurality of models;
instructions for indicating the result of the determination of the solvability of the equations; and
instructions for suggesting changes to the plurality of models that may render the equations solvable if the equations are determined to be unsolvable.

### Claim 2 (depends on 1)

The system of claim 1, wherein the equations are determined to be under-specified, and suggesting changes to the plurality of models comprises suggesting variables to be specified to make the system solvable.

### Claim 3 (depends on 1)

The system of claim 1, wherein the equations are determined to be over-specified and suggesting changes to the plurality of models comprises suggesting specified variables to be freed to make the system solvable.

### Claim 4 (depends on 1)

The system of claim 1, wherein determining whether the equations of the plurality of models are solvable comprises performing a sequence of row and column permutations.

### Claim 5

One or more tangible, non-transitory computer-readable media having executable instructions stored thereon that, when executed, perform a method of simulating a process entity comprising:
generating a plurality of models, said plurality of models including equations that mathematically represent the functionality of the process;
configuring the plurality of models to accurately represent the functionality of the process;
determining whether the equations of the plurality of models are solvable after each change made to the plurality of models;
indicating the result of the determination of the solvability of the equations; and
suggesting changes to the plurality of models that may render the equations solvable if the equations are determined to be unsolvable.

### Claim 6 (depends on 5)

The computer-readable media of claim 5, wherein suggesting changes to the plurality of models includes adjusting which variables of the models are free and which variables of the models to render the equations solvable.

### Claim 7 (depends on 5)

The computer-readable media of claim 5, wherein suggesting changes to the plurality of models includes adjusting one or more variables of the models to be free when all of the variables are previously fixed.

### Claim 8 (depends on 5)

The computer-readable media of claim 5, wherein determining whether the equations of the plurality of models are solvable comprises performing a sequence of row and column permutations.

### Claim 9

A processor executable method of simulating a process entity comprising:
generating a plurality of models, said plurality of models including equations that mathematically represent the functionality of the process;
configuring the plurality of models to accurately represent the functionality of the process;
determining whether the equations of the plurality of models are solvable after each change made to the plurality of models;
indicating the result of the determination of the solvability of the equations; and
suggesting changes to the plurality of models that may render the equations solvable if the equations are determined to be unsolvable.

### Claim 10 (depends on 9)

The method of claim 9, wherein suggesting changes to the plurality of models includes adjusting which variables of the models are free and which variables of the models to render the equations solvable.

### Claim 11 (depends on 9)

The method of claim 9, wherein suggesting changes to the plurality of models includes adjusting one or more variables of the models to be free when all of the variables are previously fixed.

### Claim 12 (depends on 9)

The method of claim 9, wherein determining whether the equations of the plurality of models are solvable comprises performing a sequence of row and column permutations.
