New results on deriving protocol specifications from service specifications

  • Authors:
  • F. Khendek;G. von Bochmann;C. Kant

  • Affiliations:
  • Département d'IR0, Université de Montréal, C.P. 6128, Succursale A, Montréal, Québec, H3C 357, Canada;Département d'IR0, Université de Montréal, C.P. 6128, Succursale A, Montréal, Québec, H3C 357, Canada;Département d'IR0, Université de Montréal, C.P. 6128, Succursale A, Montréal, Québec, H3C 357, Canada

  • Venue:
  • SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

Previous papers describe an algorithm for deriving a specification of protocol entities from a given service specification. A service specification defines a particular ordering for the execution of service primitives at the different service access points using operators for sequential, parallel and alternative executions. The derived protocol entities ensure the correct ordering by exchanging appropriate synchronization messages, between one another through the underlying communication medium.This paper presents several new results which represent important improvements to the above protocol derivation approach. First the language restriction to finite behaviors is removed by allowing for the definition of procedures which can be called recursively. Secondly, a new derivation algorithm has been developed which is much simpler than the previous one. Third, the resulting protocol specifications are much more optimized than those obtained previously.