检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中南工业大学学报》2000年第3期279-284,共6页Journal of Central South University of Technology(Natural Science)
基 金:国家"八五"重点科研项目! ( 9- 6 1);湖南省科委立项课题! ( 8712 7)
摘 要:任何既约的、强联结的时序机 ,必存在核实序列 .若该机存在区分序列 ,构造其核实序列的方法已经形成 ;但是 ,若该机不存在区分序列 ,需寻求构造其核实序列的方法 .作者从时序机的状态表出发 ,定义了划分序列 ,并针对无区分序列的时序机 ,提出了利用划分序列构造时序机核实序列的一种方法 .该方法中求划分序列部分建立在时序机的矩阵模型上 。In any reduced, strongly connected sequential machines, there exist checking experiments. The methods of constructing checking experiments have already been developed if such a sequential machine has a distinguishing sequence. However, if a sequential machine has no distinguishing sequence, it is necessary to pursue the methods of constructing cheching experiments. After discussing the state tables of sequential machine, this paper defines dividing sequence and advances a method to construct checking experiments for a sequential machine that has no distinguishing sequence. This method can be easily implemented in engineering practice since the solution to dividing sequence is based on matrix model of sequential machine.
分 类 号:TP302.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112