Patent ID: 8677364

Claim:
A computer-readable, non-transitory medium storing a series grouping program which causes a computer to perform a procedure comprising: identifying a task executed on a first device and a sequence of tasks executed on a second device, on the basis of messages exchanged between the first device and second device; and producing a series of tasks from a callee-eligible sequence of tasks executed on the second device during a processing time of the identified task on the first device, with reference to models stored in a memory to define caller-callee relationships between caller tasks on the first device and callee tasks on the second device, by selecting one of the models that defines the identified task on the first device as a caller task and extracting a portion of the callee-eligible sequence that matches at least in part with the callee tasks defined in the selected model while excluding therefrom the tasks that cannot be the callee tasks; wherein: the tasks executed on the second device are classified into exempt elements which are exempt from comparison with the models and non-exempt elements which are to be subjected to comparison with the models; and the producing finds in the callee-eligible sequence a first non-exempt element that is qualified for a callee task as a result of comparison of the callee-eligible sequence with the selected model, as well as a second non-exempt element that is found to be ineligible for a callee task as a result of comparison of the callee-eligible sequence with the selected model, and when one or more exempt elements are found between the first non-exempt element and the second non-exempt element, produces a series of tasks by dividing the callee-eligible sequence at a point immediately before or after one of the found exempt elements.