Abstract:
An object of this invention is to analyze history information for each of a plurality of instances, and generate a time series pattern for each of a plurality of business processes. A time series pattern generating system analyzes the history information of an instance generated upon each execution of a class that defines a series of processes and is constituted by components having a defined order, and generates a time series pattern. The history information is generated upon each execution of the components, stored in chronological order, and includes a class identifier, a component identifier, an instance identifier, and component processing time information. Information relating to the processing order of the components that are executed in each instance is created, dependence relationships between the components are estimated, and a time series pattern including a component processing order is generated.

Description:
CLAIM OF PRIORITY 
       [0001]    The present application claims priority from Japanese patent application JP 2006-161200 filed on Jun. 9, 2006, the content of which is hereby incorporated by reference into this application. 
       BACKGROUND OF THE INVENTION 
       [0002]    This invention relates to a time series pattern generating system for generating a time series pattern relating to an operation processing order from an event log in which event records recorded with the processing history of a plurality of operations constituting a business process are arranged in chronological order. 
         [0003]    In recent years, demand for improvements in business efficiency, security and so on has increased together with the need to obtain a detailed understanding of business process conditions. In response to these needs, BAM (business activity monitoring) has been proposed as a technique for understanding business process conditions from a server side using a workflow system. In BAM, business process conditions are learned by recording and analyzing an operation processing history in accordance with a workflow that defines a processing order of operations constituting a pre-registered business process and dependence relationships therebetween. In addition to the operations defined in the workflow, however, an actual business is executed in conjunction with spreadsheet or plotting applications and so on that cannot be monitored on the server side, and therefore, with BAM alone, business process conditions cannot be understood accurately. 
         [0004]    To solve this problem, a method of recording the processing history of the business at the business venue has been proposed. In a technique disclosed in JP 2002-107473 A, for example, a recording application is installed on a terminal used for the business by an operator. At the start time and end time of each operation of each business process, the operator operates the recording application to input a business process name, an operation name, job identification information, and start/end times, and records these items as an event record. An event log is then generated by arranging the recorded event records in chronological order. With the technique disclosed in JP 2002-107473 A, business process conditions can be recorded in this manner. 
         [0005]    However, with the technique disclosed in JP2002-107473, only a method of recording an event log is disclosed, and therefore a technique for analyzing an event log including an extremely large number of recorded event records is required. 
         [0006]    Hence, JP 2006-004346 A discloses a technique for determining an order relationship between two event records included in an extremely large event log from a start time and an occurrence probability, and extracting an occurrence pattern of the event record by combining the obtained relationships. 
         [0007]    Further, JP 2005-062963 A discloses a technique for classifying event records hierarchically, and extracting and displaying a time series pattern, which indicates the frequent occurrence of relationships between event records on each tier of the hierarchy, from a start time and an occurrence probability. 
       SUMMARY OF THE INVENTION 
       [0008]    However, with the technique disclosed in JP 2006-004346 A, only the operation name, start time, and end time are subject to analysis in the event record, and therefore business process and job identification information is lost. Hence, event records cannot be classified for each business process, and an analysis result in which all business processes and all jobs are mixed together is obtained. 
         [0009]    Further, with the technique disclosed in JP 2005-062963 A, event records are classified according to a hierarchical structure such that high order event records correspond to business processes and low order event records correspond to operations. Further, the information held in the event records is constituted by the business process name, the operation name, the start time, and the end time. However, job identification information is not held in the event record, and therefore only a time series pattern mixing together information regarding all jobs can be extracted. 
         [0010]    The present invention focuses on such problems, and it is an object thereof to use information regarding each instance included in an event log effectively to analyze a time series pattern of a specified business process. 
         [0011]    A representative aspect of this invention is as follows. That is, there is provided a time series pattern generating system for analyzing history information of an instance, which is generated when one or more components having a defined order are executed in accordance with a class defining a series of processes, the class being constituted by the one or more components, and generating a time series pattern on the basis of a result of the analysis of the history information, comprising: a storage system which stores the history information; and a computer which generates the time series pattern on the basis of the history information, the computer comprising a processor, a memory connected to the processor, an input module into which the history information is input, and an output module which outputs the time series pattern, and the history information being generated upon execution of the components, which are stored in the storage system in chronological order of generation, and including a class identifier, a component identifier, an instance identifier, and information indicating a processing time of the components, in which the time series pattern generating system comprises: a history information generation module which extracts history information having an identical instance identifier and generates instance history information; a processing order information generation module which creates component processing order information relating to an instance generated upon execution of the components on the basis of the generated instance history information; and a time series pattern generation module which estimates a dependence relationship between the components on the basis of the created processing order information and generates a time series pattern including a processing order of the components. 
         [0012]    Here, a component denotes an individual operation of a business. A class defines a series of processes combining a plurality of components. An instance is a process defined in the class that has actually been executed. For example, in “payment slip processing” involving “product input”, “amount input”, and “acceptance”, “product input”, “amount input”, and “acceptance” correspond to components and the “payment slip processing” corresponds to a class. The “payment slip processing” business is executed in accordance with the defined class, and an instance is generated for every job, such as “a job in which a product A was processed at a module price a” and “a product B was processed at a module price b”. Further, executing a process in accordance with a class means executing the components included in the class. 
         [0013]    Meanwhile, a time series pattern is obtained by estimating and extracting a component processing order or the like on the basis of time series data included in history information generated upon execution of an instance. It should be noted that a time series pattern includes a pattern in which the extracted component processing order or the like is expressed as a directed graph. 
         [0014]    According to an embodiment of this invention, history information can be analyzed in business process units, and moreover, the history information of each instance of a business process can be used effectively to extract dependence relationships between operations constituting the business process and generate a time series pattern. 
     
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0015]    The present invention can be appreciated by the description which follows in conjunction with the following figures, wherein: 
           [0016]      FIG. 1  is a block diagram showing a time series pattern generating system according to an embodiment of this invention; 
           [0017]      FIG. 2  is a configuration diagram showing a modified example of the hardware configuration according to the embodiment of this invention; 
           [0018]      FIG. 3  is a block diagram showing the time series pattern generating system according to the embodiment of this invention; 
           [0019]      FIG. 4  is an explanatory diagram showing an event log according to the embodiment of this invention; 
           [0020]      FIG. 5  is an explanatory diagram showing an example of a command specification screen for transmitting the command to the business process name specification module, according to the embodiment of this invention; 
           [0021]      FIG. 6A  and  FIG. 6B  are an explanatory diagrams showing an intermediate data of event records extracted from an event log and including the specified business process, according to the embodiment of this invention; 
           [0022]      FIG. 7A  to  FIG. 7D  are an explanatory diagrams showing an event log for each instance according to the embodiment of this invention; 
           [0023]      FIG. 8  is a flowchart illustrating a processing when “dependence relationship” is specified as the type of time series pattern, according to the embodiment of this invention; 
           [0024]      FIG. 9  is an explanatory diagram showing an operation dependence relationship matrix of an instance, according to the embodiment of this invention; 
           [0025]      FIG. 10  is an explanatory diagram showing a procedure for extracting dependence relationships between operations constituting a specified business, according to the embodiment of this invention; 
           [0026]      FIG. 11  is an explanatory diagram showing a procedure for ordering extracted dependence relationships, according to the embodiment of this invention; 
           [0027]      FIG. 12  is a view expressing a time series pattern in the form of a directed graph, according to the embodiment of this invention; 
           [0028]      FIG. 13  is a flowchart illustrating a processing when “transition probability” is specified as the time series pattern analysis type, according to the embodiment of this invention. 
           [0029]      FIG. 14  is an explanatory diagram showing an operation-to-operation transition probability matrix for each instance, according to the embodiment of this invention; 
           [0030]      FIG. 15A  is an explanatory diagram showing a procedure for combining generated operation-to-operation transition probability matrices, according to the embodiment of this invention; 
           [0031]      FIG. 15B  is an explanatory diagram showing an operation-to-operation transition probability matrix which is generated according to the embodiment of this invention; and 
           [0032]      FIG. 16  is an explanatory diagram showing a time series pattern corresponding to the operation-to-operation transition probability matrix, according to the embodiment of this invention. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0033]    An embodiment of this invention will be described below on the basis of the attached drawings. 
         [0034]      FIG. 1  is a system diagram of a time series pattern generating system according to the embodiment of this invention. The time series pattern generating system comprises an operating terminal  1 , an operating terminal  2  and a management terminal  4 . In an embodiment of this invention, two operating terminals are provided, but the number of operating terminals is arbitrary. The operating terminals  1 ,  2  and the management terminal  4  are connected by a network  3 . The network  3  is an IP network, for example. 
         [0035]    The operating terminals  1  and  2  are computers used by an operator to execute a business. The hardware configuration thereof is identical to that of the management terminal  4  to be described below. The operating terminals  1  and  2  record an operation history (event record) of an operator and transmit the event record to the management terminal  4  over the network  3 . 
         [0036]    The management terminal  4  tabulates and analyzes received event records. The management terminal  4  comprises a CPU  6 , memory  11 , an input device  7 , an output device  8 , a communication interface  10 , a storage system  5 , and an I/O interface  12 . 
         [0037]    The CPU  6  executes various processes by executing a program stored in the memory  11 . The memory  11  stores the program executed by the CPU  6  and data required for the processes. The communication interface  10  connects to the network  3  to receive event records transmitted from the operating terminals  1 ,  2 . The storage system  5  accumulates received event records in chronological order, and stores them in an event log. 
         [0038]    The I/O interface  12  is connected to an external storage system  9 . The I/O interface  12  and external storage system  9  are connected by a SAN (Storage Area Network), for example. The external storage system  9  is capable of storing event log analysis results and so on as needed. 
         [0039]    The input device  7  is a keyboard, a mouse, or similar, for example, and inputs commands instructing event log analysis or the like, analysis parameters, and so on. The output device  8  is a display, a printer, or similar, for example, and outputs a time series pattern generated through analysis of the event log. 
         [0040]      FIG. 2  shows a modified example of the hardware configuration according to the embodiment of this invention. The operator operates a business computer  20  via the network  3  using an operating terminal  21  and an operating terminal  22 . The business computer  20  records an operating history as an event record, and transmits the event record to an analysis computer  30  over the network  3 . 
         [0041]    The analysis computer  30  generates a time series pattern on the basis of the event log transmitted from the business computer  20  and in accordance with a command transmitted from a manager operating terminal  31  via the network  3 , and transmits the generated time series pattern to the manager operating terminal  31  over the network  3 . The manager operating terminal  31  displays the received time series pattern. 
         [0042]      FIG. 3  is a block diagram of the time series pattern generating system according to the embodiment of this invention. The time series generating system according to an embodiment of this invention comprises an input module  104 , a business process name specification module  105 , an event log generation module  106 , an event processing order information generation module  107 , a time series pattern generation module  108 , and an output module  109 . 
         [0043]    The input module  104  receives input of an event log  101  stored in the storage system  5 . The business process name specification module  105  receives a command  102  including the name of an analysis subject business process input through the input device  7  of the management terminal  4 . 
         [0044]    In accordance with the command  102 , the event log generation module  106  extracts only an event record including identification information relating to a required instance from the input event log  101 . An instance is an actually executed business process, and instance identification information is information identifying each instance when an identical business process is executed. The event processing order information generation module  107  derives an operation processing order of each instance from the extracted event record of the instance, and generates event processing order information. 
         [0045]    The time series pattern generation module  108  generates the time series pattern specified by the command  102  from the event processing order information generated by the event processing order information generation module  107 . The output module  109  outputs the generated time series pattern  103  to the output device  8 . 
         [0046]    The time series pattern generation module  108  is capable of generating the time series pattern  103  in a plurality of types. For example, the generated time series pattern  103  may be generated on the basis of a dependence relationship, i.e. the operation processing order, on the basis of the probability of a specific operation being processed immediately after a certain operation (an operation-to-operation transition probability), and so on. 
         [0047]    Here, an operation A and an operation B always exist in the analysis subject business process, and when the operation A is processed before the operation B in every instance, B is defined as being dependent on A. On the other hand, in an analysis subject business process including the operation A and the operation B, a number obtained by dividing the number of instances in which the operation B is processed immediately after the operation A by the total number of instances is defined as the transition probability from A to B. The time series pattern generation module  108  generates the time pattern series  103  by extracting a dependence relationship or a transition probability with regard to all combinations of operations constituting the specified business process. 
         [0048]      FIG. 4  is a view showing the event log  101  according to the embodiment of this invention. An event record  207  is generated by recording an operation performed by the operator on the an operating terminal  1  and an operating terminal  2 . As described above, the event record  207  is transmitted from the operating terminals  1  and  2  to the management terminal  4 , and stored in the storage system  5  by the input module  104 . The event log  101  is a collection of the event records  207  stored in chronological order. The event record  207  includes a start time  201 , an end time  202 , a business process name  203 , instance identification information  204 , an operation name  205 , and an operator ID  206 . The event record  207  is recognized uniquely by the business process  203 , instance identification information  204 , and operation name  205 . 
         [0049]    The start time  201  is the start time of an operation. The end time  202  is the end time of the operation. The start time  201  and end time  202  are measured in millisecond units. 
         [0050]    The business process name  203  stores a name identifying the business. The instance identification information  204  is an identifier identifying a business that has been executed a plurality of times. The operation name  205  is the name and identifier of an operation included in the business. The operator ID  206  is an identifier identifying the operator who performs the business. 
         [0051]      FIG. 5  is a view showing an example of a command specification screen  300  for transmitting the command  102  to the business process name specification module  105 , according to the embodiment of this invention. A manager inputs required items onto the command specification screen  300  and transmits these items to the business process name specification module  105 . In an embodiment of this invention, a business process  301 , a type  302 , and an operator  306  can be specified. 
         [0052]    In the business process  301 , a business to be subjected to analysis is selected. In  FIG. 5 , “payment slip processing” is selected. In the type  302 , the type of analysis is specified. As shown in  FIG. 5 , a dependence relationship  304  and a transition probability  305  are specified in the analysis type, for example. As described above, the dependence relationship is the operation processing order, and the transition probability is the probability of advancing to another operation following the completion of a specific operation. 
         [0053]    In the operator  306 , the event log is analyzed by specifying an operator for performing the business. When analysis of an entire business process is required, “all operators” is selected, and when analysis is to be performed by specifying an individual operator, an operator ID is specified. 
         [0054]    When an execute button  303  on the command specification screen  300  is operated, the business process name specification module  105  receives the specified information and transmits this information to the event log generation module  106  and time series pattern generation module  108 . 
         [0055]    A procedure for generating the time series pattern  103  will now be described. In the command  102  received by the business process name specification module  105 , “payment slip processing” is specified as the business process  301 , and “all operators” is specified as the operator  306 . An example in which “dependence relationship” is specified as the type and an example in which “transition probability” is specified as the type will both be described. 
         [0056]      FIG. 6A , to  FIG. 7D  are views showing event logs and intermediate data for each instance, which are generated by the event log generation module  106  according to the embodiment of this invention. 
         [0057]      FIG. 6A  and  FIG. 6B  are views showing the intermediate data of event records extracted from an event log and including the specified business process, according to the embodiment of this invention. 
         [0058]    The event log generation module  106  extracts the event records  207  including the business process  203  that matches the specified business process. Intermediate data  402  are data in the extracted event records  207  matching the business process “payment slip processing” specified by the business process name specification module  105 . 
         [0059]    It should be noted that when an operator is specified, the event records  207  including the operator ID  206  of the specified operator are extracted. 
         [0060]      FIG. 7A  to  FIG. 7D  are views showing an event log for each instance according to an embodiment of this invention. 
         [0061]    The event log generation module  106  divides the event records  207  having the intermediate data  402  including the specified business process into groups corresponding to each set of instance identification information  204 . In  FIG. 7A  to  FIG. 7D , the intermediate data  402  are divided and grouped in an event log  403  of an instance  1 , an event log  404  of an instance  3 , and an event log  405  of an instance  4 . 
         [0062]    When an event log is generated for each instance by the event log generation module  106 , the event processing order information generation module  107  generates event processing order information for each instance from the event log for each instance. The event processing order information for each instance is information indicating the operation processing order in each instance. 
         [0063]    When the end time of the operation A is earlier than the end time of the operation B, A→B is expressed as the event processing order information, indicating that the operation A is performed before the operation B. Accordingly, “A→B→C→D→E→F” is generated from the event log  403  as the event processing order information of the instance  1 . Similarly, the event processing order information of the instance  3  becomes “A→C→B→D→F→E”, and the event processing order information of the instance  4  becomes “C→A→B→D→E→F”. 
         [0064]      FIG. 8  is a flowchart illustrating a processing order of the time series pattern generation module  108  when “dependence relationship” is specified as the type of time series pattern, according to the embodiment of this invention. 
         [0065]    Upon reception of the event processing order information, the time series pattern generation module  108  generates an operation dependence relationship matrix for each instance (S 501 ). Referring to  FIG. 9 , processing (S 501 ) performed by the time series pattern generation module  108  to generate an operation dependence relationship matrix for each instance will now be described. 
         [0066]      FIG. 9  is a view showing an operation dependence relationship matrix of an instance, according to the embodiment of this invention. A matrix X 1  ( 601 ), a matrix X 2  ( 602 ), and a matrix X 3  ( 603 ) are operation dependence relationship matrices for the instance  1 , the instance  3 , and the instance  4 , respectively. 
         [0067]    First, the time series pattern generation module  108  determines the subject operations to be included in the operation dependence relationship matrix. Only operations included in all instances become subject elements of the operation dependence relationship matrix. In an embodiment of this invention, all of the operations (A, B, C, D, E, and F) become subjects. 
         [0068]    In the operation dependence relationship matrix, each row and each column corresponds respectively to an operation. The dependence relationship between operations is expressed as 1 when a row operation is performed before a column operation, and 0 in all other cases. 
         [0069]    In an embodiment of this invention, the payment slip processing serving as the analysis subject is constituted by six operations, and therefore the operation dependence relationship matrix has six rows and six columns. Hence, both the first row and the first column of the operation dependence relationship matrix denote the operation A, the second row and second column denote the operation B, . . . , and the sixth row and sixth column denote an operation F. 
         [0070]    As described above, the event processing order information of the instance  1  is A→B→C→D→E→F. The operation A is performed before all of the operations except for A itself, and therefore, of the elements on the first row indicating A, 0 is inserted in the first column expressing A alone, and 1 is inserted into all of the other columns. The operation B is performed before four operations, i.e. all operations other than A and B, and therefore, of the elements on the second row indicating the operation B,  0  is inserted into the first and second columns, and 1 is inserted into the third through sixth columns. This processing is executed in relation to all of the operations, and thus the operation dependence relationship matrix X 1  ( 601 ) of the instance  1  is generated. The time series pattern generation module  108  generates the operation dependence relationship matrix X 2  ( 602 ) of the instance  3  and the operation dependence relationship matrix X 3  ( 603 ) of the instance  4  similarly. 
         [0071]    Next, the time series pattern generation module  108  extracts a common processing order of each operation from the generated operation dependence relationship matrices  601 ,  602  and  603  (S 502 ). 
         [0072]    Here, even when a relationship of A→B is established in a certain instance, a dependence relationship of A→B is not established unless A→B is established in another instance. Further, in the operation dependence relationship matrix, 1 is inserted when a dependence relationship is established, and 0 is inserted in all other cases, and therefore, when the products of the elements corresponding to all of the operation dependence relationship matrices are calculated, the value of an element becomes 1 only when a dependence relationship is established in each matrix. 
         [0073]      FIG. 10  is a view showing a procedure for extracting dependence relationships between operations constituting a specified business, according to the embodiment of this invention. 
         [0074]    The time series pattern generation module  108  calculates the product of each element in the operation dependence relationship matrix X 1  ( 601 ) and the operation dependence relationship matrix X 2  ( 602 ) to obtain a matrix X 4  ( 702 ). In the matrix X 4  ( 702 ), only the elements for which a dependence relationship is established in both the instance  1  and the instance  3  take a value of 1. More specifically, both the instance  1  and the instance  3  begin from the operation A, and therefore the first row of the matrix X 4  ( 702 ) is identical to the first row of X 1  ( 602 ) and X 2  ( 602 ). On the other hand, in the instance  1  the operation B follows the operation A, whereas in the instance  2 , the operation C follows the operation A. In other words, the processing order is B→C in the instance  1  and C→B in the instance  3 , and therefore a dependence relationship is not established between the operation B and the operation C. Hence, with respect to the matrix X 4 , a preceding relationship cannot be specified for an element ( 2 ,  3 ) indicating B→C and an element ( 3 ,  2 ) indicating C→B, and therefore both of these elements are set at 0. 
         [0075]    Further, the time series pattern generation module  108  calculates the product of each element in the matrix X 4  ( 702 ) and the operation dependence relationship matrix X 3  ( 603 ) to obtain a matrix X 5  ( 703 ). The obtained matrix X 5  ( 703 ) illustrates dependence relationships established between the instance  1 , the instance  3 , and the instance  4 . 
         [0076]    Next, the time series pattern generation module  108  orders the extracted dependence relationships (S 503  in  FIG. 8 ). A specific procedure of this operation will be described below with reference to  FIG. 11 . 
         [0077]      FIG. 11  is a view showing a procedure for ordering extracted dependence relationships, according to the embodiment of this invention. 
         [0078]    Referring to the matrix X 5  ( 703 ), the value of an element ( 1 ,  4 ) is 1, and therefore A→D is established as a dependence relationship between the operations A and D. Similarly, the value of an element ( 1 ,  2 ) is 1, and therefore A→B is established as a dependence relationship between the operations A and B, while the value of an element ( 2 ,  4 ) is 1, and therefore B→D is established as a dependence relationship between the operations B and D. Here, it is self-evident that when a dependence relationship of A→B→D is established, a dependence relationship of A→D is also established, and therefore, even when the value of the element ( 1 ,  4 ) in the matrix X 5  is 0, the dependence relationship of A→B→D is maintained. 
         [0079]    In the processing of S 503  in  FIG. 8 , as described above, the matrix X 5  is ordered such that only the minimum number of dependence relationships at which the dependence relationships between the various operations can be maintained is left. A procedure for deriving a matrix X 6  ( 902 ) showing the minimum number of dependence relationships from the matrix X 5  ( 703 ) will now be described in accordance with an algorithm shown in S 503  of  FIG. 8 . 
         [0080]    In the algorithm of S 503 , first, elements from a column  1  to a column N on a row i are checked in sequence, and when the value of an element in a column j is 1, the elements on a row j are checked. At this time, the column  1  to the column N on the row j are checked in sequence, and when the value of an element in the same column is 1 on both the row i and the row j, the value of the element on the ith row is altered from 1 to 0. The processing described above is identical to subtracting the value of each column on the j row from the value of each column on the i row. 
         [0081]    Here, when the algorithm of S 503  is applied to the matrix X 5  in  FIG. 11 , the value of the element in column  2  of row  1  is 1. When the value of row  2  is checked in order from column  1  to column  6 , the value in the columns  4  to  6  is 1 on both row  1  and row  2 . Hence, it is learned that the operation A and the operation B are both processed before the operations D, E and F. Accordingly, even when the dependence relationships A→D, A→E, and A→F are deleted, the dependence relationships B→D, B→E, and B→F are maintained from the dependence relationship A→B, and therefore all of the dependence relationships are maintained. By ordering each row of the matrix X 5  in a similar manner from row  2  onward using the procedure described above, an operation dependence relationship matrix X 6  ( 902 ) can be generated. 
         [0082]    Finally, the operation dependence relationship matrix X 6  ( 902 ) is displayed in a time series pattern (S 504  in  FIG. 8 ). In an embodiment of this invention, the time series pattern is expressed by a directed graph having the operations as vertices and the dependence relationships as directed edges. More specifically, each operation is disposed as a vertex of a regular N polygon, and with respect to elements of the matrix X 6  ( 902 ) having a value of 1, an arrow is drawn from the operation indicating the row of the element to the operation indicating the column of the element. 
         [0083]      FIG. 12  is a view expressing a time series pattern according to an embodiment of this invention in the form of a directed graph.  FIG. 12  is a directed graph expressing the time series pattern  103  obtained by specifying “payment slip processing” as the business process name, “dependence relationship” as the type, and “all” as the operator, and analyzing the event log  101  shown in  FIG. 4 . The solid line arrows denote dependence relationships, and the broken line arrows denote dependence relationships deleted in the processing of S 503  in  FIG. 8 . 
         [0084]    Referring to the matrix X 6  ( 902 ), on the first row indicating the operation A, only the second column indicating the operation B is 1, and therefore an arrow  1003  is drawn from a vertex  1001  corresponding to the operation A to a vertex  1002  corresponding to the operation B. Dependence relationships are expressed similarly from the operation B to the operation F. More specifically, the fourth column on the second row is 1, and therefore an arrow is drawn from B to D, while the fourth column on the third row is also 1, and therefore an arrow is drawn from C to D. As regards the fourth row, the fifth and sixth columns have a value of 1, and therefore arrows are drawn from D to E and F. Thus, the directed graph shown in  FIG. 12  is obtained. 
         [0085]    Next, a processing procedure performed by the time series pattern generation module  108  when the transition probability  305  is specified as the type  302  of the time series pattern on the command specification screen  300  in  FIG. 5  will be described. 
         [0086]      FIG. 13  is a flowchart illustrating a processing procedure of the time series pattern generation module  108  when “transition probability” is specified as the time series pattern analysis type, according to the embodiment of this invention. 
         [0087]    Upon reception of the event processing order information of an instance, the time series pattern generation module  108  calculates an operation-to-operation transition probability matrix for each instance (S 1101 ). Here, referring to  FIG. 14 , a procedure performed by the time series pattern generation module  108  to generate an operation-to-operation transition probability matrix for each instance will be described. 
         [0088]      FIG. 14  is a view showing an operation-to-operation transition probability matrix for each instance, according to the embodiment of this invention. A matrix Y 1  ( 1201 ), a matrix Y 2  ( 1202 ), and a matrix Y 3  ( 1203 ) are the operation-to-operation transition probability matrices of the instance  1 , the instance  3 , and the instance  4 , respectively. 
         [0089]    In contrast to the operation dependence relationship matrix, the elements constituting the operation-to-operation transition probability matrix are all of the operations included in any one or more of the processing subject instances. In an embodiment of this invention, the operations constituting the analysis subject instances are the same, and therefore all of the operations (A, B, C, D, E and F) become subjects. 
         [0090]    In the operation-to-operation transition probability matrix, each row and each column corresponds to the respective operations, and moreover, a row corresponding to a dummy start operation (Start) and a column corresponding to a dummy end operation (End) are added. By adding the dummy start operation and end operation in this manner, the start operation and end operation can be clarified. 
         [0091]    The value of each element in the operation-to-operation transition probability matrix is set such that in a row indicating a certain operation, only the column indicating the operation that is processed after the certain operation has a value of 1, and all other columns have a value of 0. For example, the event processing order information of the instance  1  is A→B→C→D→E→F. Hence, on the first row indicating the operation A, only an element ( 1 ,  2 ) in the second column indicating the operation B is set at 1, and the other elements are set at 0. Similarly, on the second row indicating the operation B, only an element ( 1 ,  3 ) in the third column indicating the operation C is set at 1, and the other elements are set at 0. Values are set similarly up to the sixth row indicating the operation F. 
         [0092]    Further, on the row (Start) indicating the start, the element in the first column indicating the operation A of the start operation is set at 1, and the elements in the other columns are set at 0. In the column (End) indicating the end, the element on the sixth row indicating the operation F is set at 1, and the elements on the other rows are set at 0. 
         [0093]    The time series pattern generation module  108  generates the operation-to-operation transition probability matrix Y 1  ( 1201 ) in this manner. Further, the time series pattern generation module  108  generates an operation-to-operation transition probability matrix Y 2  ( 1202 ) from the event processing order information of the instance  3 , and an operation-to-operation transition probability matrix Y 3  ( 1203 ) from the event processing order information of the instance  4 . 
         [0094]    Next, the time series pattern generation module  108  combines the generated operation-to-operation transition probability matrices ( 1201  to  1203 ) (S 1102 ). 
         [0095]      FIG. 15A  is a view showing a procedure for combining generated operation-to-operation transition probability matrices, according to the embodiment of this invention. 
         [0096]    In the procedure for combining the operation-to-operation transition probability matrices, the elements of the corresponding matrices are added together respectively ( 1301 ). This applies likewise to the row (Start) indicating the start operation and the column (End) indicating the end operation. Referring to  FIG. 15A , by adding together the matrix Y 1  ( 1201 ) and the matrix Y 2  ( 1202 ), a matrix Y 4  ( 1302 ) can be generated. Further, by adding together the matrix Y 4  ( 1302 ) and the matrix Y 3  ( 1203 ), a matrix Y 5  ( 1303 ) can be generated. 
         [0097]    Further, the time series pattern generation module  108  divides each element of the matrix Y 5  by the number of instances M serving as processing subjects to calculate an operation-to-operation transition probability matrix (S 1103  in  FIG. 13 ). 
         [0098]      FIG. 15B  is a view showing an operation-to-operation transition probability matrix Y 6  generated according to the embodiment of this invention. The operation-to-operation transition probability matrix Y 6  is obtained by dividing the matrix Y 5  in  FIG. 15A  by the number of instances M (=3). Referring to row  1  corresponding to the operation A in the operation-to-operation transition probability matrix Y 6 , it is learned that when the operation A is complete, there is a ⅔ probability of a transition to the operation B, and a ⅓ probability of a transition to the operation C. Further, referring to row  7  indicating the start operation (Start), there is a ⅔ probability that the analysis subject “payment slip processing” will start from the operation A, and a ⅓ probability that that the “payment slip processing” will start from the operation C. 
         [0099]    Finally, a time series pattern based on the operation-to-operation transition probability matrix Y 6  is displayed (S 1104  in  FIG. 13 ). The time series pattern is expressed by a directed graph in which the operations are set as vertices and operations having a transition probability greater than 0 are connected. In the time series pattern, each operation is disposed as a vertex of a regular N polygon, and Start and End are disposed in arbitrary positions. When an element of the operation-to-operation transition probability matrix Y 6  is greater than 0, an arrow indicating the value (transition probability) of the element is drawn. 
         [0100]      FIG. 16  is a view showing a time series pattern corresponding to the operation-to-operation transition probability matrix Y 6 , according to the embodiment of this invention. 
         [0101]    The value of an element ( 1 ,  2 ) in the operation-to-operation transition probability matrix Y 6  is greater than 0, and therefore an arrow  1403  is drawn from a vertex  1401  indicating the operation A to a vertex  1402  indicating the operation B. Further, a transition probability of “⅔” is appended to the arrow  1403 . By drawing arrows similarly with respect to other elements having a value greater than 0 and appending the transition probability thereto, the time series pattern shown in  FIG. 16  can be obtained. 
         [0102]    According to an embodiment of this invention, dependence relationships between operations constituting a business can be extracted. Furthermore, these dependence relationships can be visualized as a time series pattern, and therefore the dependence relationships between the operations can be understood easily. For example, using the obtained time series pattern, an operation causing a bottleneck in the analysis subject business can be extracted. Then, by improving the operation causing the bottleneck, an overall improvement in the business can be achieved. 
         [0103]    Further, according to an embodiment of this invention, the transition probability of a specific operation being processed immediately after a certain operation can be obtained for each operation constituting the business. Moreover, the operation-to-operation transition probabilities can be visualized as a time series pattern, which is valuable for analyzing and improving the operation order of a business. 
         [0104]    Further, according to an embodiment of this invention, a time series pattern can be extracted for each operator, and therefore irregularities in the operation order according to the operator can be prevented, enabling standardization of the business process and an improvement in the quality of the business. 
         [0105]    This invention may be applied to a system for analyzing a business on the basis of operation history information. Since history information can be extracted for each instance, this invention is particularly suitable for application to a system in which history information for a plurality of businesses is mixed together. 
         [0106]    While the present invention has been described in detail and pictorially in the accompanying drawings, the present invention is not limited to such detail but covers various obvious modifications and equivalent arrangements, which fall within the purview of the appended claims.