By Topic

Single-link and time communicating finite state machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Peng, W. ; Dept. of Comput. Sci., Southwest Texas State Univ., San Marcos, TX, USA

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

Published in:

Network Protocols, 1994. Proceedings., 1994 International Conference on

Date of Conference:

25-28 Oct 1994