一种新的基于FSM的UIO序列生成算法  

A New Algorithm for Generating UIO Sequences Based on FSM

作　　者：高珊[1] 李华[1,2] 郭亚杰[1] 

机构地区：[1]内蒙古大学计算机学院,呼和浩特010021 [2]内蒙古大学网络信息中心,呼和浩特010021

出　　处：《内蒙古大学学报（自然科学版）》2011年第5期596-600,共5页Journal of Inner Mongolia University：Natural Science Edition

基　　金：内蒙古大学本科生创新培养基金项目资助

摘　　要：在一致性测试中,如何有效地生成UIO序列一直为人们所关注.针对此,提出一种新的基于FSM的UIO序列生成算法,进而由C语言编写实现.该思想采用栈和结构体相结合的思路来保存UIO序列的完整路径,实验结果表明能够正确生成FSM图中各个状态的最短UIO序列.In the field of protocal conformance test,how to generate a shorter UIO sequence efficiently has always been focused.Aiming at this,a new algorithm for generating UIO sequences based on FSM has been proposed and then achieved by C language program.This algorithm combines stack with struct to record the entire paths of UIO sequences.The result of experiment demonstrates that this algorithm can create accurate and shortest UIO sequences of all kinds of nodes based on FSM.

关 键 词：有限状态机(FSM) UIO序列 生成算法 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]