US5301100A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of and apparatus for constructing a control system and control system created thereby
Assignee: Individual
•
Filing: 1991-04-29
•
Granted: 1994-04-05
•
Expires: 2011-04-29
Abstract
Abstract A method of and apparatus for constructing a control system and a control system created thereby which is based on a finite state machine with constant code (FSMcc). An input preprocessor module normalizes input signals as required by the FSMcc logical processing unit. An output postprocessor module changes the normalized finite state machine outputs to real signals required by the controlled process or apparatus. The input preprocessor allows for a different finite state machine required for an application to be executed by the same constant code contained in the FSMcc microcode storage. An application logic table for the FSMcc is constructed using a specific organization of data representing application logic conditions. This organization allows the entire application logic to be expressed in a table of a technically feasible size. The size of the FSMcc application logic table memory is greatly reduced. The symbolic application logic table is build in a simplified form using implied AND and OR logical operators. This symbolic application table is directly converted into the FSMcc application logic table.
Inventors
- 👤 Ferdinand H. Wagner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 12:00
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/04; G05B19/042; G05B19/0426; G05B2219/00; G05B2219/20; G05B2219/23; G05B2219/23289
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
159 words
A method of specifying a control system for a process or an apparatus to be controlled comprising: a) identifying one or more detectable conditions associated with the controlled process or apparatus; b) providing a separate input name for each detectable condition wherein the presence of the respective detectable condition is indicated by the respective name having an asserted value; c) storing the input names; d) identifying one or more control actions which can be taken to control the process or apparatus; e) providing a separate output name for each identified control action; f) storing the output names; g) automatically producing an application logic table, wherein each input name is represented by a predetermined number of bit positions and combinations of input names are logically coupled together by implied AND and OR operators and wherein such combinations of input names are associated with output names; h) storing the table; and i) loading the application logic table into the control system.
Claim 2
Independent Claim
159 words
A method of specifying a control system for a process or an apparatus to be controlled comprising: a) identifying one or more detectable conditions associated with the controlled process or apparatus; b) providing a separate input name for each detectable condition wherein the presence of the respective detectable condition is indicated by the respective name having an asserted value; c) storing the input names; d) identifying one or more control actions which can be taken to control the process or apparatus; e) providing a separate output name for each identified control action; f) storing the output names; g) automatically producing an application logic table, wherein each input name is represented by a predetermined number of bit positions and combinations of input names are logically coupled together by implied AND and OR operators and wherein such combinations of input names are associated with output names; h) storing the table; and i) loading the application logic table into the control system.
Claim 3
Dependent Claim
28 words
The method of claim 1 wherein each logical combination of input names is selected and stored as an input word in the form of a pattern of bits.
Claim 4
Dependent Claim
16 words
A method of claim 2 wherein each input name is represented by at least one bit.
Claim 5
Dependent Claim
27 words
The method of claim 2 wherein at least one input word is selected and stored as a control word in the form of a pattern of bits.
Claim 6
Dependent Claim
16 words
A method of claim 4 wherein each input name is represented by at least one bit.
Claim 7
Dependent Claim
29 words
The method of claim 4 including linking input names by implied boolean AND operators to form at least one control word in the form of a pattern of bits.
Claim 8
Dependent Claim
47 words
The method of claim 6 including matching said pattern of bits in an input word with said pattern of bits in a control word to determine if the pattern of bits in said control word is a subset of the pattern of bits in said input word.
Claim 9
Dependent Claim
16 words
The method of claim 6 including linking groups of control words by the boolean OR operator.
Claim 10
Dependent Claim
19 words
The method of claim 1 wherein at least one of the detectable conditions corresponds to a measured input signal.
Claim 11
Dependent Claim
16 words
The method of claim 9 wherein said measurement of said input signal is in digital form.
Claim 12
Dependent Claim
27 words
The method of claim 9 wherein said measurement of said input signal is in analog form, further including converting said measurement to digital form before storing it.
Claim 13
Dependent Claim
12 words
The method of claim 1 including identifying a plurality of input conditions.
Claim 14
Dependent Claim
15 words
The method of claim 1 wherein at least one input name represents an unchanging parameter.
Claim 15
Dependent Claim
23 words
The method of claim 1 wherein a possible number of input signals and the number of input names are different from one another.
Claim 16
Dependent Claim
20 words
The method of claim 14 wherein the possible number of input signals is less than the number of input names.
Claim 17
Dependent Claim
20 words
The method of claim 14 wherein the possible number of input signals is greater than the number of input names.
Claim 18
Dependent Claim
23 words
The method of claim 1 wherein said output names are determined by said input names and a state of a finite state automata.
Claim 19
Independent Claim
116 words
An apparatus for constructing a control system for a controlled process or controlled apparatus comprising: a) input means for receiving (1) a plurality of input names wherein each name corresponds to a detectable condition of said controlled process or apparatus, and (2) output names corresponding to possible control actions which can be taken to control said controlled process or controlled apparatus, b) memory means for storing said input names and said output names, c) data processing means for using said stored input names and said stored output names to produce an application logic table associating combinations of input names with output names, and d) output means for loading said application logic table into a control system.
Claim 20
Independent Claim
116 words
An apparatus for constructing a control system for a controlled process or controlled apparatus comprising: a) input means for receiving (1) a plurality of input names wherein each name corresponds to a detectable condition of said controlled process or apparatus, and (2) output names corresponding to possible control actions which can be taken to control said controlled process or controlled apparatus, b) memory means for storing said input names and said output names, c) data processing means for using said stored input names and said stored output names to produce an application logic table associating combinations of input names with output names, and d) output means for loading said application logic table into a control system.
Claim 21
Dependent Claim
17 words
The apparatus of claim 18 wherein said control system is a finite state machine with constant code.
Claim 22
Dependent Claim
48 words
The apparatus of claim 19 wherein said input means is adapted to receive data representing all transitions of said control system with combinations of input names, said memory means is adapted to store said data and said processing means uses said data to produce said application logic table.
Claim 23
Dependent Claim
18 words
The apparatus of claim 20 wherein said combinations of input names are determined by implied boolean logic operators.
Claim 24
Dependent Claim
21 words
The apparatus of claim 21 wherein said implied boolean operators consist of implied AND type operators and implied OR type operators.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-04 | 1997-10-04 | 1998-04-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-04 | 2001-10-04 | 2002-04-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-04 | 2005-10-04 | 2006-04-05 | $7700.00 | Window Closed / Lapsed |