New results on deriving protocol specifications from service specifications
- 1 August 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 19 (4) , 136-145
- https://doi.org/10.1145/75246.75261
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.Keywords
This publication has 9 references indexed in Scilit:
- Introduction to the ISO specification language LOTOSPublished by Elsevier ,2003
- Synthesizing protocol specifications from service specifications in FSM modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Deriving protocol specifications from service specificationsPublished by Association for Computing Machinery (ACM) ,1986
- Synthesis of two-party error-recoverable protocolsPublished by Association for Computing Machinery (ACM) ,1986
- An Implementation of an Automated Protocol Synthesizer (APS) and Its Application to the X.21 ProtocolIEEE Transactions on Software Engineering, 1985
- Synthesis of Communicating Finite-State Machines with Guaranteed ProgressIEEE Transactions on Communications, 1984
- A distributed solution of the distributed termination problemInformation Processing Letters, 1983
- On the Construction of Submodule Specifications and Communication ProtocolsACM Transactions on Programming Languages and Systems, 1983
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980