Referenced Items are not available for this document.
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
- Page(s):
- 126 - 133
- Meeting Date :
- 25 Oct 1994-28 Oct 1994
- Print ISBN:
- 0-8186-6685-4
- INSPEC Accession Number:
- 4834852
- Conference Location :
- Boston, MA
- Digital Object Identifier :
- 10.1109/ICNP.1994.344368
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
