1999 Volume 5 Issue 1 Pages 87-98
LOTOS, one of the formal description techniques, can strictly and unambiguously describe the requirement specifications of distributed systems such as protocols and communication systems. But it is difficult for beginners to learn and understand LOTOS. Thus, for LOTOS instruction support, we have already proposed an algorithm which can detect learner’s errors contained in the learner’s answer for some problems described in LOTOS. This algorithm is applied to non-recursive LOTOS processes. However, non-recursive processes cannot represent processes that execute events infinitely. In this paper, we propose a new algorithm which can support equivalence decision and error detection in recursive processes. We also present a software support system which aids this new algorithm.
