Mohamed G. Gouda
ABSTRACT
We illustrate the usefulness of communicating finite state machines in modeling a number of physical layer protocols that include (i) an asynchronous start-stop protocol and (ii) a protocol for synchronous transmission with modems. Each protocol is modeled as a network of four finite state machines that communicate by exchanging messages over unbounded, FIFO channels. (Two machines are used to model the protocol itself, while the other two are used to model its interface to the upper data link protocol in the protocol hierarchy.) We outline a methodology to verify communication boundedness and progress for each protocol model. The methodology is based on three techniques that were proposed earlier to verify networks of communicating finite state machines; they are network decomposition, machine equivalence, and closed covers.
- 1.H. V. Bertine, "Physical interfaces and protocols," in Computer Network Architectures and Protocols, P. E. Green, Ed. New York: Plenum ~'ress, 1982, pp. 57-83.Google Scholar
- 2.G. V. Bochmann, "Finite state description of communication protocols," Comput. Networks, vol. 2, pp. 361-371, 1978.Google Scholar
- 3.G. V. Boehmann and C. Sunshine, "Formal methods in communication protocol design," IEEE Trans. Commun., vol. COM-28, pp.624-631, Apr. 1980.Google Scholar
- 4.D. Brand and P. Zafiropulo, "On communicating finite-state machines," Journal ACM, vol. 30, pp. 323-342, Apr. 1983. Google ScholarDigital Library
- 5.C. H. Chow, M. G. Gouda, and S. S. Lam, "An exercise in constructing multi-phase communication protocols," in Proc. SIGCOMM 'Sd Symposium, June 1084. Google ScholarDigital Library
- 6.C. H. Chow, M. G. Gouda, and S. S. Lain, "A discipline for constructing multi-phase communication protocols," ACM Trans. Comput. Syst., to appear Nov. 1985. Google ScholarDigital Library
- 7.R. J. Cypser, Communications Architecture for Diztributed Systems. Reading, MA: Addison- Wesley, 1978. Google ScholarDigital Library
- 8.M. G. Gouda, "Closed covers: to verify progress for communicating finite state machines," IEEE Trans. Software Eng., vol. SE-10, pp. 840-855, Nov. 1984.Google ScholarDigital Library
- 9.M. G. Gouda and K. S. The, "On modeling and verification of physical layer protocols," Tech. Rep., Dep. Comput. Sci., Univ. Texas, Austin, TX, in preparation.Google Scholar
- 10.M. G. Gouda, K. S. The, and C. K. Chang, "Verification of distributed synchronization systems via deeomposltion," Teeh. Rep., Dep. Comput. Sci., Univ. Texas, Austin, TX, in preparation.Google Scholar
- 11.M. G. Gouda and C. H. Youn, "On the notion of equivalence for communicating finite state machines," TR-84-1j, Dep. Comput. Sci., Univ. Texas, Austin, TX, May 1984. Revised Feb. 1985. Google ScholarDigital Library
- 12.B. T. Hailpern and S. S. Owicki, "Modular verification of computer communication protocols," IEEE Trans. Commun., vol. COM-31, pp. 56-68, Jan. 1983.Google Scholar
- 13.S. S. Lain and A. U. Shankar, "Protocol verification via projections," IEEE Trans. Software Eng., vol. SE-10, pp.325-342, July 1984.Google ScholarDigital Library
- 14.J. E. McNamara, Technical A,pects of Data Communication. Maynard, MA: Digital Equip. Corp., 1977. Google ScholarDigital Library
- 15.A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981. Google ScholarDigital Library
- 16.K. S. The, "A framework for formal modeling and verification of physical layer protocols," Master's thesis, Univ. Texas, Austin, TX, 1985.Google Scholar
- 17.P. Zafiropulo, C. H. West, H. Rudin, D. Brand, and D. Cowan, "Towards analyzing and synthesizing protocols," IEEE Trans. Commun., vol. COM-28, pp. 651-661, Apr. 1980.Google Scholar
Index Terms
- Modeling physical layer protocols using communicating finite state machines
Recommendations
Modeling physical layer protocols using communicating finite state machines
We illustrate the usefulness of communicating finite state machines in modeling a number of physical layer protocols that include (i) an asynchronous start-stop protocol and (ii) a protocol for synchronous transmission with modems. Each protocol is ...
Finite-state analysis of two contract signing protocols
Optimistic contract signing protocols allow two parties to commit to a previously agreed upon contract, relying on a third party to abort or confirm the contract if needed. These protocols are relatively subtle, since there may be interactions between ...
Lossy Communicating Finite State Machines
A network of communicating finite state machines (CFSM) consists of a set of finite state machines that communicate asynchronously with each other over (potentially) unbounded FIFO channels by sending and receiving typed messages. As a concurrency model,...
Comments