Patent ID: 9292604
Filing Date: 2016-03-22
CPC Classification: G06F

Claim Text:
1. A computer-implemented process for crawling rich Internet applications, comprising: executing an event in a set of events discovered in a state exploration phase according to a predetermined priority of events in each set of events in the sets of events discovered, wherein the event from a higher priority is exhausted before an event from a lower priority is executed; determining any transitions; executing a remaining set of events in a transition exploration phase, responsive to a determination that there are at least one transition; determining existence of any new states as a result of executing an event in the set of events; and returning to the state exploration phase, responsive to a determination that a new state exists; wherein executing sets of events discovered in the state exploration phase comprises: identifying all events in a current state with respect to an application; classifying sets of events associated with the current state to form classified events; identifying a next event to execute according to a priority associated with the classification; in response to determining there exists a next event to execute, identifying a shortest path to the next event to execute responsive to a determination that a next event exists for execution, comprising: estimating the shortest path by a path estimator using a path construction policy starting at the current state using a breadth first search to find the shortest path to a state that contains an action with a highest chance of leading to a new state, wherein the path estimator uses assumptions about uncategorized event and menu event results to build the path which includes one or more events.