Modeling communications protocols by automata

1 October 1979

proceedings article
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/sfcs.1979.23

Abstract

Using a pair of finite-state automata to model the transmitter-receiver protocol in a data communications system, we derive lower bounds on the size of automata needed to achieve reliable communication across an error-phone channel. We also show that, at the cost of increasing the size of the automata, a transmission rate close to the theoretical maximum can be achieved.

Keywords

PROTOCOLS
AUTOMATA
DELAY
RADIO ACCESS NETWORKS
ERROR CORRECTION CODES
REDUNDANCY
DECODING
ERROR CORRECTION
CLOCKS

This publication has 2 references indexed in Scilit:

Survey of protocol definition and verification techniques
Computer Networks (1976), 1978
Basic limits on protocol information in data communication networks
IEEE Transactions on Information Theory, 1976