Transformation of Lotos specifications to Estelle specifications

A technique for the automated transformation of a Lotos specification to an Estelle specification is presented. First, a restricted behaviour tree is constructed from the Lotos specification in a somewhat similar way to generating a reachability tree for a finite-state machine. The restricted behaviour tree has a finite size even when the communications protocol specified represents infinite behaviour. We develop an algorithm for constructing the Estelle specifications from the restricted behaviour tree. A minimization rule is also developed to optimize the size of the Estelle specification by reducing both the number of states and the number of transitions. We conclude by pointing out areas for further research.