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

EPr/TN网可达性分析的冗余并发后继标识
引用本文:沈俊,罗军舟.EPr/TN网可达性分析的冗余并发后继标识[J].计算机研究与发展,1998,35(3):251-254.
作者姓名:沈俊  罗军舟
作者单位:东南大学计算机系
基金项目:国家自然科学基金,江苏省自然科学基金
摘    要:文中针对EPr/TN网在可达性分析时出现的冗余发后继现象,从产生原因入手,给出一种解决算法,并由此深入这种扩展Petri网固有不完备性,最后提出了改进方法。

关 键 词:EPr/TN网  可达性分析  冗余并发后  计算机网络

REDUNDANT CONCURRENTABLE SUCCESSOR MARKINGS IN REACHABILITY ANALYSIS OF EPr/TN NET
Shen Jun,Luo Junzhou,and Gu Guanqun.REDUNDANT CONCURRENTABLE SUCCESSOR MARKINGS IN REACHABILITY ANALYSIS OF EPr/TN NET[J].Journal of Computer Research and Development,1998,35(3):251-254.
Authors:Shen Jun  Luo Junzhou  and Gu Guanqun
Abstract:In respect of redundant concurrentable successor, which occurs at the time of reachability analysis, the authors begin with examining its cause and then give a solution algorithm. Furthermore, the inherent incompleteness of that type of extended Petri net is studied. Finally, some methods of system modification are suggested.
Keywords:EPr/TN net  reachability analysis  redundant concurrentable successor  completeness
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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