article

Free access

Tier automation representation of communication protocols

Authors:

Z Bavel,

J Grzymala-Busse,

Y Hsia,

R Mancisidor-LandaAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 16, Issue 3

Pages 138 - 147

https://doi.org/10.1145/1013812.18189

Published: 01 August 1986 Publication History

PDF eReader

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]

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.

Digital Library

Google Scholar

[2]

Bare{, Z., Introduction to the Theory of Automata, Reston Publishing Company, Inc., Reston, Virginia, 1983.

Google Scholar

[3]

Bavel, Z., "Manipulable Computer Architecture; First Annual Report to the System Development Foundation" (May 1985).

Google Scholar

[4]

Bochmann, G.V., "Finite State Description of Communication Protocols." Computer Networks 2, 4/5 (Oct. 1978), 361-372.

Google Scholar

[5]

Brand, D., and Zafiropulo, P., "On Communicating Finite-State Machines." dr. ACM 30,2 (Apr. 1983), 323-342.

Digital Library

Google Scholar

[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 Scholar

[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).

Digital Library

Google Scholar

[8]

Lynch, W.C., "Reliable Full-Duplex Transmission over Half-Duplex Telephone Lines." Comm. ACM tl,6 (June 1968), 361-371.

Digital Library

Google Scholar

[9]

Simpson, William F. and Bavel, Z., "Tag-Automaton Derived Measures of Polysemy on Roger's International Thesaurus." In preparation.

Google Scholar

Cited By

View all

Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldACM SIGCOMM Computer Communication Review10.1145/55483.5549717:5(136-150)Online publication date: 1-Oct-1987
https://doi.org/10.1145/55483.55497
Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldACM SIGCOMM Computer Communication Review10.1145/55483.5549717:5(136-150)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1145/55483.55497
Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldProceedings of the ACM workshop on Frontiers in computer communications technology10.1145/55482.55497(136-150)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1145/55482.55497

Index Terms

Tier automation representation of communication protocols

Recommendations

Tier automation representation of communication protocols
SIGCOMM '86: Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols

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 ...
Two-phase Nonrepudiation Protocols
ICCCNT '16: Proceedings of the 7th International Conference on Computing Communication and Networking Technologies

A nonrepudiation protocol from party S to party R performs two tasks. First, the protocol enables party S to send to party R some text x along with a proof (that can convince a judge) that x was indeed sent by S. Second, the protocol enables party R to ...
Protocols for Multiparty Coin Toss with a Dishonest Majority

Coin-tossing protocols are protocols that generate a random bit with uniform distribution, although some corrupted parties might try to bias the output. These protocols are used as a building block in many cryptographic protocols. Cleve (Proc. of the ...

Comments

Information & Contributors

Information

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

SIGCOMM '86: Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
September 1986
414 pages
ISBN:0897912012
DOI:10.1145/18172
Editors:
Walter Kosinsky,
J Joaquin Garcia-Luna,
Franklin F Kuo

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: 01 August 1986

Published in SIGCOMM-CCR Volume 16, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
430
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)23

Reflects downloads up to 01 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldACM SIGCOMM Computer Communication Review10.1145/55483.5549717:5(136-150)Online publication date: 1-Oct-1987
https://doi.org/10.1145/55483.55497
Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldACM SIGCOMM Computer Communication Review10.1145/55483.5549717:5(136-150)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1145/55483.55497
Bavel ZGfrzymala-Busse JHsia Y(1987)New communication protocols from oldProceedings of the ACM workshop on Frontiers in computer communications technology10.1145/55482.55497(136-150)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1145/55482.55497

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations