Patent US6691090B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US5473531A Expired / Lapsed US ⏱️ 0.0 years remaining

Finite state machine with minimized memory requirements

Assignee: AT&T Inc
•
Filing: 1993-12-28
•
Granted: 1995-12-05
•
Expires: 2013-12-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A set of indexes associated with each state of the finite state machine provides an address locator to a location in memory of a microprocessor where sets of logical vectors are stored. A count stored in a group of logical vectors identifies the number of stored logical vectors and hence, permits memory allocation to vary depending upon the number of logical conditions to be applied for a given test. A predetermined null value entered in an index is interpreted by the finite state machine as requiring no further processing and having no corresponding memory allocated for logical vectors.

Inventors

  • 👤 Alan R. Flora-Holmquist
  • 👤 Thomas L. Mills

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 07:56
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/04; G05B19/042; G05B19/045; G05B2219/00; G05B2219/20; G05B2219/23; G05B2219/23289

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 177 words
In a microcomputer containing an implementation of a finite state machine (FSM) that controls a process wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, a method for implementing the FSM with minimized memory required by the microcomputer comprising the steps of: a) storing in a first portion of memory of said microprocessor only said sets of selection vectors containing said logical data; b) storing an index in a second portion of memory of said microcomputer for each state of said FSM, said index containing an address indicator corresponding to each set of said selection vectors; c) during the operation of said FSM in a current state, said microprocessor accessing one of said sets of selection vectors via reading a corresponding one address indicator from a corresponding index.
Claim 2
Dependent Claim 177 words
In a microcomputer containing an implementation of a finite state machine (FSM) that controls a process wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, a method for implementing the FSM with minimized memory required by the microcomputer comprising the steps of: a) storing in a first portion of memory of said microprocessor only said sets of selection vectors containing said logical data; b) storing an index in a second portion of memory of said microcomputer for each state of said FSM, said index containing an address indicator corresponding to each set of said selection vectors; c) during the operation of said FSM in a current state, said microprocessor accessing one of said sets of selection vectors via reading a corresponding one address indicator from a corresponding index.
Claim 3
Dependent Claim 67 words
The method according to claim 1 further comprising the step of storing a first count associated with each of group of sets of selection vectors associated with a state, said first count being the number of sets of selection vectors contained within the corresponding group, said microcomputer utilizing said first count to define the maximum number of sets of selection vectors to be processed for each state.
Claim 4
Dependent Claim 54 words
The method according to claim 1 further comprising the step of storing a first count associated with each of said sets of selection vectors, said first count being the number of selection vectors contained in each set, said microcomputer utilizing said first count to define the number of selection vectors associated with each set.
Claim 5
Dependent Claim 54 words
The method according to claim 3 further comprising the step of storing a second count associated with each of said sets of selection vectors, said second count being the number of selection vectors contained in each set, said microcomputer utilizing said second count to define the number of selection vectors associated with each set.
Claim 6
Dependent Claim 62 words
The method according to claim 4 further comprising the step of storing an control vector associated with each of said sets of selection vectors, said microcomputer executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.
Claim 7
Dependent Claim 62 words
The method according to claim 1 further comprising the step of storing an control vector associated with each of said sets of selection vectors, said microcomputer executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.
Claim 8
Dependent Claim 61 words
The method according to claim 1 further comprising the steps of storing a control vector associated with each of said sets of selection vectors, and executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.
Claim 9
Dependent Claim 325 words
In a microcomputer containing an implementation of a finite state machine (FSM) that controls a process wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, a method for minimizing memory required by the microcomputer for the FSM implementation comprising the steps of: a) storing an index in memory of said microcomputer for each state of said FSM, said index containing an address locator corresponding to a set of said selection vectors; b) assigning a predetermined null value to address locators that correspond to said sets containing selection vectors without any logical data; c) storing in memory of said microprocessor selection vectors contained in said sets with corresponding address locators that do not contain said null value, no memory in said microprocessor used for storage of selection vectors contained in said sets corresponding to address locators that contain said null value; d) assigning a non-null value to address locators that correspond to sets containing selection vectors with logical data, said non-null value serving as a pointer to a location in memory that contains the corresponding selection vectors; e) during the operation of said FSM in a given state, said microprocessor seeks to access one set of selection vectors via reading a corresponding one address locator, the microprocessor interpreting a null value in said one address locator as an indication that no FSM processing of the associated one set of selection vectors is required, the microprocessor interpreting a non-null value in the one address locator as an indication that FSM processing of the associated one set of selection vectors is required, whereby memory is not required for the storage of selection vectors that do not contain logical data.
Claim 10
Dependent Claim 325 words
In a microcomputer containing an implementation of a finite state machine (FSM) that controls a process wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, a method for minimizing memory required by the microcomputer for the FSM implementation comprising the steps of: a) storing an index in memory of said microcomputer for each state of said FSM, said index containing an address locator corresponding to a set of said selection vectors; b) assigning a predetermined null value to address locators that correspond to said sets containing selection vectors without any logical data; c) storing in memory of said microprocessor selection vectors contained in said sets with corresponding address locators that do not contain said null value, no memory in said microprocessor used for storage of selection vectors contained in said sets corresponding to address locators that contain said null value; d) assigning a non-null value to address locators that correspond to sets containing selection vectors with logical data, said non-null value serving as a pointer to a location in memory that contains the corresponding selection vectors; e) during the operation of said FSM in a given state, said microprocessor seeks to access one set of selection vectors via reading a corresponding one address locator, the microprocessor interpreting a null value in said one address locator as an indication that no FSM processing of the associated one set of selection vectors is required, the microprocessor interpreting a non-null value in the one address locator as an indication that FSM processing of the associated one set of selection vectors is required, whereby memory is not required for the storage of selection vectors that do not contain logical data.
Claim 11
Dependent Claim 43 words
The method according to claim 8 wherein said microcomputer interprets a non-null value in the one address locator as address information and proceeds to access said one set of selection vectors at a memory location in the memory indicated by said non-null value.
Claim 12
Dependent Claim 52 words
The method according to claim 8 further comprising the step of storing a first count associated with said sets of selection vectors, said first count being the number of sets of selection vectors, said microcomputer utilizing said first count to define the maximum number of sets of selection vectors to be processed.
Claim 13
Dependent Claim 53 words
The method according to claim 8 further comprising the step of storing first counts associated with each of said sets of selection vectors, said first count being the number of selection vectors contained in each set, said microcomputer utilizing said first counts to define the number of selection vectors associated with each set.
Claim 14
Dependent Claim 53 words
The method according to claim 11 further comprising the step of storing second counts associated with each of said sets of selection vectors, said second count being the number of selection vectors contained in each set, said microcomputer utilizing said second counts to define the number of selection vectors associated with each set.
Claim 15
Dependent Claim 62 words
The method according to claim 8 further comprising the step of storing a control vector associated with each of said sets of selection vectors, said microcomputer executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.
Claim 16
Dependent Claim 61 words
The method according to claim 8 further comprising the steps of storing a control vector associated with each of said sets of selection vectors, and executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.
Claim 17
Dependent Claim 321 words
In a control system in which a process is controlled by a finite state machine (FSM) wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of S states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, the FSM implemented in a microcomputer having associated memory, the improvement comprising: means for storing in said memory an address locator corresponding to a set of said selection vectors for each state S of said FSM; means for assigning a predetermined null value to address locators that correspond to sets containing selection vectors without any logical data; means for storing in memory of said microprocessor selection vectors contained in said sets corresponding to address locators that do not contain said null value and using no memory in said microprocessor for storage of selection vectors contained in sets corresponding to address locators that contain said null value; means for assigning a non-null value to address locators that correspond to sets containing selection vectors with logical data, said non-null value serving as a pointer to a location in said memory that contains the corresponding selection vectors; means for during the operation of said FSM in a given state wherein said microprocessor seeks to access one set of selection vectors via reading a corresponding one address locator, the microprocessor interpreting a null value in said one address locator as an indication that no FSM processing of the associated one set of selection vectors is required, the microprocessor interpreting a non-null value in the one address locator as an indication that FSM processing of the associated one set of selection vectors is required, whereby memory is not required for the storage of selection vectors that do not contain logical data.
Claim 18
Dependent Claim 321 words
In a control system in which a process is controlled by a finite state machine (FSM) wherein a plurality of input signals received by the FSM correspond to monitored process conditions and output signals generated by the FSM correspond to commands that effect changes in parameters associated with the process, the FSM having a plurality of S states and sets of selection vectors, logical data selectively stored in the selection vectors to define logical conditions, the FSM implemented in a microcomputer having associated memory, the improvement comprising: means for storing in said memory an address locator corresponding to a set of said selection vectors for each state S of said FSM; means for assigning a predetermined null value to address locators that correspond to sets containing selection vectors without any logical data; means for storing in memory of said microprocessor selection vectors contained in said sets corresponding to address locators that do not contain said null value and using no memory in said microprocessor for storage of selection vectors contained in sets corresponding to address locators that contain said null value; means for assigning a non-null value to address locators that correspond to sets containing selection vectors with logical data, said non-null value serving as a pointer to a location in said memory that contains the corresponding selection vectors; means for during the operation of said FSM in a given state wherein said microprocessor seeks to access one set of selection vectors via reading a corresponding one address locator, the microprocessor interpreting a null value in said one address locator as an indication that no FSM processing of the associated one set of selection vectors is required, the microprocessor interpreting a non-null value in the one address locator as an indication that FSM processing of the associated one set of selection vectors is required, whereby memory is not required for the storage of selection vectors that do not contain logical data.
Claim 19
Dependent Claim 44 words
The control system according to claim 15 wherein said microcomputer interprets a non-null value in the one address locator as address information and proceeds to access said one set of selection vectors at a memory location in the memory indicated by said non-null value.
Claim 20
Dependent Claim 49 words
The control system according to claim 15 further comprising means for storing a first count associated with said sets of selection vectors, said first count being the number of sets of selection vectors, said first count to defining the maximum number of sets of selection vectors to be processed.
Claim 21
Dependent Claim 49 words
The control system according to claim 15 further comprising means for storing first counts associated with each of said sets of selection vectors, said first count being the number of selection vectors contained in each set, said first counts defining the number of selection vectors associated with each set.
Claim 22
Dependent Claim 49 words
The control system according to claim 18 further comprising means for storing second counts associated with each of said sets of selection vectors, said second count being the number of selection vectors contained in each set, said second counts defining the number of selection vectors associated with each set.
Claim 23
Dependent Claim 63 words
The control system according to claim 17 further comprising means for storing a control vector associated with each of said sets of selection vectors, and means for executing a control vector associated with one set of selection vectors if at least one of the selection vectors of said one set satisfies a TRUE condition of a logical AND comparison with said input signals.

References Cited (Backward Citations)

US3974484A Cited
US4608628A Cited
US4628435A Cited
US4742443A Cited
US4858102A Cited
US5072356A Cited
US5042002A Cited
US5128857A Cited
US5301100A Cited
US5265004A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-12-04 1999-06-05 1999-12-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-12-04 2003-06-05 2003-12-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-12-04 2007-06-05 2007-12-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag