New results on deriving protocol specifications from service specifications

Two algorithms for deriving a protocol specification from a service specification have been developed by G.V. Bochmann et al. (1986). The algorithms accept an arbitrary number of protocol entities communicating over reliable FIFO channels. The legal sequences of service interactions are specified in a dialect of basic LOTOS. A similar algorithm with a more efficient synchronization method is proposed