This paper investigates formal techniques of protocol based on communicating finite state machines (CFSM). Taking the protocols POLLEND (PE) and ACKNACK (AN) as the examples, the paper discusses the formal description...This paper investigates formal techniques of protocol based on communicating finite state machines (CFSM). Taking the protocols POLLEND (PE) and ACKNACK (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.展开更多
文摘This paper investigates formal techniques of protocol based on communicating finite state machines (CFSM). Taking the protocols POLLEND (PE) and ACKNACK (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.
