A Synthesis Algorithm of a Protocol Model from a Single Entity

Abstract

Protocol entities, in communication protocols, behave under sets of communication rules (protocols). Thus, it is desirable to concentrate on the design of one protocol entity and generate the corresponding protocol entity automatically by exploiting the communication rules. A protocol is desired to be formal, precise and unambiguous, in other words, it is described using FDTs (Formal Description Techniques). In this paper, we propose a protocol synthesis algorithm in which a peer protocol entity is generated from a single given entity. Unlike previous works, where FSMs (Finite State Machines) were used to synthesize partial protocols, we use LOTOS, which is one of FDTs developed by ISO, in our proposed synthesis algorithm. We prove that the resultant protocol consisting of the given entity and the generated peer entity is logical errors free, collectively represented as deadlock free, if the given entity is in certain forms which are natural in the context of communication protocols. We also present that the protocol is bisimulated by both the given entity and the peer entity to show that the protocol maintains the behaviours of the entities.key wordsI. General Keywords: 4. FDT-based software engineeringII. Language: 2. LotosIII.Semantic models: 3. Process AlgebraIV. Miscellaneous: 2. Protocol Synthesis