STAGE EVALUATION OF A STATE MACHINE

• US 20110219350A1
• Filed: 05/13/2011
• Published: 09/08/2011
• Est. Priority Date: 09/28/2005
• Status: Active Grant

• Current Assignee: The MathWorks, Inc.
• Original Assignee: The MathWorks, Inc.
• Inventors: RAGHAVAN, Vijay, MESTCHIAN, Ebrahim Mehran
• Granted Patent: US 8,214,783 B2
• Time in Patent Office: Days
• US Class Current: 716/136
• CPC Class Codes: G06F 8/10 Requirements analysis; Specification techniques

Abstract

The present invention provides a method and system for stage evaluation of a state machine model. Two types of transitions are used: first-stage transitions and second-stage transitions for a two-stage evaluation. In one embodiment, top-down processing and bottom-up processing may be combined using a two-stage evaluation. First-stage transitions are used with top-down processing while second-stage transitions are used with bottom-up processing. Certain conditions are used to determine if a switch from one type of stage processing to another type of stage processing is needed.

Claims

1. A non-transitory computer-readable medium that stores instructions executable by at least one processor, the computer-readable medium comprising one or more instructions for:

processing a current state in a representation having states and transitions;

detecting an event during the processing of the current state;

determining if the event can be handled in the current state; and

handling the event in the current state, if it is determined that the event can be handled in_the current state, otherwise, exceptionally handling the event the exceptionally handling including passing the event to another state in the representation.