INTERACTIVE PROTOCOL SYNTHESIS ALGORITHM USING A GLOBAL STATE TRANSITION GRAPH.

Yao Xue Zhang, Kaoru Takahashi, Norio Shiratori, Shoichi Noguchi

    Research output: Contribution to journalArticle

    20 Citations (Scopus)

    Abstract

    An interactive synthesis algorithm, to construct two communicating finite-state machines (protocols), is presented. The machines exchange messages over two unidirectional FIFI (first-in first-out) channels when the function of the protocol has been given. The synthesis algorithm first constructs the global state transition graph (GSTG) of a protocol to be synthesized and then produces the protocol. It is based on a set of production rules and a set of deadlock avoidance rules, which guarantee that complete reception and deadlock freeness capabilities are provided in the interacting processes. This synthesis algorithm prevents a designer from creating unspecified reception and nonexecutable transition, avoids the occurrence of deadlocks, and monitors for the presence of buffer overflow.

    Original languageEnglish
    Pages (from-to)394-404
    Number of pages11
    JournalIEEE Transactions on Software Engineering
    Volume14
    Issue number3
    DOIs
    Publication statusPublished - 1988 Mar

    Fingerprint

    Network protocols
    Finite automata

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Software
    • Electrical and Electronic Engineering

    Cite this

    INTERACTIVE PROTOCOL SYNTHESIS ALGORITHM USING A GLOBAL STATE TRANSITION GRAPH. / Zhang, Yao Xue; Takahashi, Kaoru; Shiratori, Norio; Noguchi, Shoichi.

    In: IEEE Transactions on Software Engineering, Vol. 14, No. 3, 03.1988, p. 394-404.

    Research output: Contribution to journalArticle

    Zhang, Yao Xue ; Takahashi, Kaoru ; Shiratori, Norio ; Noguchi, Shoichi. / INTERACTIVE PROTOCOL SYNTHESIS ALGORITHM USING A GLOBAL STATE TRANSITION GRAPH. In: IEEE Transactions on Software Engineering. 1988 ; Vol. 14, No. 3. pp. 394-404.
    @article{3fa0f486cfa04061ac3a96d1d7a700ef,
    title = "INTERACTIVE PROTOCOL SYNTHESIS ALGORITHM USING A GLOBAL STATE TRANSITION GRAPH.",
    abstract = "An interactive synthesis algorithm, to construct two communicating finite-state machines (protocols), is presented. The machines exchange messages over two unidirectional FIFI (first-in first-out) channels when the function of the protocol has been given. The synthesis algorithm first constructs the global state transition graph (GSTG) of a protocol to be synthesized and then produces the protocol. It is based on a set of production rules and a set of deadlock avoidance rules, which guarantee that complete reception and deadlock freeness capabilities are provided in the interacting processes. This synthesis algorithm prevents a designer from creating unspecified reception and nonexecutable transition, avoids the occurrence of deadlocks, and monitors for the presence of buffer overflow.",
    author = "Zhang, {Yao Xue} and Kaoru Takahashi and Norio Shiratori and Shoichi Noguchi",
    year = "1988",
    month = "3",
    doi = "10.1109/32.4659",
    language = "English",
    volume = "14",
    pages = "394--404",
    journal = "IEEE Transactions on Software Engineering",
    issn = "0098-5589",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "3",

    }

    TY - JOUR

    T1 - INTERACTIVE PROTOCOL SYNTHESIS ALGORITHM USING A GLOBAL STATE TRANSITION GRAPH.

    AU - Zhang, Yao Xue

    AU - Takahashi, Kaoru

    AU - Shiratori, Norio

    AU - Noguchi, Shoichi

    PY - 1988/3

    Y1 - 1988/3

    N2 - An interactive synthesis algorithm, to construct two communicating finite-state machines (protocols), is presented. The machines exchange messages over two unidirectional FIFI (first-in first-out) channels when the function of the protocol has been given. The synthesis algorithm first constructs the global state transition graph (GSTG) of a protocol to be synthesized and then produces the protocol. It is based on a set of production rules and a set of deadlock avoidance rules, which guarantee that complete reception and deadlock freeness capabilities are provided in the interacting processes. This synthesis algorithm prevents a designer from creating unspecified reception and nonexecutable transition, avoids the occurrence of deadlocks, and monitors for the presence of buffer overflow.

    AB - An interactive synthesis algorithm, to construct two communicating finite-state machines (protocols), is presented. The machines exchange messages over two unidirectional FIFI (first-in first-out) channels when the function of the protocol has been given. The synthesis algorithm first constructs the global state transition graph (GSTG) of a protocol to be synthesized and then produces the protocol. It is based on a set of production rules and a set of deadlock avoidance rules, which guarantee that complete reception and deadlock freeness capabilities are provided in the interacting processes. This synthesis algorithm prevents a designer from creating unspecified reception and nonexecutable transition, avoids the occurrence of deadlocks, and monitors for the presence of buffer overflow.

    UR - http://www.scopus.com/inward/record.url?scp=0023978660&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0023978660&partnerID=8YFLogxK

    U2 - 10.1109/32.4659

    DO - 10.1109/32.4659

    M3 - Article

    VL - 14

    SP - 394

    EP - 404

    JO - IEEE Transactions on Software Engineering

    JF - IEEE Transactions on Software Engineering

    SN - 0098-5589

    IS - 3

    ER -