Measuring time cost of rules for program analysis

In lots of rule-based computation models, such as ELAN, Prolog, OBJ, etc., a program is composed of a set of rules. The target of computer programs analysis, is to make them parallel. Therefore, rule-based programs which consist of components one by one are quite important for that target. Rule-based program is a chain of state transitions, and actually, it is a chain of rule applications. Thus, it is necessary to measure execution time cost of each rule, so that we can reduce it to make a rule-based program more efficient through making it parallel. That is to say, time cost measuring of each part of rule-based programs is one of the foundations of the process which can make rule-based programs parallel. As Equivalence Transformation (ET) is one of the rule-based languages, on the base of ET the ideas above can be realized. In this paper, a method will be introduced to measure execution time of rules in ET rule-based program.