skip to main content
article
Free Access

Tier automation representation of communication protocols

Authors Info & Claims
Published:01 August 1986Publication History
Skip Abstract Section

Abstract

The tier automation is presented as a model for communication protocols. Several advantages of the model are cited, among which are universality of representation and manipulability. A scheme for using the tier automation to model specific distributed architectures and their protocols is described. The scheme is then used on a sample protocol and a transmission session with the sample protocol as exhibited.

References

  1. 1 Bartlett, K.A., R.A. Scantlebury, and P.T. Wilkinson, "A Note on Reliable Full-Duplex Transmission over Half-Duplex Lines." Comm. ACM 12,5 (May 1969), 260-261. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Bare{, Z., Introduction to the Theory of Automata, Reston Publishing Company, Inc., Reston, Virginia, 1983.Google ScholarGoogle Scholar
  3. 3 Bavel, Z., "Manipulable Computer Architecture; First Annual Report to the System Development Foundation" (May 1985).Google ScholarGoogle Scholar
  4. 4 Bochmann, G.V., "Finite State Description of Communication Protocols." Computer Networks 2, 4/5 (Oct. 1978), 361-372.Google ScholarGoogle Scholar
  5. 5 Brand, D., and Zafiropulo, P., "On Communicating Finite-State Machines." dr. ACM 30,2 (Apr. 1983), 323-342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Chang, C.K., Gouda, M.G., and Rosier, L.E., "Deciding Liveness for Special Classes of Communicating Finite State Machines." In Proceedings 22nd Annual Allerton Conference on Communication, Control, and Computing (Oct. 1984), 931-939.Google ScholarGoogle Scholar
  7. 7 Gouda, M.G., Manning, E.G., and Yu, Y.T., "On the Progress of Communication between Two Finite State Machines." Inf. Control 63,3 (Dec. 1984). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Lynch, W.C., "Reliable Full-Duplex Transmission over Half-Duplex Telephone Lines." Comm. ACM tl,6 (June 1968), 361-371. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Simpson, William F. and Bavel, Z., "Tag-Automaton Derived Measures of Polysemy on Roger's International Thesaurus." In preparation.Google ScholarGoogle Scholar

Index Terms

  1. Tier automation representation of communication protocols

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGCOMM Computer Communication Review
          ACM SIGCOMM Computer Communication Review  Volume 16, Issue 3
          Aug. 5, 1986
          392 pages
          ISSN:0146-4833
          DOI:10.1145/1013812
          Issue’s Table of Contents

          Copyright © 1986 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 August 1986

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader