SYSTEM AND METHOD FOR DERIVING STOCHASTIC PERFORMANCE EVALUATION MODEL FROM ANNOTATED UML DESIGN MODEL

Abstract

The computer program enables a computer to function as: means for transforming a static call graph into a syntax tree having a binary tree structure; means for transforming a protocol state diagram into a stochastic process algebraic form; means for transforming an activity diagram into a stochastic process algebraic form; means for obtaining a stochastic process algebraic form of each of classes by merging the stochastic process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; and means for obtaining a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and the advantage thereof, reference is now made to the following description taken in conjunction with the accompanying drawings.

FIG. 1 shows an outline of a hardware configuration 100 whereby a system, which derives a stochastic performance evaluation model from a UML design model, operates.

FIG. 2 shows functions and data of the system which derives a stochastic performance evaluation model from a UML design model.

FIG. 3 illustrates a processing flow 300 in which a stochastic performance evaluation model is derived from a UML design model.

FIG. 4 illustrates a system 400 for which a process algebraic form is derived.

FIG. 5 is an example of UML models of the system 400.

FIG. 6 shows a protocol state diagram for each of components.

FIG. 7 shows an activity diagram defining each of methods.

FIG. 8 shows an example of a process of transforming a static call graph into a process algebraic form.

FIG. 9 shows an example of a process of transforming a static call graph into a process algebraic form.

FIG. 10 shows, with respect to the system 400, an example of a process of transforming a static call graph into a process algebraic form.

FIG. 11 shows example of a protocol state diagram.

FIG. 12 shows an example of transformation of the protocol state diagram.

FIG. 13 shows an example of a processing flow in which the protocol state diagram is transformed into a process algebraic form.

FIG. 14 shows a state diagram obtained by replacing a protocol diagram of a buffer component.

FIG. 15 shows an example of transformation into a process algebraic form from a tree expression of an activity diagram.

Claims

1. A computer program, encoded on a computer-readable recording medium, which causes a computer to transform a UML design model including protocol state diagrams and activity diagrams of classes into a stochastic performance evaluation model, the computer program causing the computer to function as: means for transforming a static call graph into a syntax tree having a binary tree structure;means for transforming each of the protocol state diagrams into a stochastic process algebraic form;means for transforming each of the activity diagrams into a stochastic process algebraic form;means for obtaining a stochastic process algebraic form of each of the classes by merging the process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; andmeans for obtaining a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.

2. The computer program according to claim 1, wherein the static call graph is a graph obtained, based on calls among the classes, from the activity diagrams.

3. The computer program according to claim 2, wherein means for producing the static call graph distinguishes calls to a single method by a difference in arguments for calling the method.

4. The computer program according to claim 2, wherein means for producing the static call graph distinguishes calls to a single method by a difference in call paths for calling the method.

5. The computer program according to claim 1, wherein the means for transforming the protocol state diagrams initially transforms a state of each of transition destinations by assuming that states of transition destinations are S1, S2, . . . , Sk, and additionally assuming that labels for transitions are n1, n2, . . . , nk, the labels being method call numbers.

6. The computer program according to claim 1, wherein the means for transforming the activity diagrams starts a search from an initialNode, and assigns a unique identifier to a node having been visited by the means.

7. The computer program according to claim 1, wherein the means for obtaining the stochastic process algebraic form of each of the classes associates the stochastic process algebraic form of the protocol state diagram with the stochastic process algebraic forms of the activity diagrams by use of method call numbers.

8. (canceled)

9. A method of transforming a UML design model including protocol state diagrams and activity diagrams of classes into a stochastic performance evaluation model, the method comprising the steps of: transforming a static call graph into a syntax tree having a binary tree structure;transforming each of the protocol state diagrams into a stochastic process algebraic form;transforming each of the activity diagrams into a stochastic process algebraic form;obtaining a stochastic process algebraic form of each of the classes by merging the process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; andobtaining a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.

10. The method according to claim 9, wherein the static call graph is a graph obtained, based on calls among the classes, from the activity diagrams.

11. The method according to claim 10, wherein, in a step of producing the static call graph, calls to a single method are distinguished from each other by a difference in arguments for calling the method.

12. The method according to claim 10, wherein, in a step of producing the static call graph, calls to a single method are distinguished from each other by a difference in call paths for calling the method.

13. The method according to claim 9, wherein, in the step of transforming the protocol state diagrams, a state of each of transition destinations is initially transformed by assuming that states of transition destinations are S1, S2, . . . , Sk, and additionally assuming that labels for transitions are n1, n2, . . . , nk, the labels being method call numbers.

14. The method according to claim 9, wherein, in the step of transforming the activity diagrams, a search is started from an initialNode, and a unique identifier is assigned to a node having been visited in the step.

15. The method according to claim 9, wherein, in the step of obtaining the stochastic process algebraic form of each of the classes, the stochastic process algebraic form of the protocol state diagram is associated with the stochastic process algebraic forms of the activity diagrams by use of method call numbers.

16. A data processing system comprising: a bus system;a memory connected to the bus system, wherein the memory includes a set of instructions; anda processing unit connected to the bus system, wherein the processing unit executes the set of instructions to transform a static call graph into a syntax tree having a binary tree structure; transform each of the protocol state diagrams into a stochastic process algebraic form; transform each of the activity diagrams into a stochastic process algebraic form; obtain a stochastic process algebraic form of each of the classes by merging the process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; and obtain a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.