| 由Petri网模型求系统最小割集的自顶向下法 |
| |
| 引用本文： | 胡昌华,陈新海.由Petri网模型求系统最小割集的自顶向下法[J].系统工程与电子技术,2000,22(4). |
| |
| 作者姓名： | 胡昌华 陈新海 |
| |
| 作者单位： | 1. 西安二炮工程学院302教研室,710025
2. 西北工业大学航天学院,西安,710072 |
| |
| 基金项目： | 国家自然科学基金重点项目 !(69831 0 4 0 )，国防科技图书出版基金资助课题 |
| |
| 摘 要： | 研究了系统逻辑关系的Petri网表示 ,基于Petri网的建模方法 ,采用Petri网模型求系统最小割集的自顶向下法。与故障树方法相比 ,这种方法可同时获得系统的最小割集和最小路集 ,且求解的效率高。实例分析证实了这一点。
|
| 关 键 词： | 逻辑运算 有向图形学 故障树形图分析 Petri网 |
A Top-to-Down Method Getting the System's Minimal Cut Sets by Petri Net |
| |
| Hu Changhua,Chen Xinhai.A Top-to-Down Method Getting the System's Minimal Cut Sets by Petri Net[J].System Engineering and Electronics,2000,22(4). |
| |
| Authors: | Hu Changhua Chen Xinhai |
| |
| Abstract: | The Petri net is employed to model the logical relation and to get the minimal cut sets and the minimal path sets of the system's event, a top-to-down algorithm for this purpose is got. Compared with the fault tree analysis method, the Petri net method can get the minimal cut sets and path sets at the same time and is more effective. An example is employed to verify this point. |
| |
| Keywords: | Logical operation Directed graphics Fault tree analysis Petri net |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
