Recursive processes equivalence algorithms to detect process errors for LOTOS instruction

LOTOS which is one of the FDTs has many strong points such as formal description of the service definitions, either distributed systems like telephone switching networks and the protocol specifications. However, it is not used widely, since it is difficult for beginners to learn its mathematical basis. We have already proposed an algorithm which verifies strong equivalence and detects errors between finite processes for LOTOS instruction. In practice, general processes can perform infinite sequences of events or actions. To support such processes in the instruction, this paper expands the algorithm for recursive processes, which are in subset of LOTOS and can express every process that is strong equivalence to each process in LOTOS.