Patent US5299206A successfully refreshed from Google Patents.
US5299206A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for analyzing complex sequences in trace arrays using multiple finite automata
Assignee: Hewlett Packard Development Co LP
•
Filing: 1991-10-24
•
Granted: 1994-03-29
•
Expires: 2011-10-24
Abstract
Abstract A system and method for analyzing complex overlapping sequences of events in trace arrays, with the system having an input for receiving regular expressions that have been grouped in a predetermined manner, a generator for receiving the grouped regular expressions and generating multiple finite automata based on the groupings of regular expressions, with each finite automaton being generated using arithmetic/logic expressions to permit the use of a substantially infinite alphabet, an input for the trace array, and an analyzer for searching the trace array simultaneously with the multiple finite automata and providing a way by which the multiple finite automata may communicate with one another during searching, with the analyzer further outputting the results of the search.
Inventors
- 👤 Arthur J. Beaverson
- 👤 Charles J. DeVane
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 10:01
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/22; G06F11/25
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
122 words
A system for searching complex sequences in trace arrays, comprising: first input means for receiving regular expressions in predetermined groupings, with the regular expressions defining desired patterns to be searched for in a trace array; generator means connected to the input means for receiving the grouped regular expressions input via the first input means and generating a finite automaton for each of the groupings of regular expressions, with each finite automaton using arithmetic/logic expressions; second input means for receiving the trace array; and analyzer means that is connected to the second input means and an output of the generator means, and for searching for predetermined patterns of data in the trace array based on the multiple finite automata which use arithmetic/logic expressions.
Claim 2
Independent Claim
122 words
A system for searching complex sequences in trace arrays, comprising: first input means for receiving regular expressions in predetermined groupings, with the regular expressions defining desired patterns to be searched for in a trace array; generator means connected to the input means for receiving the grouped regular expressions input via the first input means and generating a finite automaton for each of the groupings of regular expressions, with each finite automaton using arithmetic/logic expressions; second input means for receiving the trace array; and analyzer means that is connected to the second input means and an output of the generator means, and for searching for predetermined patterns of data in the trace array based on the multiple finite automata which use arithmetic/logic expressions.
Claim 3
Dependent Claim
33 words
The system as recited in claim 1, wherein the trace array has extra columns for writing to if a finite automaton of multiple finite automata finds a desired pattern in the trace array.
Claim 4
Dependent Claim
20 words
The system as recited in claim 1, wherein the system further comprises means for communicating among the multiple finite automata.
Claim 5
Dependent Claim
23 words
The system are recited in claim 1, wherein the analyzer further comprises means for searching the trace array simultaneously with multiple finite automata.
Claim 6
Dependent Claim
19 words
The system as recited in claim 1, wherein the arithmetic/logic expressions are capable of defining a substantially infinite alphabet.
Claim 7
Dependent Claim
18 words
The system as recited in claim 5, wherein the arithmetic/logic expressions may comprise predetermined operators, numbers, and fields.
Claim 8
Dependent Claim
29 words
The system as recited in claim 5, wherein the substantially infinite alphabet having a character set of 2 192 and greater characters may be supported by using arithmetic/logic expressions.
Claim 9
Dependent Claim
28 words
The system as recited in claim 1, wherein the trace array has up to and greater than 192 columns for signals being sampled at a point in time.
Claim 10
Dependent Claim
27 words
The system as recited in claim 1, wherein the trace array has up to and greater than 2,097,152 rows for samples of all signals that are taken.
Claim 11
Independent Claim
81 words
A method for searching complex sequences in trace arrays, comprising the steps of: (a) inputting regular expressions in predetermined groupings, with the regular expressions defining desired patterns to be searched for in the trace array; (b) generating multiple finite automata which use arithmetic/logic expressions, with the each grouping of regular expressions forming a finite automaton; (c) reading the trace array and searching for predetermined patterns with the multiple finite automata which use arithmetic/logic expressions; and (d) outputting results of the search.
Claim 12
Independent Claim
81 words
A method for searching complex sequences in trace arrays, comprising the steps of: (a) inputting regular expressions in predetermined groupings, with the regular expressions defining desired patterns to be searched for in the trace array; (b) generating multiple finite automata which use arithmetic/logic expressions, with the each grouping of regular expressions forming a finite automaton; (c) reading the trace array and searching for predetermined patterns with the multiple finite automata which use arithmetic/logic expressions; and (d) outputting results of the search.
Claim 13
Dependent Claim
22 words
The method as recited in claim 10, wherein the method further comprises the step of communicating among the finite automata during searching.
Claim 14
Dependent Claim
29 words
The method as recited in claim 10, wherein step (b) further comprises generating multiple finite automata which use arithmetic/logic expressions that permit the use of a substantially infinite alphabet.
Claim 15
Dependent Claim
30 words
The method as recited in claim 12, wherein the step (b) further comprises generating multiple finite automata which use arithmetic/logic expressions, with the expressions including predetermined operators, numbers, and fields.
Claim 16
Dependent Claim
45 words
The method as recited in claim 10, wherein step (b) further comprises generating multiple finite automata which use arithmetic/logic expressions, with the arithmetic/logic expressions permitting the use of a substantially infinite alphabet having a character set of up to and greater than 2 192 characters.
Claim 17
Dependent Claim
18 words
The method as recited in claim 10, wherein step (c) further comprises searching simultaneously with multiple finite automata.
References Cited (Backward Citations)
US3568156A
Cited
US4241402A
Cited
US4550436A
Cited
US4697242A
Cited
US4764863A
Cited
US4924468A
Cited
US4924466A
Cited
US5163016A
Cited
US5138669A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-03-28 | 1997-09-27 | 1998-03-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-03-28 | 2001-09-27 | 2002-03-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-03-28 | 2005-09-27 | 2006-03-29 | $7700.00 | Window Closed / Lapsed |