Extension of protocol synthesis to structured entities

Bhed Bahadur Bista*, Atsushi Togashi, Norio Shiratori

*この研究の対応する著者

    研究成果

    1 被引用数 (Scopus)

    抄録

    Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe, i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model, we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO.

    本文言語English
    ホスト出版物のタイトルInternational Conference on Network Protocols
    Place of PublicationLos Alamitos, CA, United States
    出版社IEEE
    ページ66-73
    ページ数8
    出版ステータスPublished - 1995
    イベントProceedings of the 1995 International Conference on Network Protocols - Tokyo, Jpn
    継続期間: 1995 11 71995 11 10

    Other

    OtherProceedings of the 1995 International Conference on Network Protocols
    CityTokyo, Jpn
    Period95/11/795/11/10

    ASJC Scopus subject areas

    • ソフトウェア

    フィンガープリント

    「Extension of protocol synthesis to structured entities」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル