Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
On the progress of communication between two finite state machines
Information and Control
Tier automation representation of communication protocols
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Computer Systems: Reliable full-duplex file transmission over half-duplex telephone line
Communications of the ACM
| Hi-index | 0.00 |
The power tier automaton (PTA) is introduced as a model of preference for representing and manipulating systems in general, computer architectures and, in particular, communication networks and their protocols. The PTA is superior to Petri nets, both in computing power (Turing machine power) and in ease and selectivity of representation. The tier automaton, a species of the PTA, is used to represent networks and protocols to a greater advantage than other existing models. Homomorphisms and reachable-domain (r.d.) homomorphisms on tier automata are introduced and used to manipulate two distinct protocols for reliable full-duplex transmission over half-duplex lines, both of whose images are the same familiar alternating-bit protocol.