首页 | 本学科首页   官方微博 | 高级检索  
     

加权T-图活性的进一步研究
引用本文:许安国,王培良.加权T-图活性的进一步研究[J].计算机学报,1998,21(1):92-96.
作者姓名:许安国  王培良
作者单位:山东矿业学院应用数学与软件工程系,泰安,271019
摘    要:本文给出加权T-图是活网的另一组充分条件,这组条件包含了Teruel等对加权T-图活性分析的结果,方法简单,便于操作。Teruel文中研究了加权单回路网为守恒回路时活的一个充分条件,对一般加权T图活性的判断只限于每个回路是守恒回路的情况。

关 键 词:加权T-图  活性  可重复性
修稿时间:1997年3月31日

FURTHER RESEARCH OF LIVENESS FOR WEIGHTED T-GRAPHS
XU An-Guo,WANG Pei-Liang.FURTHER RESEARCH OF LIVENESS FOR WEIGHTED T-GRAPHS[J].Chinese Journal of Computers,1998,21(1):92-96.
Authors:XU An-Guo  WANG Pei-Liang
Abstract:This paper presents a set of sufficient conditions for the liveness ofweighted T-graphs, this set of conditions involves the condition given in Teruel'spapers for the liveness of weighted T-graphs, the given technique is simple andeasy to operate. In Teruel's paper, a sufficient condition has been studied for theliveness of weighted circuit net which is conservative circuit, the decision for theliveness of comrnon weighted T-graphs is only feasible in the case that every circuitis conservative one. Xu et al. proposed a necessary and sufficient condition in 1993to decide the liveness of weighted TAigraphs, but it is too complex to operate. Thispaper surmounts the shortcorning of Xu's paper, preserves the superiority ofTeruel's paper, and further more enlarges the adaptable range of theorem 4. 12 inTeruel's paper, that means in this paper, whether circuit in weighted T-graphs isconservative or gain circuit, the theorem always works.
Keywords:Weighted T-graphs  liveness  repetitiveness
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号