Protocol Synthesis for Real-Time Applications

This paper deals with deriving protocol specifications which provide a given service satisfying timing requirements. In previous work, we have developed an extension of a method proposed by Saleh and Probert, by considering timing requirements in a more general case than in other existing studies. In the present paper, we improve our method by several modifications and additions. First, the number of messages exchanged between the protocol entities is minimized. Second, a less restrictive strategy for choosing between several service primitives is proposed. Third, we consider applications where the choice between several primitives of a single site can be made by the user, and not only by the system. Fourth, conditions of existence of solutions are weaker. Fifth, the timing constraints of the synthesized protocols are weaker. Finally, two simple examples of applications are described.