US2020033823A1PendingUtilityA1

Interactive feedback for variable equation specifications

Assignee: AVEVA SOFTWARE LLCPriority: Oct 14, 2013Filed: Oct 8, 2019Published: Jan 30, 2020
Est. expiryOct 14, 2033(~7.2 yrs left)· nominal 20-yr term from priority
G05B 17/02
66
PatentIndex Score
0
Cited by
0
References
0
Claims

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

exact text as granted — not AI-modified
What is claimed is: 
     
         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. 
   
     
     
         2 . 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. 
     
     
         3 . 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. 
     
     
         4 . 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. 
     
     
         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.   
     
     
         6 . 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. 
     
     
         7 . 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. 
     
     
         8 . 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. 
     
     
         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.   
     
     
         10 . 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. 
     
     
         11 . 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. 
     
     
         12 . 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.

Join the waitlist — get patent alerts

Track US2020033823A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.