JP6741417B2 - Test measuring device and trigger method - Google Patents

Description

The present invention relates to a trigger in a test measurement device, and more particularly to a test measurement device and a trigger method for generating a trigger from a high-level description of a protocol set by a user.

The trigger processing system has been part of the test and measurement equipment for some time. However, triggering systems typically rely on conditions associated with the underlying signal (eg, that signal rises above (or falls below) a threshold voltage).

Japanese Patent Publication No. 2007-522453 U.S. Pat. No. 7797346 Special table 2004-523166 gazette JP, 2007-286025, A US Patent No. 9069017 Japanese Patent No. 5605842

"Breadcrumb (navigation)" article, Wikipedia (English version), [Online], [Search October 23, 2015], Internet, <https://en.wikipedia.org/wiki/Breadcrumb_(navigation)> "Breadcrumbs list" article, Wikipedia (Japanese version), [Online], [Search on October 23, 2015], Internet, <https://ja.wikipedia.org/wiki/Breadcrumbs list>

Establishing a trigger condition based on the data carried in the base signal when it is decoded and found to match a particular protocol is a very complex situation, and if at all, At the moment, it's not easy.

Embodiments of the present invention seek to solve this and other problems associated with the prior art.

The present invention can be described from various concepts as follows.

Concept 1 of the present invention is a system,
A test and measurement device,
A memory in the test and measurement device that stores a state machine corresponding to a regular expression,
A receiver that receives trigger conditions from the user,
And a state machine changing unit for changing the state machine to reflect the trigger condition.

The concept 2 of the present invention is the system according to the concept 1 described above, in which the trigger condition includes a compound trigger condition.

The concept 3 of the present invention is the system according to the concept 2, in which the state machine changing unit duplicates the state machine for each value in the composite trigger condition, It is operative to modify each of the duplicated state machines to include a value and combine the modified duplicate of the state machines.

The concept 4 of the present invention is the system according to the above concept 1, wherein
The receiver operates to receive a bit stream,
The above system
A processing engine for processing the bit stream using the state machine,
And a trigger system for sending a trigger if the above trigger conditions are met.

Concept 5 of the present invention is the system according to Concept 1 above, wherein the state machine changing unit includes a state machine optimizing unit.

The concept 6 of the present invention is the system according to the above concept 5, in which the state machine optimizing unit detects from the changed state machine all the states that have occurred after the trigger condition is satisfied. Works to remove.

The concept 7 of the present invention is the system according to the concept 5, wherein the state machine optimizing unit combines a plurality of states that can satisfy the trigger condition with an arbitrary value into a single state. Works like.

Concept 8 of the present invention is a system according to Concept 1 above, wherein the state machine modification unit operates to set the state machine to compare the bit stream with a user selected value. To do.

The concept 9 of the present invention is a system according to the above concept 1, wherein
The receiver operates to receive the regular expression from the user,
The system further comprises a state machine generator that generates the state machine from the regular expression.

The concept 10 of the present invention is the system according to the above concept 9, further comprising a state machine optimizing unit for optimizing the state machine.

Concept 11 of the present invention is a method,
A process of identifying a state machine corresponding to the regular expression stored in the test and measurement device,
The process of receiving a trigger condition from the user,
A process of identifying a state in the state machine used in the trigger condition received from the user,
Changing the identified state in the state machine to reflect the trigger condition received from the user;
Storing the modified state machine in the test and measurement device.

The concept 12 of the present invention is the method according to the above concept 11, wherein:
The process of receiving the trigger condition from the user includes the process of receiving the compound trigger condition from the user,
The process of identifying a state in the state machine used in the trigger condition received from the user determines a plurality of states in the state machine used in the compound trigger condition received from the user. Including the processing to specify,
Modifying the identified state in the state machine to reflect the trigger condition received from the user, replicating the state machine for each value in the composite trigger condition, and Modifying the identified state in the duplicated state machine to reflect the corresponding value in the trigger condition received from the user, and combining the duplicated state machines. Including.

Concept 13 of the present invention is a method according to concept 11 above, wherein
The process of receiving the bit stream,
Processing the bit stream using the modified state machine;
If the state machine indicates that the trigger condition is met, the triggering system of the test and measurement device is further utilized.

The concept 14 of the present invention is the method according to the concept 11, wherein the process of changing the specified state in the state machine to reflect the trigger condition received from the user is changed. A process for optimizing the state machine that has been created.

Concept 15 of the present invention is the method according to concept 14, wherein the process of optimizing the modified state machine occurs after the trigger condition is met from the modified state machine. It also includes a process for removing all the states.

The concept 16 of the present invention is the method according to the above concept 14, in which the process of optimizing the modified state machine has a plurality of adjacent states that can satisfy the trigger condition with an arbitrary value. Including a process to combine the above into a single state.

Concept 17 of the present invention is the method according to Concept 11, wherein the process of changing the identified state in the state machine to reflect the trigger condition received from the user is Includes a process to change the identified state to compare the stream with a user selected value.

The concept 18 of the present invention is the method according to the above concept 11, in which the process of identifying the state machine stored in the test and measurement device is:
The process of receiving the regular expression from the user,
And a process of generating the state machine from the regular expression.

The concept 19 of the present invention is the method according to the concept 18, wherein the process of identifying the state machine stored in the test and measurement device further comprises the process of optimizing the state machine. ..

FIG. 1A shows an example of a protocol that matches a particular packet. FIG. 1B shows a state machine that can match the packet of FIG. 1A. FIG. 1C shows a state machine that can be triggered for conditions containing data in the packet of FIG. 1A. FIG. 2A shows a second example of a protocol that matches several packets. FIG. 2B shows a non-optimized state machine that matches the packet of FIG. 2A. FIG. 2C shows an optimized state machine that matches the packet of FIG. 2A. FIG. 2D shows a state machine that can be triggered for conditions containing data in the packet of FIG. 2A. FIG. 3A shows an example of the state machine of FIG. 1B modified to reflect a composite trigger condition. FIG. 3B shows another example of the state machine of FIG. 1B modified to reflect a composite trigger condition. FIG. 4 can generate and utilize the state machine of FIGS. 1B-1C and 2B-2D to trigger a test and measurement device when various trigger conditions are met, and FIGS. 1B-1C and 2B. 2 shows a test and measurement device, according to an embodiment of the invention, capable of storing in memory a breadcrumbs reflecting the operation of a 2D state machine. FIG. 5 shows the state machine changer of FIG. 4 in more detail. FIG. 6 shows the breadcrumb trail of FIG. 4 in more detail. FIG. 7A shows a flowchart of a portion of a procedure for generating a trigger state machine from protocol and user settings using the test and measurement device of FIG. 4 according to an embodiment of the invention. FIG. 7B shows a flowchart of the rest of the procedure for generating a trigger state machine from protocol and user settings using the test and measurement device of FIG. 4 according to an embodiment of the invention. FIG. 8 shows a flow chart of a procedure for generating a trigger state machine from a protocol and compound trigger conditions using the test and measurement device of FIG. 4 according to an embodiment of the present invention. FIG. 9 shows a flow chart of a procedure for optimizing a state machine using the test and measurement apparatus of FIG. 4 according to an embodiment of the present invention. FIG. 10 shows a flowchart of a procedure according to an embodiment of the present invention that utilizes the test and measurement device of FIG. 4 to utilize the process of creating a state machine capable of storing a breadcrumb trail.

Before describing how the present invention works, it is instructive to understand the relationship between regular expressions and state machines. Given a regular expression, we can build a state machine that represents the regular expression. The state machine can then be used to determine if a particular input matches the regular expression. If the state machine proceeds to the final state, which may be acceptable, the input is matched with the regular expression, and if not, the input does not match the regular expression.

FIG. 1A shows an example protocol for a packet of data, named “data packet” and expressed as a regular expression. The protocol 105 describes a packet of data. When the bitstream is compared against this regular expression, the system can determine if the packet can be found in that bitstream.

FIG. 1B shows a state machine corresponding to the regular expression of FIG. 1A. State machine 110 has states 115, 120, 125, 130, 135, 140 and 145, with transitions between these states. Each state (which can also be called a node or vertex) describes what data needs to match to enter that state (acceptance criteria). Each arrow is a path that can be traversed if the target acceptance criteria for that condition are met. With the exception of the Start state 115 and Success state 145, these states sequentially correspond to the data expected by the packet. Thus, state 120 matches state S in the bit stream, state 125 matches 3 bits of data for the field labeled "begin", and state 130 states "addr." Matches 4 bits of data for the field labeled "," and so on. If all the data can be matched by multiple states of the state machine 110, when the success state 145 is reached, the system can declare that packet "data packet" was successfully matched. ..

State machine 110 represents a simplified version of the actual state machine. For example, the state machine 110 does not label transitions between various states, nor does the state machine 110 indicate an error state or transition used when the data does not match what is expected. .. Those skilled in the art will understand how state machine 110 operates without these details.

Formally, in mathematical terms, a state machine is represented as a five-component (Σ, S, s ₀ , δ, F), where Σ is an alphabet (as recognized by the state machine. Is a set consisting of a plurality of symbols), S is a set consisting of a plurality of states in the state machine (set: set, group), s ₀ is an initial state, δ is a transition function, and Map each state and each symbol in Σ to one state in S, which may be the same state as the input, and F is a set of multiple final states in S. Is. Thus, the state machine 110 can be more formally represented as (Σ,S,s ₀ ,δ,F), where:

Σ={S,0,1,...} (There are more recognized symbols (although these are the only symbols recognized by the state machine) than state S and binary values 0 and 1 alone) Can exist)

S={110,115,120,125,130,135,140,145}

s ₀ =110

δ (δ is not elaborated here in more detail because it is very cumbersome to represent its complete transition function and would be of little value)

F={145}

In fact, this representation of state machine 110 is not always perfect. Transitions typically occur on individual symbols rather than on groups of symbols. Thus, the transition from state 120 to 125 can actually include three transitions (and, therefore, some intermediate states) (what is recognized for each bit is that its field is "begin"). "). However, even with simplification, one of ordinary skill in the art will understand how state machine 110 operates.

The user may want to trigger an operation in the state machine 110 when a particular value is read for a given state. For example, the user may want to trigger some processing if the address field holds the value 10 (binary value 1010, hexadecimal A). FIG. 1C shows an example of how the state machine 110 can be modified to implement this trigger. In FIG. 1C, instead of matching any possible value with respect to the address field, state machine 150 compares the bit stream to a particular value 1010 (in state 155). If it finds the value if, subsequently, in the state 160, believed to trigger it is met, and to initiate trigger processing (the processing can be of any type).

Note that states 115 and 120 are the same for state machine 150 and state machine 110 (state 115 is the state machine started state and state 120 is the state of the bit stream). Matches S). However, state 165 differs from state 125 in that it does not care if a particular field has been read. In other words, in state 165, all that matters is that three bits are read from the bit stream. State 155 is also different from state 130 because state 155 is not concerned with whether it matches its address field (as in state 130), but only with its particular bit pattern 1010. Finally, once the user's conditions have been matched, no further matching processing needs to be performed, so the state machine 150 has no analog of states 135 and 140. That is, the trigger can be issued immediately after the condition is satisfied.

1A-1C show a fairly simplified example of a regular expression, a state machine that matches this regular expression, and a trigger state machine. (A trigger state machine is sometimes simply referred to as a "state machine", but it is understood by one of ordinary skill in the art that a particular state machine is a trigger state machine or a regular state machine. It can be determined if it is a state machine that matches the expression.) Figures 2A-2D show more complex examples. In FIG. 2A, regular expressions for three different packets are shown. These regular expressions can be converted to a state machine, as shown in Figure 2B. Note that the state machine 205 of FIG. 2B utilizes a single start state to cover the three possible protocols.

State machine 205 is available as shown. However, to use the state machine 205 as shown would require read ahead or backtracking, which would require additional memory and slow down the processing of the bit stream. For example, if there are multiple states possible for a particular input, suppose that leftmost is preferred (FIG. 2B is read by a person rather than how the processor uses state machine 205). For deaf). For example, note that all of states 210, 215 and 220 match the Begin state, and all of states 225, 230 and 235 match four bits as the slave address field. Using the leftmost first approach, the system would be in state 225 after reading the Begin state and 4 bits as the slave address field. However, if the next bit to read is 0, the system must follow the wrong branch of state machine 205 and rewind state machine 205 in an attempt to find the correct branch. Let's do it. This is an example of backtracking. Obviously, if the state machine 205 were to go backwards and have to process different branches, it would slow down the bit stream. To avoid backtracking using the state machine 205 would require a look-ahead operation (the system would have to somehow look up the bit stream for the upcoming bits). Lookahead is also complicated and expensive.

The state machine 205 can be optimized to avoid both backtracking and read ahead. State machine 240 of FIG. 2C illustrates an example of an optimized state machine. According to the state machine 240, there is no need to read ahead and there is no concern about backtracking. Given any prefix (leading value) of any of the packets (up to the entire packet, including the entire packet), there is only one possible path through the state machine 240 that matches that prefix. .. Therefore, there is no need to look ahead and worry about backtracking. That is, given a particular state in state machine 240 and a particular input symbol, there is only one possible state to transition to (this state is not shown in FIG. 2C for simplicity). It may be an error condition).

Optimization can be achieved using the following procedure. Start by walking a tree from the start state and combine multiple nodes that are equivalent and have the same parent (ie, combine them into a single node). The process can be repeated until there are no similar nodes to combine. Next, find multiple equivalent Success states, combine them, and then combine equivalent nodes that have the same children (the process is repeated until there are no more nodes to combine).

FIG. 2D shows an example of a specific trigger state machine customized by the user. In FIG. 2D, the user has selected to trigger if the address field (not the slave address field) of the packet in the regular expression is set to the value 0. This field does not appear in the Register 0 Write of the packet, so this entire branch of that state machine can be eliminated from the trigger state machine 245. Any value can match against the slave address field, after which bits 0 and 1 must match. Then any bit can occur (the actual bit will depend on the particular packet being read, but the trigger state machine 245 does not care what value it receives), and then the address Receive the bits for the field and compare with the value 0. If the value 0 matches for the address field, the trigger state machine 245 is successful and the trigger can begin.

The above example utilizes a single trigger criterion expressed as an equation. However, there is no reason to limit the trigger condition to an equation. Apart from the equation (==), examples of other trigger conditions are not equal (!=), less than (<), less than (<=), greater than (>), or greater than (>=). ) Is possible. In addition, the trigger condition may depend only on a subset of the information in the fields in the regular expression. For example, in FIG. 2D, the user may be only interested in whether the middle 3 bits of the address field are equal to 001 (at the beginning of the address field, which has a total of 5 bits). The last bit may match any value). It is also possible to set the trigger condition depending only on reaching a particular state. For example, the user may be interested in knowing when the address field was reached, regardless of its actual value.

In addition, the trigger condition need not be limited to a single criterion (which is called one simple trigger condition). The user can specify a plurality of criteria (composite trigger conditions) combined by using AND and OR operators in any desired combination. Thus, the state machine can test multiple conditions, any of which may include a set of sub-conditions and the like. One of ordinary skill in the art will know how to simplify the user-supplied condition into a Disjunctive Normal Form or a Conjunctive Normal Form, which is the state -The structure of the machine can be simplified. (The sum-of-products standard form refers to a disjunction of a conjunctive clause, that is, a logical expression expressed as an OR (logical sum) of AND (logical products). Similarly, it represents AND (logical product) of OR (logical sum).)

3A-3B show an example of a state machine with compound trigger conditions. In FIG. 3A, the user has specified the trigger condition of (addr == 0xA && parity == 1). Such a trigger condition is a conjunction (conjunction) of two conditions. This trigger condition requires both of the two states to have specific values, so the two states in the state machine are set to specific values (specified by the user). The values of the other states are usually insignificant and can be combined into a single state.

In FIG. 3B, the user has specified a specific trigger condition (disjunctive trigger condition) of (addr == 0xA || parity == 1). This trigger condition requires that one of the two states have a particular value, so two state machines with separate conditions can be established and integrated using the optimization techniques described above. Although this trigger condition applies to one state machine due to disjunction, there are two possible paths to a success trigger.

3A-3B give an example containing a single AND or OR that combines two possible trigger values. However, it will be clear that this process can be generalized to more complex trigger conditions. For example, if the trigger condition contains two values that are combined in an AND operation, or another value (an expression in the form of (X AND Y) OR Z), the state machine can be copied. good. One copy can be modified to reflect the first value of the AND operation, the second copy can be modified to reflect the second value of the AND operation, and the third copy can modify the remaining values of the OR operation. Can be changed to reflect. The first two state machines can then be combined and optimized with a third state machine to represent a composite trigger condition.

Now that the trigger state machine has been described, a system capable of utilizing the trigger state machine can be described. FIG. 4 illustrates a test and measurement device in accordance with an embodiment of the present invention that can generate and utilize the state machines of FIGS. 1B-1C and 2B-2D that trigger the test and measurement device when various trigger conditions are met. .. The system may include a test and measurement device 405. The test and measurement device may be any desired test and measurement device, such as an oscilloscope, among other possibilities.

The test and measurement device 405 may include a memory 410. Memory 410 can store information such as state machine 415. State machine 415 may be a state machine utilized to match a regular expression, in other words, a state machine such as state machines 110, 205 and 240 of FIGS. 1B, 2B and 2C. State machine 415 may be a trigger state machine, such as state machines 150 and 245 of FIGS. 1C and 2D.

The test and measurement device 405 may also include a receiver 420 that may receive input from the test and measurement device 405. Input can be received in any way. For example, the receiver 420 includes a user interface for a user to enter information such as a trigger condition 425 (which itself may include, for example, a user-selected value 430 for a particular bit field). You can go out. Alternatively, the receiver 420 may include receiving a signal containing a bitstream, such as the bitstream 435 to be analyzed. The receiver 420 may also receive a regular expression 440 (eg, through an integrated development environment (IDE)), which allows the system to identify the data it expects to receive in the bit stream 435, 415 (which is a state machine that recognizes the regular expression 440 or trigger state machine).

The test and measurement device 405 may also include various other units. The state machine changing unit 445 fetches an existing state machine (for example, one that matches data with the regular expression 440) and changes it so as to operate as a trigger state machine. As mentioned above, this is, among other possibilities, a process of removing states that occur after the trigger condition is met and a process of combining (combining) states of values that are not considered part of the trigger condition. Can be included.

Processing engine 450, various state machine (e.g., a trigger state machine that will be generated using a state machine or state machine changing unit 445 is generated using a regular expression 440 including) using The bit stream 435 can be processed. This process may include updating the current state for each of the various state machines as the bits are read from bit stream 435.

The trigger system 455 can send a trigger when the trigger condition is met, i.e. when the trigger state machine is met. The trigger system 455 can send a trigger to any desired component of the test and measurement device 405 to perform any action as a result of the trigger, as will be appreciated by those skilled in the art.

The state machine generator 460 can generate a state machine from the regular expression 440. As mentioned above, this may include generating a sequential series of matching fields in the order presented in the regular expression. It also includes the process of combining different state machines that match different regular expressions into a single state machine, optimizing the state machine to avoid read-ahead and backtracking problems. good.

Apart from generating and utilizing the trigger state machine, the test and measurement device 405 can also be used to generate a breadcrumb trail. The breadcrumbs allow the user to reproduce the behavior of the state machine and see how the data was processed. A breadcrumb trail, such as breadcrumb trail 465, is a few bits of data that can be stored in memory 410. Basically, you can save a breadcrumb trail each time you enter a state in the state machine. The breadcrumb gives rise to the type of state (eg error state, packet start, packet end or field), state ID (this can identify a field or packet) and entry (entry). Data such as times such as data start and stop times, etc. may be included. The person skilled in the art must refer to the concept of time literally (in seconds from the start of the signal, or by a fraction thereof), among other possibilities. It will be appreciated that reference may be made to the index to the signal rather than the thing. The breadcrumbs may also include additional data relevant to the analysis, as appropriate. Therefore, the user can customize the ID (identification) of the data to be included in the breadcrumbs.

Breadcrumbs can typically be generated using a trigger state machine. However, one of ordinary skill in the art will appreciate that there is no reason that any other state machine cannot be used to generate the breadcrumbs, and thus any state machine can be used to generate the breadcrumbs.

The test and measurement device 405 may include an analyzer 470 to support the generation of the breadcrumbs. The analysis unit 470 can analyze the bit stream 435 using a state machine. In operation, the analyzer 470 is similar to the processing engine 450, but their purpose is different. The processing engine 450 is responsible for matching the bits of the bit stream 435 in an attempt to recognize the regular expression, while the analyzer 470 is responsible for determining when to store the breadcrumbs in the memory 410. Also, the analyzer 470 and the processing engine 450 typically operate on different state machines: the analyzer 470 typically utilizes a trigger state machine (although it does not have to. ) On the other hand, the processor 450 utilizes a full state machine that matches the regular expression.

The test and measurement device 405 may also include a breadcrumbs generator 475. The breadcrumb trail generator 475 may store the breadcrumb trail in the memory 410 if it is time to generate the breadcrumb trail (eg, as determined by the analyzer 470 when a new state is entered). ..

Finally, the test and measurement device 405 may include a reproduction unit 480. Reproducer 480 allows the user to reproduce the behavior of the state machine for bit stream 435 (as processed by analyzer 470). This reproduction allows the user to follow (follow) what happened.

The test and measurement device 405 described above can handle either or both of a trigger state machine and a breadcrumb trail generation. Some test and measurement devices include the hardware and/or software necessary to process multiple state machines. If the test and measurement device can handle multiple state machines, then the test and measurement device 405 can perform both the trigger condition and the breadcrumb trail processing.

FIG. 5 shows the state machine changer of FIG. 4 in more detail. In FIG. 5, the state machine changing unit 445 is shown as including the state machine optimizing unit 505. The state machine optimization unit 505 can optimize the state machine as described above. Such optimization is possible either for state machines designed to match regular expressions or for trigger state machines.

FIG. 6 shows the breadcrumbs of FIG. 4 in more detail. In FIG. 6, the breadcrumb 465 is shown as including a format 605, an ID 610 and a time 615. As described above, the format 605 can identify the format of the state in which the breadcrumb 465 is generated. The ID 610 can identify a particular state in the state machine that generated the breadcrumb 465. And time 615 can identify the time (or index) in the signal when that state generated breadcrumbs 465.

7A-7B show a flow chart of a procedure for generating a trigger state machine from a protocol and user settings using the test and measurement device of FIG. In FIG. 7A, at block 705, the system may receive a regular expression. At block 710, the system may generate a state machine corresponding to the regular expression. At block 715, the system can optimize the state machine.

At block 720, the system can identify the state machine (which may be the same as the state machine generated at blocks 705-715) corresponding to the regular expression. At block 725, the system receives a trigger condition from the user. This can be, among other possibilities, for example a user-specified value (or part of a value) for a particular field in a regular expression, multiple such user-specified values, a field that should only be reached (reached). It may be included. At block 730, the system can identify one state (or more than one state) in the state machine that can be modified to execute the trigger condition.

At block 735 (FIG. 7B), the system may change the identified state and compare it with the user selected value. Block 740, the system can store the modified state machine. At block 745, the system may receive the bitstream. At block 750, the system can process the bit stream with the modified state machine. At block 710, the system can determine if the trigger condition was met. If so, then at block 755, the system can apply the trigger system.

As mentioned above, the trigger condition may be a compound trigger condition. In this case, the procedural flow chart can be modified to reflect the combined characteristics of the trigger conditions. FIG. 8 reflects this change. FIG. 8 modifies blocks 730 and 735 of FIGS. 7A-7B: the other blocks of FIGS. 7A-7B are unchanged and are therefore not shown in FIG.

In FIG. 8, at block 805, the system identifies the multiple states involved in the composite trigger condition. The number of states involved may be less than the number of simple conditions included in the composite trigger condition. For example, the compound trigger condition for the state machine shown in FIG. 1B may be (addr == 0xA || addr == 0xF). Note that the same state is used on both sides of the compound trigger condition. At block 810, the system duplicates the state machine once for each simple trigger condition in the composite trigger condition. Continuing with the example above, the composite trigger condition would include two simple trigger conditions (addr == 0xA || addr == 0xF), so the system would generate two replicas of the state machine. .. At block 815, within each duplicate state machine, the identified state is modified to reflect the comparison with the user-specified value. Finally, at block 820, the modified duplicate state machine is combined to produce a single state machine that reflects the composite trigger condition. At this point, processing continues at block 740 of Figure 7B.

FIG. 9 shows a flowchart of a procedure for optimizing a state machine using the test and measurement device of FIG. 4 according to an embodiment of the present invention. In Figure 9, at block 905, the system can be removed state arising after the trigger condition is satisfied. At block 910, the system may combine adjacent states that may satisfy any value into a single state.

FIG. 10 shows a flow chart of a procedure according to an embodiment of the present invention utilizing the process of creating a state machine capable of storing a breadcrumbs using the test and measurement device of FIG. At block 1005, the system may receive a regular expression. At block 1010, the system can generate a state machine from the regular expression. At block 1015, the system can optimize the state machine. At block 1020, the system can apply the state machine to the bitstream. At block 1025, the breadcrumb trail may be saved each time the system enters a state in the state machine. At block 1030, the system may utilize the saved breadcrumb trail to recreate the application of the state machine to the bit stream.

The above flow chart illustrates some possible embodiments of the invention. However, in other embodiments of the invention, the blocks may be arranged in different arrangements, including different blocks if desired, omitted, or repeating one block (or multiple blocks) as needed. it can. Embodiments of the present invention are intended to include all such variations of flowcharts.

Embodiments of the present invention can be extended to the following statements without limitation.

As an embodiment of the present invention, a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a trigger condition from a user, and the above trigger condition are reflected. There is a system that includes a state machine changing unit that changes the state machine.

As an embodiment of the present invention, a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a compound trigger condition from a user, and the compound trigger condition are reflected. Thus, there is a system including a state machine changing unit that changes the state machine.

As an embodiment of the present invention, a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a compound trigger condition from a user, and the compound trigger condition are reflected. And a state machine changing unit for changing the state machine, wherein the state machine changing unit duplicates the state machine related to each value in the composite trigger condition, and each of the duplicated state machines There is a system that modifies to include one value in the composite trigger condition and combines multiple modified duplicate state machines.

Embodiments of the present invention include a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a trigger condition and a bit stream from a user, and the trigger condition. A state machine changing unit that changes the state machine to reflect the above, a processing engine that processes the bit stream using the state machine, and sends a trigger if the trigger condition is satisfied. Some systems include a trigger system.

Embodiments of the present invention include a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a reception unit that receives a trigger condition from a user, and a state machine optimization unit. However, there is a system including a state machine changing unit that changes the state machine so as to reflect the trigger condition.

Embodiments of the present invention include a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a reception unit that receives a trigger condition from a user, and a state machine optimization unit. And a state machine changing unit for changing the state machine so as to reflect the trigger condition, the state machine optimizing unit is configured to meet the trigger condition from the changed state machine. There are systems that operate to eliminate all conditions that have occurred after

Embodiments of the present invention include a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a reception unit that receives a trigger condition from a user, and a state machine optimization unit. And a state machine changing unit that changes the state machine so as to reflect the trigger condition, and the state machine optimizing unit combines states that can satisfy the trigger condition with an arbitrary value. There are systems that work to combine.

As an embodiment of the present invention, a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a compound trigger condition from a user, and the compound trigger condition are reflected. And a state machine changing unit for changing the state machine, the state machine changing unit setting the state machine so as to compare the bit stream with a value selected by the user. ..

Embodiments of the present invention include a test measuring device, a memory in the test measuring device that stores a state machine corresponding to a regular expression, a receiving unit that receives a trigger condition and the regular expression from a user, and a regular expression from the regular expression. There is a system that includes a state machine generation unit that generates the state machine and a state machine change unit that changes the state machine so as to reflect the trigger condition.

As an embodiment of the present invention, a test measurement device, a memory in the test measurement device that stores a state machine corresponding to a regular expression, a receiving unit that receives a trigger condition from a user, and the above trigger condition are reflected. There is a system including a state machine changing unit for changing the state machine and a state machine optimizing unit for optimizing the state machine.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process for specifying a state in the state machine, a process for changing a state in the state machine specified so as to reflect the trigger condition received from the user, and the changed state Storing the machine in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test measurement device, a process of receiving a compound trigger condition from a user, and a process of receiving the compound trigger condition from the user. To identify multiple states in the state machine used in the above, to duplicate the state machine for each value in the composite trigger condition, and to reflect the trigger condition received from the user. A process of modifying the identified state in the state machine, the process of duplicating the state machine for each value in the composite trigger condition, and the identifying of the duplicated state machine. Modifying the state in the state machine having a process of modifying the state to reflect a corresponding value in a trigger condition received from the user and a process of combining a plurality of the replicated state machines. There is a method that comprises processing and storing the modified state machine in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process for specifying a state in the state machine, a process for changing the specified state in the state machine to reflect the trigger condition received from the user, and the changed state The process of storing the machine in the test and measurement device, the process of receiving the bit stream, the process of processing the bit stream using the modified state machine, and if the trigger condition is met. A process using the trigger processing system of the test and measurement device, as indicated by the state machine.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process for specifying a state in the state machine and a process for changing the specified state in the state machine to reflect the trigger condition received from the user, There is a method comprising a modifying process having a process for optimizing the state machine and a process for storing the modified state machine in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process for specifying a state in the state machine and a process for changing the specified state in the state machine to reflect the trigger condition received from the user, The modifying process having a process for optimizing the modified state machine including removing all states that have occurred after the trigger condition is satisfied from the state machine; and the modified state Storing the machine in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process for specifying a state in the state machine and a process for changing the specified state in the state machine to reflect the trigger condition received from the user, and an arbitrary value The modifying process having a process of optimizing the modified state machine including a process of combining a plurality of adjacent states capable of satisfying the trigger condition with a single state, and the modified state Storing the machine in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A bit stream, the process of specifying a state in the state machine and the process of changing the specified state in the state machine to reflect the trigger condition received from the user. Modifying the state machine including modifying the state identified to compare the modified state machine to the value selected by the user, and the modified state machine including the step of optimizing the modified state machine. And a process stored in the test and measurement device.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of using the trigger condition received from the user. A process of identifying a state in the state machine, the process of identifying the state including a process of receiving the trigger condition from the user and a process of generating the state machine from the regular expression; Comprising the step of changing the specified state in the state machine to reflect the trigger condition received from the user, and the step of storing the changed state machine in the test and measurement device. There is a way.

Embodiments of the present invention include a process of identifying a state machine corresponding to a regular expression stored in a test and measurement device, a process of receiving a trigger condition from a user, and a process of optimizing the state machine. A process of identifying a state in the state machine used in the trigger condition received from the user, and the identified state in the state machine to reflect the trigger condition received from the user Of the state machine and storing the changed state machine in the test and measurement device.

The following description is intended to provide a brief, general description of a suitable machine in which some aspects of the invention may be implemented. Typically, a machine includes a system bus to which a processor, memory, such as random access memory (RAM), read only memory (ROM), other state-keeping media, video interface. , And input/output interface ports are attached. The machine may be controlled, at least in part, by input from a conventional input device such as a keyboard, mouse, etc., as well as instructions received from another machine, interactive processing using a virtual reality (VR) environment. , Biofeedback, or other input signals. As used herein, the term "machine" is intended to broadly encompass a single machine or a communicatively coupled system of multiple machines or devices operating together. Typical machines include computing devices such as personal computers, workstations, servers, portable computers, handheld devices, phones, tablets, as well as private or public transportation such as cars, phones, taxis, etc. Includes transportation equipment such as institutions.

The machine may include embedded controllers such as programmable or non-programmable logic devices or arrays (such as FPGAs), ASICs, embedded computers, smart cards and the like. The machine may utilize one or more connections to one or more remote devices, such as via network interfaces, modems, or other communicative couplings. The plurality of machines may be interconnected by a physical or logical network such as an intranet, the internet, a LAN, a WAN and the like. For those skilled in the art, network communication includes radio frequency (RF), satellite, microwave, IEEE810.11., Bluetooth (registered trademark), optical communication, infrared communication, cable, laser, and the like, short-range wired or wireless. Understand that long distance carriers and protocols can be used.

The invention provides functions, procedures, data structures, application programs, etc. that, when accessed by a machine, result in the machine performing a task or defining an abstract data format or low level hardware context. It may be described by referring to or including related data. Relevant data includes, for example, volatile and/or non-volatile memory such as RAM and ROM, or HDD, FD, optical storage, tape, flash memory, memory stick, digital video disk, biological storage, etc. It may be stored in other storage devices including them and storage media related to them. The associated data can be sent in the form of packets, serial data, parallel data, propagated signals, etc. through a transmission environment, including physical and/or logical networks, and may be utilized in compressed or encrypted format. Relevant data may be recorded in a local or remote location utilized by the machine in a distributed environment.

Although the principles of the invention have been described and illustrated with reference to the illustrated embodiments, it will be understood that the described embodiments may be modified in arrangement and detail without departing from such principles. Although the above description has been focused on a particular embodiment, other configurations are possible. In particular, although the phrase “in an embodiment” is used in this application, such phrases generally mean the possibilities of the embodiment and are not intended to be limited to the configuration of the particular embodiment. .. As used herein, these terms refer to the same or different embodiments that may be combined with other embodiments.

405 Test measuring device 410 Memory 415 State machine 420 Receiver 435 Bit stream 440 Regular expression 465 Bread crumb list 470 Analysis unit 475 Bread crumb list generator 480 Reproducer 605 Format 610 ID
615 hours

Claims (3)

A test and measurement instrument for capturing signal carrying data based on a specific protocol,
And Rume Mori to store state machine corresponding to the protocol represented as a regular expression,
A receiver that receives the signal and receives a trigger condition related to a specific state in the state machine from a user,
And state machine changing unit for changing over the SL state machine to trigger state machine simplified to reflect the trigger condition,
A test and measurement device comprising: a trigger system for triggering the test and measurement device to capture a portion of the signal using the trigger state machine . A method of triggering a test and measurement device to capture a signal carrying data according to a particular protocol, comprising:
Stored in said test and measurement device, a process of specifying the state machine corresponding to the protocol represented as a regular expression,
A process of receiving a trigger condition related to a specific state in the above state machine from a user,
Processing to identify the particular state in the state machine used in the trigger condition received from the user;
A process of changing the trigger state machine by simplifying the state machine while changing the specific state in the state machine to reflect the trigger condition received from the user,
A process of storing the trigger state machine in the test and measurement device ;
Processing for receiving the above signal,
Using the trigger state machine, trigger how comprising a process to capture a portion of the signal over the trigger to the test and measurement device. The process of receiving the trigger condition from the user includes the process of receiving the compound trigger condition from the user,
The process of identifying the particular state in the state machine used in the trigger condition received from the user is performed by the plurality of states in the state machine used in the composite trigger condition received from the user. Including the process of identifying the state of
Processing for changing the specific state in the state machine to reflect the trigger condition received from the user, the process of duplicating the state machine for each value in the composite trigger condition, the user Modifying the identified state in the duplicated state machine to reflect the corresponding value in the trigger condition received from the; and combining the duplicated state machines. triggering how by claim 2.

Images