Close category search window
 

An investigation of formal techniques of protocol based on CFSM

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 $31
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)
Layuan, Li ; Wuhan Jiaotong University, 430063, P. R. China

This paper investigates formal techniques of protocol based on communicating finite state machines (CFSM). Taking the protocols POLL-END (PE) and ACK-NACK (AN) as the examples, the paper discusses the formal description, validation and conversion of protocol with the CFSM, presents a protocol validation method and a protocol conversion algorithm based on the CFSM and demonstrates the applicability of the method and the algorithm using the example protocols PE and AN.

Published in:
Systems Engineering and Electronics, Journal of  (Volume:8 ,  Issue: 2 )

Date of Publication: June 1997

Need Help?


IEEE Advancing Technology for Humanity 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.