检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北工业大学精确制导与控制研究所,西安710072
出 处:《系统仿真学报》2009年第6期1583-1586,共4页Journal of System Simulation
摘 要:介绍了图形组态仿真软件系统分隔与模块排序算法,提出了基于邻接矩阵树搜索的系统分隔算法,这种算法易于编程实现,对于存在环路的仿真系统,不但可以迅速找到环路,还可以记录下环路内部各模块的输入/输出关系。对于模块排序给出了两种算法,一种是根据模块未知输入个数排序的算法,一种是根据各模块与输入模块距离大小排序的算法。根据模块距输入模块距离排序的算法只需要从每个输入模块对仿真系统进行遍历,不需要关注该模块的位置输入个数,因此算法相对要简单。这两种算法确定的模块计算顺序不一定相同。最后通过对一个图形组态仿真系统实例的分析验证了算法的合理性。System compartition and module sorting algorithms of diagram configuration simulation software were proposed.The introduced system compartition algorithm is the tree-searching algorithm based on adjacent matrix,and this kind of algorithm can be easily applied by programming.For the simulation systems which include many loops,the loops can be quickly found out,and the input/output relation between the modules in the loop can be also recorded.Two different sorting algorithms were discussed,one is based on the number of the unknown inputs,the other is based on the distance between input module.Comparatively,the second algorithm is much simpler,because it doesn't care about the number of unknown inputs.The sorting results of the two different sorting algorithms may be different.Finally,the efficiency of the algorithms was proved by analyzing a specific configuration simulation system.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.144