Title :
Single-link and time communicating finite state machines
Author_Institution :
Dept. of Comput. Sci., Southwest Texas State Univ., San Marcos, TX, USA
Abstract :
We propose two variants of the classical communicating finite state machines (CFSMs) model, single-link communicating finite state machines (SLCFSMs) and time communicating finite state machines (TCFSMs). For SLCFSMs the notion of well-formedness, which provides a necessary condition for SLCFSMs to be free of some logical errors, is proposed. For TCFSMs, it is argued that they are more suitable for modeling delay-sensitive distributed algorithms/communication protocols. Two practical communication protocols, a token ring and a sliding window protocol, are modeled using TCFSMs
Keywords :
communicating sequential processes; distributed algorithms; finite state machines; protocols; token networks; communication protocols; delay-sensitive distributed algorithms; event sequences; necessary condition; sliding window protocol; time communicating finite state machines; token ring; Automata; Communication system control; Computer science; Concurrent computing; Delay; Distributed algorithms; Protocols; Time factors; Token networks;
Conference_Titel :
Network Protocols, 1994. Proceedings., 1994 International Conference on
Conference_Location :
Boston, MA
Print_ISBN :
0-8186-6685-4
DOI :
10.1109/ICNP.1994.344368
