US4764863A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hardware interpreter for finite state automata
Assignee: United States Department of Commerce
•
Filing: 1985-05-09
•
Granted: 1988-08-16
•
Expires: 2005-05-09
Abstract
Abstract Apparatus and method for monitoring transactions on a high speed interface bus and for selectively storing information about such transactions together with the time of such transaction and the state of the automation. The apparatus comprises two parallel memories for respectively storing a regular table and a default table, and a memory selector for choosing between the table data of the two memories. A bus trap stores data information obtained from the bus and compares the stored information with a stored data template. A transition detector receives control signals from the bus and generates clock signals used by other system elements upon the detection of a transition. A hash coder utilizes a hash key together with state information to generate an address for entering the regular table memory. A state latch stores an address provided by the memory selector for the default table. A sample collector and sample queue component stores the state information together with the data and control information obtained from the monitored bus and a time stamp provided by a time stamp generator. A DMA output control provides the sample information to a display computer. The method monitors the interface bus interactions and selectively stores the monitored data and control signals when an analysis of those signals indicate that a transition has occurred. Two parallel, distinct look-up tables store state information and default information and are substantially entered at the same time to provide separate sets of table data. One set of table data is chosen depending upon predetermined criteria.
Inventors
- 👤 Lee J. Silverthorn, III
- 👤 Philip A. Gaudette
- 👤 Arthur W. Holt
- 👤 George G. Nacht
- 👤 Robert B. J. Warnar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 10:05
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/30; G06F11/34; G06F11/3466; G06F11/348; G06F11/349; G06F11/22; G06F11/25
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
150 words
A method for automatically interpreting data signals and control signals transmitted on a high speed bus, wherein the possible combinations of different data and control signals form a finite plurality of different states, the method comprising: monitoring data and control signals being transmitted on the bus; selectively storing said monitored data and control signals in a memory; generating a hash key from the stored signals; selecting data at substantially the same time from two distinct look-up tables respectively stored in a first reference memory and a second reference memory which are connected in parallel, said data of one of said look-up tables being selected by using the generated hash key to produce an entry address into said one look-up table; interpreting the state of the signals and choosing one of the two selected table data based on predetermined criteria; and using said selected table data to provide current state information.
Claim 2
Independent Claim
150 words
A method for automatically interpreting data signals and control signals transmitted on a high speed bus, wherein the possible combinations of different data and control signals form a finite plurality of different states, the method comprising: monitoring data and control signals being transmitted on the bus; selectively storing said monitored data and control signals in a memory; generating a hash key from the stored signals; selecting data at substantially the same time from two distinct look-up tables respectively stored in a first reference memory and a second reference memory which are connected in parallel, said data of one of said look-up tables being selected by using the generated hash key to produce an entry address into said one look-up table; interpreting the state of the signals and choosing one of the two selected table data based on predetermined criteria; and using said selected table data to provide current state information.
Claim 3
Dependent Claim
47 words
A method for monitoring interfaced bus interactions as claimed in claim 1 wherein said selective storing step further comprises analyzing the monitored signals, detecting the presence of any unexpected data or unexpected control signals, and storing said signals upon said detection of unexpected data or control signals.
Claim 4
Dependent Claim
29 words
A method for monitoring interfaced bus interactions as claimed in claim 2 wherein said hash key is generated from stored signals that represent the current state of the automation.
Claim 5
Dependent Claim
57 words
A method for monitoring interfaced bus interactions as claimed in claim 2 and further including generating a signal to indicate whether the produced address is within the range of said one look-up table, and when said produced address is not within said range using said generated signal to select the data stored in said other look-up table.
Claim 6
Dependent Claim
56 words
A method for monitoring interfaced bus interactions as claimed in claim 3 wherein said one look-up table stores a first type of data representing regular actions and said other look-up table stores a second type of data representing default transitions; and wherein the entry address into said other look-up table is determined by the current state.
Claim 7
Dependent Claim
47 words
A method for monitoring interfaced bus interactions as claimed in claim 5 wherein the data in said one look-up table is chosen when the state check matches the current state, and the data in said other look-up table is chosen at least when there is no match.
Claim 8
Dependent Claim
261 words
A hardware electronic system connectable to a data and control signal bus for interpreting finite state automata, each finite state automatum (FSA) having a finite plurality of different states, said bus transmitting different sets of data and control signals at different clock times, said system comprising: input means detachably connectable to the bus for receiving the data and control signals; an addressable regular memory means for storing a plurality of regular codes, including a default memory address code and a hash key code; an addressable default memory means for storing a plurality of default codes, including a default memory address code and a hash key code; latching means selectively connected to said regular memory means and said default memory means for storing a default memory address code and a hash key code provided by said regular memory means or said default memory means; hash coder means connected to receive the data and control signals from said input means and connected to provide an output to said regular memory means, and also connected to receive a hash key code from said latching means, said hash coder means for interpreting the FSA state in response to said hash key code and in response to the received data and the control signals, and for generating a regular memory address and a selector signal; memory selector means connected to receive said selector signal from said hash coder means for selecting in response to said selector signal data from either said regular memory means or from said default memory means for storage in said latching means.
Claim 9
Dependent Claim
261 words
A hardware electronic system connectable to a data and control signal bus for interpreting finite state automata, each finite state automatum (FSA) having a finite plurality of different states, said bus transmitting different sets of data and control signals at different clock times, said system comprising: input means detachably connectable to the bus for receiving the data and control signals; an addressable regular memory means for storing a plurality of regular codes, including a default memory address code and a hash key code; an addressable default memory means for storing a plurality of default codes, including a default memory address code and a hash key code; latching means selectively connected to said regular memory means and said default memory means for storing a default memory address code and a hash key code provided by said regular memory means or said default memory means; hash coder means connected to receive the data and control signals from said input means and connected to provide an output to said regular memory means, and also connected to receive a hash key code from said latching means, said hash coder means for interpreting the FSA state in response to said hash key code and in response to the received data and the control signals, and for generating a regular memory address and a selector signal; memory selector means connected to receive said selector signal from said hash coder means for selecting in response to said selector signal data from either said regular memory means or from said default memory means for storage in said latching means.
Claim 10
Dependent Claim
72 words
A hardware electronic system as claimed in claim 7 wherein said latching means stores said default memory address code and said hash key code during one clock time and said stored default memory address code is used during the next clock time to address said default memory means; and wherein said default memory means and said regular memory means are addressed and provide their respective stored codes during a single clock time.
Claim 11
Dependent Claim
29 words
A hardware electronic system as claimed in claim 7 and further including storage means connected to said input means for storing a sample of said data and control signals.
Claim 12
Dependent Claim
57 words
A hardware electronic system as claimed in claim 9 and further including a time stamp generator for providing a time stamp; and wherein said sample storing means further comprises means connected to said time stamp generating to receive the time stamp of when said sample was taken and storing said received time stamp with said stored sample.
Claim 13
Dependent Claim
32 words
A hardware electronic system as claimed in claim 7 and further including control means connected to a host computer for loading table data into said regular memory and into said default memory.
Claim 14
Dependent Claim
54 words
A hardware electronic system as claimed in claim 7 and further including bus trap means connected to said input means, said bus trap means including means for storing the received data signals and means for storing data templates, said bus trap means for comparing said data signals stored therein with said stored data templates.
Claim 15
Dependent Claim
37 words
A hardware electronic system as claimed in claim 7 and further including means for detecting a transition in the received control signals, said detecting means including means for generating clock signals upon said detection of a transition.
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) | 1991-08-16 | 1992-02-15 | 1992-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-16 | 1996-02-15 | 1996-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-16 | 2000-02-15 | 2000-08-16 | $7700.00 | Window Closed / Lapsed |