System and method for analyzing complex sequences in trace arrays using multiple finite automata
First Claim
1. 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.
3 Assignments
0 Petitions
Accused Products
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.
-
Citations
15 Claims
-
1. 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. 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. - View Dependent Claims (11, 12, 13, 14, 15)
-
Specification